math / data /lean /OAI /Computability /PerfectCompleteness /Algebra /FunctionSpaceLowerRank.lean
introvoyz045's picture
Migrated from GitHub
4a56cd6 verified
Raw History Blame Contribute Delete
6.17 kB
import OAI.Computability.PerfectCompleteness.Algebra.EvaluationMatrix
import OAI.Computability.PerfectCompleteness.Algebra.LowerAffineSliceRank
import OAI.Computability.PerfectCompleteness.Algebra.ProductEvaluationRank
import OAI.Computability.PerfectCompleteness.Foundations.OddListExtraction
namespace OAI
namespace PerfectCompleteness.FunctionSpaceLowerRank
noncomputable section
open scoped BigOperators Classical
open UniqueGamesTheorem.Integration.BinaryLinear (F2)
open UniqueGamesTheorem.Fourier.MatrixLevelBridge
open UniqueGamesTheorem.Appendix.RankLevelFilter
open PointwiseSpaces
section Transport
variable {K H V : Type*} [Field K]
[AddCommGroup H] [Module K H] [AddCommGroup V] [Module K V]
def transportForm (e : H ≃ₗ[K] V) (F : H β†’β‚—[K] Module.Dual K H) :
V β†’β‚—[K] Module.Dual K V :=
e.symm.toLinearMap.dualMap.comp (F.comp e.symm.toLinearMap)
@[simp] theorem transportForm_apply (e : H ≃ₗ[K] V)
(F : H β†’β‚—[K] Module.Dual K H) (u v : V) :
transportForm e F u v = F (e.symm u) (e.symm v) := rfl
theorem transportForm_rank (e : H ≃ₗ[K] V) (F : H β†’β‚—[K] Module.Dual K H) :
Module.finrank K (LinearMap.range (transportForm e F)) =
Module.finrank K (LinearMap.range F) := by
unfold transportForm
rw [LinearMap.range_comp,
LinearMap.range_comp_of_range_eq_top F e.symm.range]
exact e.symm.dualMap.finrank_map_eq (LinearMap.range F)
end Transport
section FunctionSpace
variable {Ξ© : Type*} (H : Submodule F2 (Ξ© β†’ F2)) [FiniteDimensional F2 H]
{β„“ m : Nat}
def matrixForm (F : H β†’β‚—[F2] Module.Dual F2 H) :
Module.Dual F2 (Module.Dual F2 H) β†’β‚—[F2]
Module.Dual F2 (Module.Dual F2 (Module.Dual F2 H)) :=
transportForm (Module.evalEquiv F2 H) F
@[simp] theorem matrixForm_rank (F : H β†’β‚—[F2] Module.Dual F2 H) :
Module.finrank F2 (LinearMap.range (matrixForm H F)) =
Module.finrank F2 (LinearMap.range F) :=
transportForm_rank (Module.evalEquiv F2 H) F
theorem testedGram_matrixForm (F : H β†’β‚—[F2] Module.Dual F2 H)
(X : Module.Dual F2 H β†’β‚—[F2] (Fin β„“ β†’ F2)) :
LowerAffineSliceRank.testedGram (matrixForm H F) X =
(fun i j => F (EvaluationMatrix.rows H X i) (EvaluationMatrix.rows H X j)) := rfl
theorem testedGram_multiplicationForm (z : Module.Dual F2 (squareSpace H))
(X : Module.Dual F2 H β†’β‚—[F2] (Fin β„“ β†’ F2)) :
LowerAffineSliceRank.testedGram
(matrixForm H (OddListExtraction.multiplicationForm H z)) X =
(fun i j => z (OddListExtraction.productElement H
(EvaluationMatrix.rows H X i) (EvaluationMatrix.rows H X j))) := rfl
end FunctionSpace
open MixedSupport CanonicalKeys
open ProductEvaluation (productSpan displayedJoint labelFunctional)
variable {n β„“ m : Nat} {Z Y : Type*} [Fintype Y]
(slots : Fin n β†’ Slot) (H : Submodule F2 (Assignment slots β†’ F2))
[FiniteDimensional F2 H]
(other : Assignment slots β†’ Z)
(hone : (1 : Assignment slots β†’ F2) ∈ squareSpace H)
def displayedRows (X : Module.Dual F2 H β†’β‚—[F2] (Fin β„“ β†’ F2))
(_ : Unit) (i : Fin β„“) : Assignment slots β†’ F2 :=
(EvaluationMatrix.rows H X i).val
theorem displayedRows_products
(X : Module.Dual F2 H β†’β‚—[F2] (Fin β„“ β†’ F2))
(c : Unit) (i j : Fin β„“) :
displayedRows slots H X c i * displayedRows slots H X c j ∈ squareSpace H :=
mul_mem_squareSpace H (EvaluationMatrix.rows H X i).property
(EvaluationMatrix.rows H X j).property
def testedProductSpan (X : Module.Dual F2 H β†’β‚—[F2] (Fin β„“ β†’ F2)) :
Submodule F2 (squareSpace H) :=
productSpan (squareSpace H) (displayedRows slots H X) hone
(displayedRows_products slots H X)
def IsLegalExtension (X : Module.Dual F2 H β†’β‚—[F2] (Fin β„“ β†’ F2))
(z : Module.Dual F2 (squareSpace H)) : Prop :=
βˆƒ P : Label slots (displayedJoint (displayedRows slots H X) other),
z.comp (testedProductSpan slots H hone X).subtype =
labelFunctional slots (squareSpace H) (displayedRows slots H X) other hone
(displayedRows_products slots H X) P
theorem legal_extension_tested_rank_le_one
(X : Module.Dual F2 H β†’β‚—[F2] (Fin β„“ β†’ F2))
(z : Module.Dual F2 (squareSpace H))
(hz : IsLegalExtension slots H other hone X z) :
(LowerAffineSliceRank.testedGram
(matrixForm H (OddListExtraction.multiplicationForm H z)) X).rank ≀ 1 := by
obtain ⟨P, hP⟩ := hz
rw [testedGram_multiplicationForm]
exact ProductEvaluationRank.extension_productMatrix_rank_le_one slots
(squareSpace H) (displayedRows slots H X) other hone
(displayedRows_products slots H X) P z hP ()
variable [Fintype (Module.Dual F2 H)]
[Fintype (Module.Dual F2 (Module.Dual F2 H))]
[Fintype (Module.Dual F2 H β†’β‚—[F2] (Fin β„“ β†’ F2))]
[Fintype ((Fin β„“ β†’ F2) β†’β‚—[F2] Module.Dual F2 H)]
theorem high_rank_agreement_lt_of_legal_extensions
(f : (Module.Dual F2 H β†’β‚—[F2] (Fin β„“ β†’ F2)) β†’ Option Y)
(output : Y β†’ Module.Dual F2 (squareSpace H))
(legal : βˆ€ X y, f X = some y β†’ IsLegalExtension slots H other hone X (output y))
(r s : Nat) (ρ Ξ· : ℝ) (hm : 0 < m)
(hρ : 0 < ρ) (hρ1 : ρ < 1)
(hconstants : levelCutoffConstant r ρ + node (r + 1) < η)
(hrows : 2 * m + r ≀ β„“)
(herror : (2 : ℝ) ^ m / (2 : ℝ) ^ (s - 2 * r) +
(2 : ℝ) ^ (2 * m) / (2 : ℝ) ^ (m * m) ≀ ρ) :
PartialTableInverse.nonzeroAgreement
(MatrixErasure.erase f (fun X => βˆƒ y, f X = some y ∧
OddListExtraction.formRank H (OddListExtraction.multiplicationForm H (output y)) ≀ s)) < Ξ· := by
have tested : βˆ€ X y, f X = some y β†’
(LowerAffineSliceRank.testedGram
(matrixForm H (OddListExtraction.multiplicationForm H (output y))) X).rank ≀ 1 := by
intro X y h
exact legal_extension_tested_rank_le_one slots H other hone X (output y) (legal X y h)
have h := LowerAffineSliceRank.high_rank_agreement_lt f
(fun y => matrixForm H (OddListExtraction.multiplicationForm H (output y)))
tested r s ρ η hm hρ hρ1 hconstants hrows herror
simpa only [matrixForm_rank, OddListExtraction.formRank] using h
end
end PerfectCompleteness.FunctionSpaceLowerRank
end OAI