math / data /lean /OAI /LinearAlgebra /MatrixMultiplication /Polynomial /ComplexPolynomialControlledKernel.lean
introvoyz045's picture
Migrated from GitHub
4a56cd6 verified
Raw History Blame Contribute Delete
14.8 kB
import OAI.LinearAlgebra.MatrixMultiplication.Polynomial.ComplexPolynomialLocalConstruction
import OAI.LinearAlgebra.MatrixMultiplication.Tensor.ComplexTensorRestrictionComposition
namespace OAI
/-! Polynomial tensor restrictions and exact coefficient extraction. -/
noncomputable section
namespace MatrixMultiplication.Foundation
namespace PolynomialControlledKernel
open Tensor LocalMaps PolynomialLocalConstruction
open scoped BigOperators
section ScalarCoefficients
variable {F : Type*} [Field F]
theorem expanded_mul_coeff_window (P Q : Polynomial F) (d k : β„•) (a : F)
(hP : βˆ€ j, j < d β†’ P.coeff j = 0) (hPa : P.coeff d = a)
(j : β„•) (hj : j ≀ d * (k + 1) + k) :
(Polynomial.expand F (k + 1) P * Q).coeff j =
if d * (k + 1) ≀ j then a * Q.coeff (j - d * (k + 1)) else 0 := by
obtain ⟨Pβ‚€, hPβ‚€βŸ© := Polynomial.X_pow_dvd_iff.mpr hP
have hconstant : Pβ‚€.coeff 0 = a := by
rw [hPβ‚€] at hPa
simpa only [Polynomial.coeff_X_pow_mul', le_refl, ite_true, Nat.sub_self] using hPa
have hfactor : Polynomial.expand F (k + 1) P * Q =
Polynomial.X ^ (d * (k + 1)) *
(Q * Polynomial.expand F (k + 1) Pβ‚€) := by
rw [hPβ‚€, map_mul, map_pow, Polynomial.expand_X]
simp only [← pow_mul]
rw [Nat.mul_comm (k + 1) d]
ring
rw [hfactor, Polynomial.coeff_X_pow_mul']
split_ifs with hdj
Β· have hsmall : j - d * (k + 1) ≀ k := by omega
rw [Tensor.coeff_mul_expand_eq_constant Q Pβ‚€ a hconstant k _ hsmall,
Polynomial.coeff_mul_C, mul_comm]
Β· rfl
theorem expanded_mul_vanishes_of_leading_support (P Q : Polynomial F)
(d k : β„•) (a : F)
(hP : βˆ€ j, j < d β†’ P.coeff j = 0) (hPa : P.coeff d = a)
(hQ : a β‰  0 β†’ βˆ€ j, j < k β†’ Q.coeff j = 0)
(j : β„•) (hj : j < d * (k + 1) + k) :
(Polynomial.expand F (k + 1) P * Q).coeff j = 0 := by
rw [expanded_mul_coeff_window P Q d k a hP hPa j (Nat.le_of_lt hj)]
split_ifs with hdj
Β· by_cases ha : a = 0
Β· simp [ha]
Β· rw [hQ ha _ (by omega), mul_zero]
Β· rfl
theorem expanded_mul_leading_of_leading_support (P Q : Polynomial F)
(d k : β„•) (a b : F)
(hP : βˆ€ j, j < d β†’ P.coeff j = 0) (hPa : P.coeff d = a)
(hQb : a β‰  0 β†’ Q.coeff k = b) :
(Polynomial.expand F (k + 1) P * Q).coeff (d * (k + 1) + k) = a * b := by
rw [expanded_mul_coeff_window P Q d k a hP hPa _ le_rfl]
simp only [Nat.le_add_right, ite_true, Nat.add_sub_cancel_left]
by_cases ha : a = 0
Β· simp [ha]
Β· rw [hQb ha]
end ScalarCoefficients
abbrev Output (Prefix New OldCoord NewCoord : Type*) :=
(Prefix Γ— OldCoord) Γ— (New Γ— NewCoord)
section ActualMatrices
variable {X Y Z Prefix New PX PY PZ NX NY NZ AP BP CP AS BS CS : Type*}
variable [Fintype AP] [Fintype BP] [Fintype CP]
variable [Fintype AS] [Fintype BS] [Fintype CS]
def expandMap {O A : Type*} (factor : β„•) (M : X β†’ O β†’ A β†’ Polynomial β„‚) :
X β†’ O β†’ A β†’ Polynomial β„‚ :=
fun x output input => Polynomial.expand β„‚ factor (M x output input)
def controlledMap (kStep : β„•)
(previous : X β†’ (Prefix Γ— PX) β†’ AP β†’ Polynomial β„‚)
(step : Prefix β†’ X β†’ (New Γ— NX) β†’ AS β†’ Polynomial β„‚) :
X β†’ Output Prefix New PX NX β†’ (AP Γ— AS) β†’ Polynomial β„‚ :=
fun x output input =>
Polynomial.expand β„‚ (kStep + 1) (previous x output.1 input.1) *
step output.1.1 x output.2 input.2
omit [Fintype AP] [Fintype AS] in
theorem controlledMap_degree (kStep dPrevious dStep : β„•)
(previous : X β†’ (Prefix Γ— PX) β†’ AP β†’ Polynomial β„‚)
(step : Prefix β†’ X β†’ (New Γ— NX) β†’ AS β†’ Polynomial β„‚)
(hp : βˆ€ x output input, (previous x output input).degree ≀ dPrevious)
(hs : βˆ€ prior x output input, (step prior x output input).degree ≀ dStep)
(x : X) (output : Output Prefix New PX NX) (input : AP Γ— AS) :
(controlledMap kStep previous step x output input).degree ≀
dPrevious * (kStep + 1) + dStep := by
apply Polynomial.degree_le_of_natDegree_le
apply Polynomial.natDegree_mul_le_of_le
Β· rw [Polynomial.natDegree_expand]
exact Nat.mul_le_mul_right (kStep + 1)
(Polynomial.natDegree_le_of_degree_le (hp x output.1 input.1))
Β· exact Polynomial.natDegree_le_of_degree_le
(hs output.1.1 x output.2 input.2)
theorem kernel_expandMap (factor : β„•) (auxiliary : Tensor β„‚ AP BP CP)
(MX : X β†’ (Prefix Γ— PX) β†’ AP β†’ Polynomial β„‚)
(MY : Y β†’ (Prefix Γ— PY) β†’ BP β†’ Polynomial β„‚)
(MZ : Z β†’ (Prefix Γ— PZ) β†’ CP β†’ Polynomial β„‚)
(x : X Γ— (Prefix Γ— PX)) (y : Y Γ— (Prefix Γ— PY)) (z : Z Γ— (Prefix Γ— PZ)) :
kernel auxiliary (expandMap factor MX) (expandMap factor MY) (expandMap factor MZ)
x y z = Polynomial.expand β„‚ factor (kernel auxiliary MX MY MZ x y z) := by
simp only [kernel, fiberTransform, expandMap, map_sum, map_mul, Polynomial.expand_C]
def mixedStageKernel (auxiliary : Tensor β„‚ AS BS CS)
(SX : Prefix β†’ X β†’ (New Γ— NX) β†’ AS β†’ Polynomial β„‚)
(SY : Prefix β†’ Y β†’ (New Γ— NY) β†’ BS β†’ Polynomial β„‚)
(SZ : Prefix β†’ Z β†’ (New Γ— NZ) β†’ CS β†’ Polynomial β„‚) :
Tensor (Polynomial β„‚) (X Γ— Output Prefix New PX NX)
(Y Γ— Output Prefix New PY NY) (Z Γ— Output Prefix New PZ NZ) :=
fun x y z => kernel auxiliary (SX x.2.1.1) (SY y.2.1.1) (SZ z.2.1.1)
(x.1, x.2.2) (y.1, y.2.2) (z.1, z.2.2)
def controlledKernel (kStep : β„•)
(previousAuxiliary : Tensor β„‚ AP BP CP) (stepAuxiliary : Tensor β„‚ AS BS CS)
(MX : X β†’ (Prefix Γ— PX) β†’ AP β†’ Polynomial β„‚)
(MY : Y β†’ (Prefix Γ— PY) β†’ BP β†’ Polynomial β„‚)
(MZ : Z β†’ (Prefix Γ— PZ) β†’ CP β†’ Polynomial β„‚)
(SX : Prefix β†’ X β†’ (New Γ— NX) β†’ AS β†’ Polynomial β„‚)
(SY : Prefix β†’ Y β†’ (New Γ— NY) β†’ BS β†’ Polynomial β„‚)
(SZ : Prefix β†’ Z β†’ (New Γ— NZ) β†’ CS β†’ Polynomial β„‚) :
Tensor (Polynomial β„‚) (X Γ— Output Prefix New PX NX)
(Y Γ— Output Prefix New PY NY) (Z Γ— Output Prefix New PZ NZ) :=
kernel (Tensor.product previousAuxiliary stepAuxiliary)
(controlledMap kStep MX SX) (controlledMap kStep MY SY) (controlledMap kStep MZ SZ)
theorem controlledKernel_factor (kStep : β„•)
(previousAuxiliary : Tensor β„‚ AP BP CP) (stepAuxiliary : Tensor β„‚ AS BS CS)
(MX : X β†’ (Prefix Γ— PX) β†’ AP β†’ Polynomial β„‚)
(MY : Y β†’ (Prefix Γ— PY) β†’ BP β†’ Polynomial β„‚)
(MZ : Z β†’ (Prefix Γ— PZ) β†’ CP β†’ Polynomial β„‚)
(SX : Prefix β†’ X β†’ (New Γ— NX) β†’ AS β†’ Polynomial β„‚)
(SY : Prefix β†’ Y β†’ (New Γ— NY) β†’ BS β†’ Polynomial β„‚)
(SZ : Prefix β†’ Z β†’ (New Γ— NZ) β†’ CS β†’ Polynomial β„‚)
(x : X Γ— Output Prefix New PX NX) (y : Y Γ— Output Prefix New PY NY)
(z : Z Γ— Output Prefix New PZ NZ) :
controlledKernel kStep previousAuxiliary stepAuxiliary MX MY MZ SX SY SZ x y z =
Polynomial.expand β„‚ (kStep + 1)
(kernel previousAuxiliary MX MY MZ (x.1, x.2.1) (y.1, y.2.1) (z.1, z.2.1)) *
mixedStageKernel stepAuxiliary SX SY SZ x y z := by
have h := congrFun (congrFun (congrFun
(Tensor.restrict_product (expandMap (kStep + 1) MX x.1)
(expandMap (kStep + 1) MY y.1) (expandMap (kStep + 1) MZ z.1)
(SX x.2.1.1 x.1) (SY y.2.1.1 y.1) (SZ z.2.1.1 z.1)
(fun a b c => Polynomial.C (previousAuxiliary a b c))
(fun a b c => Polynomial.C (stepAuxiliary a b c))) x.2) y.2) z.2
have hproduct :
controlledKernel kStep previousAuxiliary stepAuxiliary MX MY MZ SX SY SZ x y z =
kernel previousAuxiliary (expandMap (kStep + 1) MX)
(expandMap (kStep + 1) MY) (expandMap (kStep + 1) MZ)
(x.1, x.2.1) (y.1, y.2.1) (z.1, z.2.1) *
mixedStageKernel stepAuxiliary SX SY SZ x y z := by
simpa only [controlledKernel, kernel, fiberTransform, Tensor.restrict, Tensor.product,
controlledMap, expandMap, mixedStageKernel, map_mul] using h
rw [hproduct, kernel_expandMap]
theorem controlledKernel_substitution (kStep : β„•)
(previousAuxiliary : Tensor β„‚ AP BP CP) (stepAuxiliary : Tensor β„‚ AS BS CS)
(MX : X β†’ (Prefix Γ— PX) β†’ AP β†’ Polynomial β„‚)
(MY : Y β†’ (Prefix Γ— PY) β†’ BP β†’ Polynomial β„‚)
(MZ : Z β†’ (Prefix Γ— PZ) β†’ CP β†’ Polynomial β„‚)
(SX : Prefix β†’ X β†’ (New Γ— NX) β†’ AS β†’ Polynomial β„‚)
(SY : Prefix β†’ Y β†’ (New Γ— NY) β†’ BS β†’ Polynomial β„‚)
(SZ : Prefix β†’ Z β†’ (New Γ— NZ) β†’ CS β†’ Polynomial β„‚)
(original : Tensor β„‚ X Y Z) :
fiberTransform (controlledMap kStep MX SX) (controlledMap kStep MY SY)
(controlledMap kStep MZ SZ)
(fun x y z => Polynomial.C
(Tensor.product original (Tensor.product previousAuxiliary stepAuxiliary) x y z)) =
originalScale (fun x y z => Polynomial.C (original x y z))
(controlledKernel kStep previousAuxiliary stepAuxiliary MX MY MZ SX SY SZ) := by
have h := fiberTransform_originalScale (controlledMap kStep MX SX)
(controlledMap kStep MY SY) (controlledMap kStep MZ SZ)
(fun x y z => Polynomial.C (original x y z))
(fun x y z => Polynomial.C (Tensor.product previousAuxiliary stepAuxiliary x.2 y.2 z.2))
have hinput :
(fun x y z => Polynomial.C
(Tensor.product original (Tensor.product previousAuxiliary stepAuxiliary) x y z)) =
originalScale (fun x y z => Polynomial.C (original x y z))
(fun x y z => Polynomial.C
(Tensor.product previousAuxiliary stepAuxiliary x.2 y.2 z.2)) := by
funext x y z
simp only [Tensor.product, originalScale, map_mul]
rw [hinput]
simpa only [controlledKernel, kernel] using h
def controlledLeading
(previous : Tensor β„‚ (X Γ— (Prefix Γ— PX)) (Y Γ— (Prefix Γ— PY)) (Z Γ— (Prefix Γ— PZ)))
(step : Prefix β†’ Tensor β„‚ (X Γ— (New Γ— NX)) (Y Γ— (New Γ— NY)) (Z Γ— (New Γ— NZ))) :
Tensor β„‚ (X Γ— Output Prefix New PX NX) (Y Γ— Output Prefix New PY NY)
(Z Γ— Output Prefix New PZ NZ) :=
fun x y z => previous (x.1, x.2.1) (y.1, y.2.1) (z.1, z.2.1) *
step x.2.1.1 (x.1, x.2.2) (y.1, y.2.2) (z.1, z.2.2)
theorem controlledKernel_coefficients (dPrevious kStep : β„•)
(previousAuxiliary : Tensor β„‚ AP BP CP) (stepAuxiliary : Tensor β„‚ AS BS CS)
(MX : X β†’ (Prefix Γ— PX) β†’ AP β†’ Polynomial β„‚)
(MY : Y β†’ (Prefix Γ— PY) β†’ BP β†’ Polynomial β„‚)
(MZ : Z β†’ (Prefix Γ— PZ) β†’ CP β†’ Polynomial β„‚)
(SX : Prefix β†’ X β†’ (New Γ— NX) β†’ AS β†’ Polynomial β„‚)
(SY : Prefix β†’ Y β†’ (New Γ— NY) β†’ BS β†’ Polynomial β„‚)
(SZ : Prefix β†’ Z β†’ (New Γ— NZ) β†’ CS β†’ Polynomial β„‚)
(previous : Tensor β„‚ (X Γ— (Prefix Γ— PX)) (Y Γ— (Prefix Γ— PY)) (Z Γ— (Prefix Γ— PZ)))
(step : Prefix β†’ Tensor β„‚ (X Γ— (New Γ— NX)) (Y Γ— (New Γ— NY)) (Z Γ— (New Γ— NZ)))
(support : X β†’ Y β†’ Z β†’ Prop) (eligible : Prefix β†’ X β†’ Y β†’ Z β†’ Prop)
(hprevious_low : βˆ€ x y z, support x.1 y.1 z.1 β†’ βˆ€ j, j < dPrevious β†’
(kernel previousAuxiliary MX MY MZ x y z).coeff j = 0)
(hprevious_leading : βˆ€ x y z, support x.1 y.1 z.1 β†’
(kernel previousAuxiliary MX MY MZ x y z).coeff dPrevious = previous x y z)
(hprevious_support : βˆ€ x y z, support x.1 y.1 z.1 β†’ previous x y z β‰  0 β†’
x.2.1 = y.2.1 ∧ x.2.1 = z.2.1 ∧ eligible x.2.1 x.1 y.1 z.1)
(hstep_low : βˆ€ prior x y z, eligible prior x.1 y.1 z.1 β†’
βˆ€ j, j < kStep β†’
(kernel stepAuxiliary (SX prior) (SY prior) (SZ prior) x y z).coeff j = 0)
(hstep_leading : βˆ€ prior x y z, eligible prior x.1 y.1 z.1 β†’
(kernel stepAuxiliary (SX prior) (SY prior) (SZ prior) x y z).coeff kStep =
step prior x y z) :
(βˆ€ x y z, support x.1 y.1 z.1 β†’ βˆ€ j, j < dPrevious * (kStep + 1) + kStep β†’
(controlledKernel kStep previousAuxiliary stepAuxiliary MX MY MZ SX SY SZ x y z).coeff j = 0) ∧
(βˆ€ x y z, support x.1 y.1 z.1 β†’
(controlledKernel kStep previousAuxiliary stepAuxiliary MX MY MZ SX SY SZ x y z).coeff
(dPrevious * (kStep + 1) + kStep) = controlledLeading previous step x y z) := by
have hselected : βˆ€ (x : X Γ— Output Prefix New PX NX)
(y : Y Γ— Output Prefix New PY NY) (z : Z Γ— Output Prefix New PZ NZ),
support x.1 y.1 z.1 β†’
previous (x.1, x.2.1) (y.1, y.2.1) (z.1, z.2.1) β‰  0 β†’
(βˆ€ j, j < kStep β†’ (mixedStageKernel stepAuxiliary SX SY SZ x y z).coeff j = 0) ∧
(mixedStageKernel stepAuxiliary SX SY SZ x y z).coeff kStep =
step x.2.1.1 (x.1, x.2.2) (y.1, y.2.2) (z.1, z.2.2) := by
intro x y z hs hn
obtain ⟨hxy, hxz, he⟩ :=
hprevious_support (x.1, x.2.1) (y.1, y.2.1) (z.1, z.2.1) hs hn
have hy : y.2.1.1 = x.2.1.1 := hxy.symm
have hz : z.2.1.1 = x.2.1.1 := hxz.symm
constructor
Β· intro j hj
simpa only [mixedStageKernel, hy, hz] using
hstep_low x.2.1.1 (x.1, x.2.2) (y.1, y.2.2) (z.1, z.2.2) he j hj
Β· simpa only [mixedStageKernel, hy, hz] using
hstep_leading x.2.1.1 (x.1, x.2.2) (y.1, y.2.2) (z.1, z.2.2) he
constructor
Β· intro x y z hs j hj
rw [controlledKernel_factor]
exact expanded_mul_vanishes_of_leading_support _ _ dPrevious kStep
(previous (x.1, x.2.1) (y.1, y.2.1) (z.1, z.2.1))
(hprevious_low _ _ _ hs) (hprevious_leading _ _ _ hs)
(fun hn => (hselected x y z hs hn).1) j hj
Β· intro x y z hs
rw [controlledKernel_factor]
exact expanded_mul_leading_of_leading_support _ _ dPrevious kStep
(previous (x.1, x.2.1) (y.1, y.2.1) (z.1, z.2.1))
(step x.2.1.1 (x.1, x.2.2) (y.1, y.2.2) (z.1, z.2.2))
(hprevious_low _ _ _ hs) (hprevious_leading _ _ _ hs)
(fun hn => (hselected x y z hs hn).2)
theorem controlledKernel_rank [Fintype X] [Fintype Y] [Fintype Z]
(kStep : β„•) (previousAuxiliary : Tensor β„‚ AP BP CP) (stepAuxiliary : Tensor β„‚ AS BS CS)
(MX : X β†’ (Prefix Γ— PX) β†’ AP β†’ Polynomial β„‚)
(MY : Y β†’ (Prefix Γ— PY) β†’ BP β†’ Polynomial β„‚)
(MZ : Z β†’ (Prefix Γ— PZ) β†’ CP β†’ Polynomial β„‚)
(SX : Prefix β†’ X β†’ (New Γ— NX) β†’ AS β†’ Polynomial β„‚)
(SY : Prefix β†’ Y β†’ (New Γ— NY) β†’ BS β†’ Polynomial β„‚)
(SZ : Prefix β†’ Z β†’ (New Γ— NZ) β†’ CS β†’ Polynomial β„‚)
{rPrevious rStep : β„•} (hp : RankAtMost previousAuxiliary rPrevious)
(hs : RankAtMost stepAuxiliary rStep) :
RankAtMost (controlledKernel kStep previousAuxiliary stepAuxiliary MX MY MZ SX SY SZ)
(rPrevious * rStep) := by
classical
have hsource := ((hp.product hs).map Polynomial.C).pullback
(fun x : X Γ— (AP Γ— AS) => x.2) (fun y : Y Γ— (BP Γ— BS) => y.2)
(fun z : Z Γ— (CP Γ— CS) => z.2)
unfold controlledKernel kernel
rw [fiberTransform_eq_restrict]
exact hsource.restrict _ _ _
end ActualMatrices
end PolynomialControlledKernel
end MatrixMultiplication.Foundation
end
end OAI