Download data/lean/OAI/Probability/BinarySweep/TensorBounds/SignedConjugation.lean from introvoyz045/math: direct link, hf CLI and curl.
- Browser
- Download file 4.62 kB
-
https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/Probability/BinarySweep/TensorBounds/SignedConjugation.lean
- Command line
-
hf download hf://datasets/introvoyz045/math/data/lean/OAI/Probability/BinarySweep/TensorBounds/SignedConjugation.lean
-
curl -L -o SignedConjugation.lean https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/Probability/BinarySweep/TensorBounds/SignedConjugation.lean
4.62 kB
| import Mathlib | |
| import OAI.Probability.BinarySweep.TensorBounds.SignedBlock | |
| namespace OAI | |
| noncomputable section | |
| section | |
| open scoped BigOperators Classical ComplexOrder | |
| open Matrix | |
| namespace BinaryCoordinateSweeps.Signed | |
| open Density Irrep Representation | |
| variable {A : Type*} [Fintype A] [DecidableEq A] {n : β} | |
| lemma actionMatrix_mul (p : A β Bool) (g h : Equiv.Perm (Fin n)) : | |
| actionMatrix p (g*h)=actionMatrix p g*actionMatrix p h := by | |
| change LinearMap.toMatrix' ((tensorRep p n) (g*h))=_ | |
| rw [map_mul] | |
| exact LinearMap.toMatrix'_comp _ _ | |
| lemma actionMatrix_one (p : A β Bool) : actionMatrix (n:=n) p 1=1 := by | |
| change LinearMap.toMatrix' ((tensorRep p n) 1)=_ | |
| rw [map_one] | |
| exact LinearMap.toMatrix'_id | |
| lemma actionMatrix_inv (p : A β Bool) (g : Equiv.Perm (Fin n)) : | |
| actionMatrix p gβ»ΒΉ=(actionMatrix p g).conjTranspose := by | |
| calc | |
| _ = actionMatrix p gβ»ΒΉ*(actionMatrix p g*(actionMatrix p g).conjTranspose) := by | |
| rw [actionMatrix_unitary,mul_one] | |
| _ = _ := by rw [β mul_assoc,β actionMatrix_mul,inv_mul_cancel,actionMatrix_one,one_mul] | |
| def signedConj (p : A β Bool) (g : Equiv.Perm (Fin n)) | |
| (M : Matrix (Fin n β A) (Fin n β A) β) := | |
| actionMatrix p g*M*(actionMatrix p g).conjTranspose | |
| lemma signedConj_mul (p : A β Bool) (g : Equiv.Perm (Fin n)) | |
| (M L : Matrix (Fin n β A) (Fin n β A) β) : | |
| signedConj p g (M*L)=signedConj p g M*signedConj p g L := by | |
| unfold signedConj | |
| simp only [mul_assoc,β mul_assoc (actionMatrix p g).conjTranspose (actionMatrix p g), | |
| actionMatrix_star_mul,one_mul] | |
| lemma signedConj_psd (p : A β Bool) (g : Equiv.Perm (Fin n)) | |
| (M : Matrix (Fin n β A) (Fin n β A) β) (hM : M.PosSemidef) : | |
| (signedConj p g M).PosSemidef := hM.mul_mul_conjTranspose_same _ | |
| lemma signedConj_fixed (p : A β Bool) (g : Equiv.Perm (Fin n)) | |
| (M : Matrix (Fin n β A) (Fin n β A) β) | |
| (hc : M*actionMatrix p g=actionMatrix p g*M) : signedConj p g M=M := by | |
| unfold signedConj | |
| rw [β hc,mul_assoc,actionMatrix_unitary,mul_one] | |
| lemma signedConj_commutes (p : A β Bool) (g : Equiv.Perm (Fin n)) | |
| (M Q : Matrix (Fin n β A) (Fin n β A) β) | |
| (hc : M*actionMatrix p g=actionMatrix p g*M) (hq : M*Q=Q*M) : | |
| M*signedConj p g Q=signedConj p g Q*M := by | |
| rw [β signedConj_fixed p g M hc,β signedConj_mul,β signedConj_mul,hq] | |
| lemma signedConj_sub_smul_sum {U : Type*} [Fintype U] (p : A β Bool) (g : Equiv.Perm (Fin n)) | |
| (c : β) (M : U β Matrix (Fin n β A) (Fin n β A) β) | |
| (Q : Matrix (Fin n β A) (Fin n β A) β) : | |
| signedConj p g (c β’ βu, M u-Q)=c β’ βu, signedConj p g (M u)-signedConj p g Q := by | |
| simp [signedConj,mul_sub,sub_mul,Matrix.mul_sum,Matrix.sum_mul] | |
| end BinaryCoordinateSweeps.Signed | |
| end | |
| open scoped BigOperators Classical Kronecker | |
| open Matrix | |
| namespace BinaryCoordinateSweeps.Density | |
| variable {A B G : Type*} [Fintype A] [DecidableEq A] [Fintype B] [DecidableEq B] | |
| def matrixSlice (M : Matrix (AΓB) (AΓB) β) (b c : B) : Matrix A A β := | |
| fun a a' => M (a,b) (a',c) | |
| omit [DecidableEq A] in | |
| lemma matrixSlice_mul_left (M : Matrix (AΓB) (AΓB) β) (T : Matrix A A β) (b c : B) : | |
| matrixSlice ((T ββ (1 : Matrix B B β))*M) b c = T*matrixSlice M b c := by | |
| ext a a' | |
| simp [matrixSlice,Matrix.mul_apply,Fintype.sum_prod_type, | |
| Matrix.one_apply,mul_ite,ite_mul] | |
| omit [DecidableEq A] in | |
| lemma matrixSlice_mul_right (M : Matrix (AΓB) (AΓB) β) (T : Matrix A A β) (b c : B) : | |
| matrixSlice (M*(T ββ (1 : Matrix B B β))) b c = matrixSlice M b c*T := by | |
| ext a a' | |
| simp [matrixSlice,Matrix.mul_apply,Fintype.sum_prod_type, | |
| Matrix.one_apply,mul_ite] | |
| omit [DecidableEq A] in | |
| theorem kronecker_centrality (T : G β Matrix A A β) (P : Matrix A A β) | |
| (hP : β X : Matrix A A β, (β g, X*T g=T g*X) β X*P=P*X) | |
| (M : Matrix (AΓB) (AΓB) β) | |
| (hM : β g, M*(T g ββ (1 : Matrix B B β))=(T g ββ (1 : Matrix B B β))*M) : | |
| M*(P ββ (1 : Matrix B B β))=(P ββ (1 : Matrix B B β))*M := by | |
| ext β¨a,bβ© β¨a',cβ© | |
| have hc : β g, matrixSlice M b c*T g=T g*matrixSlice M b c := by | |
| intro g | |
| have hh := congrArg (fun X => matrixSlice X b c) (hM g) | |
| simpa only [matrixSlice_mul_left,matrixSlice_mul_right] using hh | |
| have hh := hP (matrixSlice M b c) hc | |
| have he : matrixSlice (M*(P ββ (1 : Matrix B B β))) b c = | |
| matrixSlice ((P ββ (1 : Matrix B B β))*M) b c := by | |
| simpa only [matrixSlice_mul_left,matrixSlice_mul_right] using hh | |
| exact congrFun (congrFun he a) a' | |
| end BinaryCoordinateSweeps.Density | |
| end | |
| end OAI | |