math / data /lean /OAI /LinearAlgebra /MatrixFields /Construction /ComplexLocalMaps.lean
introvoyz045's picture
Migrated from GitHub
4a56cd6 verified
Raw History Blame Contribute Delete
7.94 kB
import Mathlib
import OAI.LinearAlgebra.MatrixFields.Tensors.ComplexDotPairing
namespace OAI
namespace MatrixAllFields
open scoped BigOperators Topology Polynomial
section
namespace MatrixMultiplication.Foundation
namespace LocalMaps
open scoped BigOperators
variable {K X Y Z A B C A' B' C' : Type*}
variable [CommSemiring K] [Fintype A] [Fintype B] [Fintype C]
def fiberMatrix [DecidableEq X] (M : X β†’ A' β†’ A β†’ K) :
(X Γ— A') β†’ (X Γ— A) β†’ K :=
fun output input => if output.1 = input.1 then M output.1 output.2 input.2 else 0
def fiberTransform (MX : X β†’ A' β†’ A β†’ K) (MY : Y β†’ B' β†’ B β†’ K)
(MZ : Z β†’ C' β†’ C β†’ K) (T : Tensor K (X Γ— A) (Y Γ— B) (Z Γ— C)) :
Tensor K (X Γ— A') (Y Γ— B') (Z Γ— C') :=
fun x y z => βˆ‘ a, βˆ‘ b, βˆ‘ c,
MX x.1 x.2 a * MY y.1 y.2 b * MZ z.1 z.2 c *
T (x.1, a) (y.1, b) (z.1, c)
def originalScale (coefficient : X β†’ Y β†’ Z β†’ K)
(T : Tensor K (X Γ— A) (Y Γ— B) (Z Γ— C)) :
Tensor K (X Γ— A) (Y Γ— B) (Z Γ— C) :=
fun x y z => coefficient x.1 y.1 z.1 * T x y z
theorem fiberTransform_originalScale (MX : X β†’ A' β†’ A β†’ K)
(MY : Y β†’ B' β†’ B β†’ K) (MZ : Z β†’ C' β†’ C β†’ K)
(coefficient : X β†’ Y β†’ Z β†’ K)
(T : Tensor K (X Γ— A) (Y Γ— B) (Z Γ— C)) :
fiberTransform MX MY MZ (originalScale coefficient T) =
originalScale coefficient (fiberTransform MX MY MZ T) := by
funext x y z
simp only [fiberTransform, originalScale, Finset.mul_sum]
apply Finset.sum_congr rfl
intro a _
apply Finset.sum_congr rfl
intro b _
apply Finset.sum_congr rfl
intro c _
ac_rfl
theorem fiberTransform_substitution
(MX : X β†’ A' β†’ A β†’ K) (MY : Y β†’ B' β†’ B β†’ K)
(MZ : Z β†’ C' β†’ C β†’ K)
(T : Tensor K (X Γ— A) (Y Γ— B) (Z Γ— C))
(U : Tensor K (X Γ— A') (Y Γ— B') (Z Γ— C'))
(identity : fiberTransform MX MY MZ T = U)
(coefficient : X β†’ Y β†’ Z β†’ K) :
fiberTransform MX MY MZ (originalScale coefficient T) =
originalScale coefficient U := by
rw [fiberTransform_originalScale, identity]
theorem fiberTransform_eq_restrict [Fintype X] [Fintype Y] [Fintype Z]
[DecidableEq X] [DecidableEq Y] [DecidableEq Z]
(MX : X β†’ A' β†’ A β†’ K) (MY : Y β†’ B' β†’ B β†’ K)
(MZ : Z β†’ C' β†’ C β†’ K) (T : Tensor K (X Γ— A) (Y Γ— B) (Z Γ— C)) :
fiberTransform MX MY MZ T =
Tensor.restrict (fiberMatrix MX) (fiberMatrix MY) (fiberMatrix MZ) T := by
funext x y z
simp [fiberTransform, Tensor.restrict, fiberMatrix, Fintype.sum_prod_type,
ite_mul, mul_ite]
noncomputable def originalMask (P : X β†’ Y β†’ Z β†’ Prop)
(T : Tensor K (X Γ— A) (Y Γ— B) (Z Γ— C)) :
Tensor K (X Γ— A) (Y Γ— B) (Z Γ— C) := by
classical
exact fun x y z => if P x.1 y.1 z.1 then T x y z else 0
theorem fiberTransform_originalMask (MX : X β†’ A' β†’ A β†’ K)
(MY : Y β†’ B' β†’ B β†’ K) (MZ : Z β†’ C' β†’ C β†’ K)
(P : X β†’ Y β†’ Z β†’ Prop) (T : Tensor K (X Γ— A) (Y Γ— B) (Z Γ— C)) :
fiberTransform MX MY MZ (originalMask P T) =
originalMask P (fiberTransform MX MY MZ T) := by
classical
funext x y z
by_cases h : P x.1 y.1 z.1 <;> simp [fiberTransform, originalMask, h]
def SupportedOn (P : X β†’ Y β†’ Z β†’ Prop)
(T : Tensor K (X Γ— A) (Y Γ— B) (Z Γ— C)) : Prop :=
βˆ€ x y z, Β¬ P x.1 y.1 z.1 β†’ T x y z = 0
theorem fiberTransform_supportedOn (MX : X β†’ A' β†’ A β†’ K)
(MY : Y β†’ B' β†’ B β†’ K) (MZ : Z β†’ C' β†’ C β†’ K)
(P : X β†’ Y β†’ Z β†’ Prop) (T : Tensor K (X Γ— A) (Y Γ— B) (Z Γ— C))
(hT : SupportedOn P T) : SupportedOn P (fiberTransform MX MY MZ T) := by
intro x y z h
apply Finset.sum_eq_zero
intro a _
apply Finset.sum_eq_zero
intro b _
apply Finset.sum_eq_zero
intro c _
simp [hT (x.1, a) (y.1, b) (z.1, c) h]
omit [Fintype A] [Fintype B] [Fintype C] in
theorem originalMask_eq_self (P : X β†’ Y β†’ Z β†’ Prop)
(T : Tensor K (X Γ— A) (Y Γ— B) (Z Γ— C)) (hT : SupportedOn P T) :
originalMask P T = T := by
classical
funext x y z
by_cases h : P x.1 y.1 z.1
Β· simp [originalMask, h]
Β· simp [originalMask, h, hT x y z h]
noncomputable def localSelector (P : X β†’ Prop) : (X Γ— A) β†’ (X Γ— A) β†’ K := by
classical
exact fun output input =>
if output = input then (if P output.1 then 1 else 0) else 0
theorem factoredMask_eq_restrict [Fintype X] [Fintype Y] [Fintype Z]
(PX : X β†’ Prop) (PY : Y β†’ Prop) (PZ : Z β†’ Prop)
(T : Tensor K (X Γ— A) (Y Γ— B) (Z Γ— C)) :
originalMask (fun x y z => PX x ∧ PY y ∧ PZ z) T =
Tensor.restrict (localSelector PX) (localSelector PY) (localSelector PZ) T := by
classical
funext x y z
by_cases hx : PX x.1 <;> by_cases hy : PY y.1 <;> by_cases hz : PZ z.1 <;>
simp [originalMask, Tensor.restrict, localSelector, ite_mul, mul_ite, hx, hy, hz]
variable {Label : Type*}
def Synchronized (lx : X β†’ Label) (ly : Y β†’ Label) (lz : Z β†’ Label) :
X β†’ Y β†’ Z β†’ Prop :=
fun x y z => lx x = ly y ∧ lx x = lz z
def InBranch (lx : X β†’ Label) (ly : Y β†’ Label) (lz : Z β†’ Label)
(label : Label) : X β†’ Y β†’ Z β†’ Prop :=
fun x y z => lx x = label ∧ ly y = label ∧ lz z = label
omit [Fintype A] [Fintype B] [Fintype C] in
theorem factoredMask_synchronized
(lx : X β†’ Label) (ly : Y β†’ Label) (lz : Z β†’ Label)
(PX : X β†’ Prop) (PY : Y β†’ Prop) (PZ : Z β†’ Prop)
(support : X β†’ Y β†’ Z β†’ Prop)
(T : Tensor K (X Γ— A) (Y Γ— B) (Z Γ— C))
(hT : SupportedOn support T)
(compatible : βˆ€ x y z, support x y z β†’ PX x β†’ PY y β†’ PZ z β†’
Synchronized lx ly lz x y z) :
SupportedOn (Synchronized lx ly lz)
(originalMask (fun x y z => PX x ∧ PY y ∧ PZ z) T) := by
classical
intro x y z hn
by_cases hs : support x.1 y.1 z.1
· by_cases hw : PX x.1 ∧ PY y.1 ∧ PZ z.1
Β· exact (hn (compatible x.1 y.1 z.1 hs hw.1 hw.2.1 hw.2.2)).elim
Β· simp [originalMask, hw]
Β· simp [originalMask, hT x y z hs]
theorem controlled_eq_sum_branches [Fintype Label]
(lx : X β†’ Label) (ly : Y β†’ Label) (lz : Z β†’ Label)
(MX : Label β†’ X β†’ A' β†’ A β†’ K) (MY : Label β†’ Y β†’ B' β†’ B β†’ K)
(MZ : Label β†’ Z β†’ C' β†’ C β†’ K)
(T : Tensor K (X Γ— A) (Y Γ— B) (Z Γ— C)) :
fiberTransform (fun x => MX (lx x) x) (fun y => MY (ly y) y)
(fun z => MZ (lz z) z) (originalMask (Synchronized lx ly lz) T) =
fun x y z => βˆ‘ label,
fiberTransform (MX label) (MY label) (MZ label)
(originalMask (InBranch lx ly lz label) T) x y z := by
classical
funext x y z
by_cases h : Synchronized lx ly lz x.1 y.1 z.1
Β· have hy : ly y.1 = lx x.1 := h.1.symm
have hz : lz z.1 = lx x.1 := h.2.symm
rw [Finset.sum_eq_single (lx x.1)]
Β· simp [fiberTransform, originalMask, InBranch, h, hy, hz]
Β· intro label _ hlabel
have hn : lx x.1 β‰  label := Ne.symm hlabel
simp [fiberTransform, originalMask, InBranch, hn]
Β· simp
Β· have hn (label : Label) : Β¬ InBranch lx ly lz label x.1 y.1 z.1 := by
intro hb
exact h ⟨hb.1.trans hb.2.1.symm, hb.1.trans hb.2.2.symm⟩
simp [fiberTransform, originalMask, h, hn]
theorem controlled_eq_sum_branches_of_supported [Fintype Label]
(lx : X β†’ Label) (ly : Y β†’ Label) (lz : Z β†’ Label)
(MX : Label β†’ X β†’ A' β†’ A β†’ K) (MY : Label β†’ Y β†’ B' β†’ B β†’ K)
(MZ : Label β†’ Z β†’ C' β†’ C β†’ K)
(T : Tensor K (X Γ— A) (Y Γ— B) (Z Γ— C))
(hT : SupportedOn (Synchronized lx ly lz) T) :
fiberTransform (fun x => MX (lx x) x) (fun y => MY (ly y) y)
(fun z => MZ (lz z) z) T =
fun x y z => βˆ‘ label,
fiberTransform (MX label) (MY label) (MZ label)
(originalMask (InBranch lx ly lz label) T) x y z := by
have h := controlled_eq_sum_branches lx ly lz MX MY MZ T
rw [originalMask_eq_self _ _ hT] at h
exact h
end LocalMaps
end MatrixMultiplication.Foundation
end
end MatrixAllFields
end OAI