-
Notifications
You must be signed in to change notification settings - Fork 1k
feat(RingTheory/Coalgebra): classical adjacency matrices are quantum adjacency matrices #34119
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
base: master
Are you sure you want to change the base?
feat(RingTheory/Coalgebra): classical adjacency matrices are quantum adjacency matrices #34119
Conversation
PR summary a3a10db0e9Import changes for modified filesNo significant changes to the import graph Import changes for all files
|
|
This pull request has conflicts, please merge |
|
The naming gets kinda weird because there's |
8059334 to
0808490
Compare
e4ed67c to
d64b261
Compare
| theorem update_eq_ite {β : Sort*} (f : α → β) (a' : α) (v : β) : | ||
| update f a' v = fun w ↦ if w = a' then v else f w := funext <| update_apply _ _ _ | ||
|
|
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
I think you'll find you don't need this lemma after #34344 lands
| have (x : n → R) : comul x = ∑ i, x i • (Pi.single i 1 ⊗ₜ[R] Pi.single i 1) := by | ||
| simp [comul, Pi.single, Function.update_eq_ite, Pi.smul_def, ← tmul_smul] | ||
| ext; simp [this, Pi.single, Function.update_eq_ite] |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Can you now drop Pi.single from this call?
These are operator algebraic ways of describing a classical finite graph.
We show what the convolutive ring on
m -> Rlooks like. In particular, that the convolutive product corresponds to the Hadamard product. That the convolutive unit1corresponds to the matrix of all1s. And that a diagonal of a matrixAis0(resp.,1) iffid * A.toLin' = 0(resp.,= id).As a result, we get that a matrix
Ais an adjacency matrix iff its linear map is convolutively idempotent, its intrinsic star is equal to its adjoint, and hasid * A.toLin' = 0. With the complete simple graph corresponding to1 - id.Motivation:
A quantum adjacency matrix is a linear operator that is convolutively idempotent. One then says that it is "real" if it's intrinsically self-adjoint, self-adjoint if it's self-adjoint, and directed when
star A = adjoint A. One also says it's "reflexive" ifid * f = idand "irreflexive" ifid * f = 0.So, this PR is the first of many on non-commutative graphs. It says that all finite classical adjacency matrix operators are quantum adjacency matrix operators. In particular, a simple graph's adjacency matrix operator is an irreflexive, self-adjoint, directed, and real quantum adjacency matrix operator.
Coalgebra R (Π i, A i)#34312