math / data /lean /OAI /LinearAlgebra /MatrixMultiplication /Separation /ComplexPrefixSeparationOrientations.lean
introvoyz045's picture
Migrated from GitHub
4a56cd6 verified
Raw History Blame Contribute Delete
13.6 kB
import OAI.LinearAlgebra.MatrixMultiplication.Polynomial.ComplexPrefixSeparationPolynomialStage
namespace OAI
/-! Finite type counts, hierarchy separation and tensor execution bounds. -/
noncomputable section
namespace MatrixMultiplication.Foundation.PrefixSeparationOrientations
open Tensor LabelHierarchySeparation PolynomialLocalConstruction
open PrefixSeparationPolynomialStage
variable {Prefix X Y Z : Type*}
def auxiliaryXZ (k : β„•) :
Tensor β„‚ (PoolAuxiliaryGroup k) (PoolAuxiliaryGroup k) (PoolAuxiliaryGroup k) :=
fun a b c => poolAuxiliaryTensor k a c b
def auxiliaryYZ (k : β„•) :
Tensor β„‚ (PoolAuxiliaryGroup k) (PoolAuxiliaryGroup k) (PoolAuxiliaryGroup k) :=
fun a b c => poolAuxiliaryTensor k b c a
theorem auxiliaryXZ_rankAtMost (k : β„•) :
RankAtMost (auxiliaryXZ k) (poolAuxiliaryCost k) := by
obtain ⟨a, b, c, h⟩ := poolAuxiliaryTensor_rankAtMost k
refine ⟨a, c, b, ?_⟩
funext x y z
change poolAuxiliaryTensor k x z y = _
rw [h]
apply Finset.sum_congr rfl
intro i hi
simp only [rankOne]
ring
theorem auxiliaryYZ_rankAtMost (k : β„•) :
RankAtMost (auxiliaryYZ k) (poolAuxiliaryCost k) := by
obtain ⟨a, b, c, h⟩ := poolAuxiliaryTensor_rankAtMost k
refine ⟨c, a, b, ?_⟩
funext x y z
change poolAuxiliaryTensor k y z x = _
rw [h]
apply Finset.sum_congr rfl
intro i hi
simp only [rankOne]
ring
def stageLeadingXZ (k : β„•)
(codeX : Prefix β†’ X β†’ Fin k) (codeZ : Prefix β†’ Z β†’ Fin k)
(keepX : Prefix β†’ X β†’ Prop) (keepY : Prefix β†’ Y β†’ Prop)
(keepZ : Prefix β†’ Z β†’ Prop) (prior : Prefix) :
Tensor β„‚ (X Γ— InformedOutput k) (Y Γ— MissingOutput k) (Z Γ— InformedOutput k) :=
fun x y z => stageLeading k codeX codeZ keepX keepZ keepY prior x z y
def stageLeadingYZ (k : β„•)
(codeY : Prefix β†’ Y β†’ Fin k) (codeZ : Prefix β†’ Z β†’ Fin k)
(keepX : Prefix β†’ X β†’ Prop) (keepY : Prefix β†’ Y β†’ Prop)
(keepZ : Prefix β†’ Z β†’ Prop) (prior : Prefix) :
Tensor β„‚ (X Γ— MissingOutput k) (Y Γ— InformedOutput k) (Z Γ— InformedOutput k) :=
fun x y z => stageLeading k codeY codeZ keepY keepZ keepX prior y z x
theorem stageLeadingXZ_synchronized (k : β„•)
(codeX : Prefix β†’ X β†’ Fin k) (codeZ : Prefix β†’ Z β†’ Fin k)
(keepX : Prefix β†’ X β†’ Prop) (keepY : Prefix β†’ Y β†’ Prop)
(keepZ : Prefix β†’ Z β†’ Prop) (prior : Prefix)
(x : X Γ— InformedOutput k) (y : Y Γ— MissingOutput k) (z : Z Γ— InformedOutput k)
(codes : codeX prior x.1 = codeZ prior z.1)
(nonzero : stageLeadingXZ k codeX codeZ keepX keepY keepZ prior x y z β‰  0) :
x.2.1 = y.2.1 ∧ x.2.1 = z.2.1 ∧ x.2.2 = z.2.2 := by
obtain ⟨hxz, hxy, hij⟩ := stageLeading_synchronized k codeX codeZ
keepX keepZ keepY prior x z y codes nonzero
exact ⟨hxy, hxz, hij⟩
theorem stageLeadingYZ_synchronized (k : β„•)
(codeY : Prefix β†’ Y β†’ Fin k) (codeZ : Prefix β†’ Z β†’ Fin k)
(keepX : Prefix β†’ X β†’ Prop) (keepY : Prefix β†’ Y β†’ Prop)
(keepZ : Prefix β†’ Z β†’ Prop) (prior : Prefix)
(x : X Γ— MissingOutput k) (y : Y Γ— InformedOutput k) (z : Z Γ— InformedOutput k)
(codes : codeY prior y.1 = codeZ prior z.1)
(nonzero : stageLeadingYZ k codeY codeZ keepX keepY keepZ prior x y z β‰  0) :
x.2.1 = y.2.1 ∧ x.2.1 = z.2.1 ∧ y.2.2 = z.2.2 := by
obtain ⟨hyz, hyx, hij⟩ := stageLeading_synchronized k codeY codeZ
keepY keepZ keepX prior y z x codes nonzero
exact ⟨hyx.symm, hyx.symm.trans hyz, hij⟩
theorem stageLeadingXZ_retains_pairing (k : β„•)
(codeX : Prefix β†’ X β†’ Fin k) (codeZ : Prefix β†’ Z β†’ Fin k)
(keepX : Prefix β†’ X β†’ Prop) (keepY : Prefix β†’ Y β†’ Prop)
(keepZ : Prefix β†’ Z β†’ Prop) (prior : Prefix) (x : X) (y : Y) (z : Z)
(hx : keepX prior x) (hy : keepY prior y) (hz : keepZ prior z)
(codes : codeX prior x = codeZ prior z) (i : Fin k) :
stageLeadingXZ k codeX codeZ keepX keepY keepZ prior
(x, (codeX prior x, i)) (y, (codeX prior x, PUnit.unit))
(z, (codeX prior x, i)) = 1 :=
stageLeading_retains_pairing k codeX codeZ keepX keepZ keepY prior x z y hx hz hy codes i
theorem stageLeadingYZ_retains_pairing (k : β„•)
(codeY : Prefix β†’ Y β†’ Fin k) (codeZ : Prefix β†’ Z β†’ Fin k)
(keepX : Prefix β†’ X β†’ Prop) (keepY : Prefix β†’ Y β†’ Prop)
(keepZ : Prefix β†’ Z β†’ Prop) (prior : Prefix) (x : X) (y : Y) (z : Z)
(hx : keepX prior x) (hy : keepY prior y) (hz : keepZ prior z)
(codes : codeY prior y = codeZ prior z) (i : Fin k) :
stageLeadingYZ k codeY codeZ keepX keepY keepZ prior
(x, (codeY prior y, PUnit.unit)) (y, (codeY prior y, i))
(z, (codeY prior y, i)) = 1 :=
stageLeading_retains_pairing k codeY codeZ keepY keepZ keepX prior y z x hy hz hx codes i
theorem exists_prefix_stage_XZ (k : β„•)
(codeX : Prefix β†’ X β†’ Fin k) (codeZ : Prefix β†’ Z β†’ Fin k)
(keepX : Prefix β†’ X β†’ Prop) (keepY : Prefix β†’ Y β†’ Prop)
(keepZ : Prefix β†’ Z β†’ Prop)
(eligible : Prefix β†’ X β†’ Y β†’ Z β†’ Prop)
(agree : βˆ€ p x y z, eligible p x y z β†’ codeX p x = codeZ p z) :
βˆƒ (MX : Prefix β†’ X β†’ InformedOutput k β†’ PoolAuxiliaryGroup k β†’ Polynomial β„‚)
(MY : Prefix β†’ Y β†’ MissingOutput k β†’ PoolAuxiliaryGroup k β†’ Polynomial β„‚)
(MZ : Prefix β†’ Z β†’ InformedOutput k β†’ PoolAuxiliaryGroup k β†’ Polynomial β„‚),
(βˆ€ p x u i, (MX p x u i).degree ≀ (0 : β„•)) ∧
(βˆ€ p y v j, (MY p y v j).degree ≀ (0 : β„•)) ∧
(βˆ€ p z w l, (MZ p z w l).degree ≀ (0 : β„•)) ∧
βˆ€ p x y z, eligible p x.1 y.1 z.1 β†’
kernel (auxiliaryXZ k) (MX p) (MY p) (MZ p) x y z =
Polynomial.C (stageLeadingXZ k codeX codeZ keepX keepY keepZ p x y z) := by
classical
obtain ⟨left, right, tag, coefficients⟩ := exists_auxiliary_coordinates k
let fx : Prefix β†’ X Γ— InformedOutput k β†’ PoolAuxiliaryGroup k :=
fun p x => left (codeX p x.1) x.2.2
let fy : Prefix β†’ Y Γ— MissingOutput k β†’ PoolAuxiliaryGroup k := fun _ y => tag y.2.1
let fz : Prefix β†’ Z Γ— InformedOutput k β†’ PoolAuxiliaryGroup k :=
fun p z => right (codeZ p z.1) z.2.2
let MX := fun p => weightedCoordinatePolynomialMatrix (fx p)
(informedWeight (keepX p) (codeX p))
let MY := fun p => weightedCoordinatePolynomialMatrix (fy p) (missingWeight (keepY p))
let MZ := fun p => weightedCoordinatePolynomialMatrix (fz p)
(informedWeight (keepZ p) (codeZ p))
refine ⟨MX, MY, MZ, ?_, ?_, ?_, ?_⟩
Β· intro p x u i
exact weightedCoordinatePolynomialMatrix_degree _ _ x u i
Β· intro p y v j
exact weightedCoordinatePolynomialMatrix_degree _ _ y v j
Β· intro p z w l
exact weightedCoordinatePolynomialMatrix_degree _ _ z w l
Β· intro p x y z h
have codes := agree p x.1 y.1 z.1 h
change kernel (auxiliaryXZ k)
(weightedCoordinatePolynomialMatrix (fx p) (informedWeight (keepX p) (codeX p)))
(weightedCoordinatePolynomialMatrix (fy p) (missingWeight (keepY p)))
(weightedCoordinatePolynomialMatrix (fz p) (informedWeight (keepZ p) (codeZ p))) x y z = _
rw [kernel_weightedCoordinatePolynomialMatrix]
dsimp only [fx, fy, fz, auxiliaryXZ]
rw [← codes, coefficients]
congr 1
unfold informedWeight missingWeight stageLeadingXZ stageLeading
split_ifs <;> simp_all
theorem exists_prefix_stage_YZ (k : β„•)
(codeY : Prefix β†’ Y β†’ Fin k) (codeZ : Prefix β†’ Z β†’ Fin k)
(keepX : Prefix β†’ X β†’ Prop) (keepY : Prefix β†’ Y β†’ Prop)
(keepZ : Prefix β†’ Z β†’ Prop)
(eligible : Prefix β†’ X β†’ Y β†’ Z β†’ Prop)
(agree : βˆ€ p x y z, eligible p x y z β†’ codeY p y = codeZ p z) :
βˆƒ (MX : Prefix β†’ X β†’ MissingOutput k β†’ PoolAuxiliaryGroup k β†’ Polynomial β„‚)
(MY : Prefix β†’ Y β†’ InformedOutput k β†’ PoolAuxiliaryGroup k β†’ Polynomial β„‚)
(MZ : Prefix β†’ Z β†’ InformedOutput k β†’ PoolAuxiliaryGroup k β†’ Polynomial β„‚),
(βˆ€ p x u i, (MX p x u i).degree ≀ (0 : β„•)) ∧
(βˆ€ p y v j, (MY p y v j).degree ≀ (0 : β„•)) ∧
(βˆ€ p z w l, (MZ p z w l).degree ≀ (0 : β„•)) ∧
βˆ€ p x y z, eligible p x.1 y.1 z.1 β†’
kernel (auxiliaryYZ k) (MX p) (MY p) (MZ p) x y z =
Polynomial.C (stageLeadingYZ k codeY codeZ keepX keepY keepZ p x y z) := by
classical
obtain ⟨left, right, tag, coefficients⟩ := exists_auxiliary_coordinates k
let fx : Prefix β†’ X Γ— MissingOutput k β†’ PoolAuxiliaryGroup k := fun _ x => tag x.2.1
let fy : Prefix β†’ Y Γ— InformedOutput k β†’ PoolAuxiliaryGroup k :=
fun p y => left (codeY p y.1) y.2.2
let fz : Prefix β†’ Z Γ— InformedOutput k β†’ PoolAuxiliaryGroup k :=
fun p z => right (codeZ p z.1) z.2.2
let MX := fun p => weightedCoordinatePolynomialMatrix (fx p) (missingWeight (keepX p))
let MY := fun p => weightedCoordinatePolynomialMatrix (fy p)
(informedWeight (keepY p) (codeY p))
let MZ := fun p => weightedCoordinatePolynomialMatrix (fz p)
(informedWeight (keepZ p) (codeZ p))
refine ⟨MX, MY, MZ, ?_, ?_, ?_, ?_⟩
Β· intro p x u i
exact weightedCoordinatePolynomialMatrix_degree _ _ x u i
Β· intro p y v j
exact weightedCoordinatePolynomialMatrix_degree _ _ y v j
Β· intro p z w l
exact weightedCoordinatePolynomialMatrix_degree _ _ z w l
Β· intro p x y z h
have codes := agree p x.1 y.1 z.1 h
change kernel (auxiliaryYZ k)
(weightedCoordinatePolynomialMatrix (fx p) (missingWeight (keepX p)))
(weightedCoordinatePolynomialMatrix (fy p) (informedWeight (keepY p) (codeY p)))
(weightedCoordinatePolynomialMatrix (fz p) (informedWeight (keepZ p) (codeZ p))) x y z = _
rw [kernel_weightedCoordinatePolynomialMatrix]
dsimp only [fx, fy, fz, auxiliaryYZ]
rw [← codes, coefficients]
congr 1
unfold informedWeight missingWeight stageLeadingYZ stageLeading
split_ifs <;> simp_all
section RawPools
variable {RawLabel : Type*} [DecidableEq RawLabel]
def rawPoolLeadingXZ (pool : Prefix β†’ Finset RawLabel) (k : β„•) (positive : 0 < k)
(counts : βˆ€ p, (pool p).card = k)
(readX : Prefix β†’ X β†’ RawLabel) (readZ : Prefix β†’ Z β†’ RawLabel) (prior : Prefix) :
Tensor β„‚ (X Γ— InformedOutput k) (Y Γ— MissingOutput k) (Z Γ— InformedOutput k) :=
fun x y z => rawPoolLeading pool k positive counts readX readZ prior x z y
def rawPoolLeadingYZ (pool : Prefix β†’ Finset RawLabel) (k : β„•) (positive : 0 < k)
(counts : βˆ€ p, (pool p).card = k)
(readY : Prefix β†’ Y β†’ RawLabel) (readZ : Prefix β†’ Z β†’ RawLabel) (prior : Prefix) :
Tensor β„‚ (X Γ— MissingOutput k) (Y Γ— InformedOutput k) (Z Γ— InformedOutput k) :=
fun x y z => rawPoolLeading pool k positive counts readY readZ prior y z x
theorem exists_raw_pool_stage_XZ (pool : Prefix β†’ Finset RawLabel) (k : β„•)
(positive : 0 < k) (counts : βˆ€ p, (pool p).card = k)
(readX : Prefix β†’ X β†’ RawLabel) (readZ : Prefix β†’ Z β†’ RawLabel)
(eligible : Prefix β†’ X β†’ Y β†’ Z β†’ Prop)
(agree : βˆ€ p x y z, eligible p x y z β†’ readX p x = readZ p z) :
βˆƒ (MX : Prefix β†’ X β†’ InformedOutput k β†’ PoolAuxiliaryGroup k β†’ Polynomial β„‚)
(MY : Prefix β†’ Y β†’ MissingOutput k β†’ PoolAuxiliaryGroup k β†’ Polynomial β„‚)
(MZ : Prefix β†’ Z β†’ InformedOutput k β†’ PoolAuxiliaryGroup k β†’ Polynomial β„‚),
(βˆ€ p x u i, (MX p x u i).degree ≀ (0 : β„•)) ∧
(βˆ€ p y v j, (MY p y v j).degree ≀ (0 : β„•)) ∧
(βˆ€ p z w l, (MZ p z w l).degree ≀ (0 : β„•)) ∧
βˆ€ p x y z, eligible p x.1 y.1 z.1 β†’
kernel (auxiliaryXZ k) (MX p) (MY p) (MZ p) x y z =
Polynomial.C (rawPoolLeadingXZ pool k positive counts readX readZ p x y z) := by
apply exists_prefix_stage_XZ k
(fun p x => maskedPoolCode pool k positive counts p (readX p x))
(fun p z => maskedPoolCode pool k positive counts p (readZ p z))
(fun p x => readX p x ∈ pool p) (fun _ _ => True)
(fun p z => readZ p z ∈ pool p) eligible
intro p x y z h
exact congrArg (maskedPoolCode pool k positive counts p) (agree p x y z h)
theorem exists_raw_pool_stage_YZ (pool : Prefix β†’ Finset RawLabel) (k : β„•)
(positive : 0 < k) (counts : βˆ€ p, (pool p).card = k)
(readY : Prefix β†’ Y β†’ RawLabel) (readZ : Prefix β†’ Z β†’ RawLabel)
(eligible : Prefix β†’ X β†’ Y β†’ Z β†’ Prop)
(agree : βˆ€ p x y z, eligible p x y z β†’ readY p y = readZ p z) :
βˆƒ (MX : Prefix β†’ X β†’ MissingOutput k β†’ PoolAuxiliaryGroup k β†’ Polynomial β„‚)
(MY : Prefix β†’ Y β†’ InformedOutput k β†’ PoolAuxiliaryGroup k β†’ Polynomial β„‚)
(MZ : Prefix β†’ Z β†’ InformedOutput k β†’ PoolAuxiliaryGroup k β†’ Polynomial β„‚),
(βˆ€ p x u i, (MX p x u i).degree ≀ (0 : β„•)) ∧
(βˆ€ p y v j, (MY p y v j).degree ≀ (0 : β„•)) ∧
(βˆ€ p z w l, (MZ p z w l).degree ≀ (0 : β„•)) ∧
βˆ€ p x y z, eligible p x.1 y.1 z.1 β†’
kernel (auxiliaryYZ k) (MX p) (MY p) (MZ p) x y z =
Polynomial.C (rawPoolLeadingYZ pool k positive counts readY readZ p x y z) := by
apply exists_prefix_stage_YZ k
(fun p y => maskedPoolCode pool k positive counts p (readY p y))
(fun p z => maskedPoolCode pool k positive counts p (readZ p z))
(fun _ _ => True) (fun p y => readY p y ∈ pool p)
(fun p z => readZ p z ∈ pool p) eligible
intro p x y z h
exact congrArg (maskedPoolCode pool k positive counts p) (agree p x y z h)
end RawPools
end MatrixMultiplication.Foundation.PrefixSeparationOrientations
end
end OAI