Download data/lean/OAI/Computability/PerfectCompleteness/Algebra/MatrixInverse.lean from introvoyz045/math: direct link, hf CLI and curl.
- Browser
- Download file 5.24 kB
-
https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/Computability/PerfectCompleteness/Algebra/MatrixInverse.lean
- Command line
-
hf download hf://datasets/introvoyz045/math/data/lean/OAI/Computability/PerfectCompleteness/Algebra/MatrixInverse.lean
-
curl -L -o MatrixInverse.lean https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/Computability/PerfectCompleteness/Algebra/MatrixInverse.lean
5.24 kB
| import OAI.Computability.PerfectCompleteness.Foundations.GlobalityLemmas | |
| namespace OAI | |
| section | |
| namespace PerfectCompleteness.MatrixInverse | |
| noncomputable section | |
| open scoped BigOperators Classical | |
| open UniqueGamesTheorem.Fourier.MatrixCharacters UniqueGamesTheorem.Fourier.MatrixFourier | |
| open UniqueGamesTheorem.Fourier.MatrixNoise UniqueGamesTheorem.Fourier.MatrixRestrictions | |
| open UniqueGamesTheorem.Fourier.MatrixLevelBridge | |
| open UniqueGamesTheorem.Appendix.LevelInequality UniqueGamesTheorem.Appendix.RankLevelFilter | |
| variable {E F : Type*} | |
| [AddCommGroup E] [Module F2 E] [AddCommGroup F] [Module F2 F] | |
| [FiniteDimensional F2 E] [FiniteDimensional F2 F] | |
| [Finite E] [Fintype F] [Fintype (E ββ[F2] F2)] | |
| [Fintype (E ββ[F2] F)] [Fintype (F ββ[F2] E)] | |
| def noiseEnergy (f : (E ββ[F2] F) β β) : β := | |
| πΌ X, f X * linearRealNoiseOperator (fun _ : F => (Fintype.card F : β)β»ΒΉ) f X | |
| omit [Finite E] in | |
| theorem noiseEnergy_eq (f : (E ββ[F2] F) β β) : | |
| noiseEnergy f = β S : F ββ[F2] E, node (frequencyRank S) * linearCoeff f S ^ 2 := by | |
| unfold noiseEnergy | |
| rw [linearRealNoiseOperator_energy] | |
| apply Finset.sum_congr rfl | |
| intro S _ | |
| rw [linearNoiseEigenvalue_uniform, node_eq_inv_pow] | |
| rfl | |
| omit [Finite E] in | |
| theorem noiseEnergy_le_cutoff (r : Nat) (f : (E ββ[F2] F) β β) : | |
| noiseEnergy f β€ rankCutoffEnergy r f + node (r + 1) * (πΌ X, f X ^ 2) := by | |
| rw [noiseEnergy_eq] | |
| calc | |
| _ β€ β S : F ββ[F2] E, | |
| ((if frequencyRank S β€ r then linearCoeff f S ^ 2 else 0) + | |
| node (r + 1) * linearCoeff f S ^ 2) := by | |
| apply Finset.sum_le_sum | |
| intro S _ | |
| by_cases h : frequencyRank S β€ r | |
| Β· rw [ite_eq_left h] | |
| have hβ := mul_le_mul_of_nonneg_right (node_le_one (frequencyRank S)) | |
| (sq_nonneg (linearCoeff f S)) | |
| have hβ := mul_nonneg (node_pos (r + 1)).le (sq_nonneg (linearCoeff f S)) | |
| linarith | |
| Β· rw [ite_eq_right h, zero_add] | |
| exact mul_le_mul_of_nonneg_right | |
| (node_antitone (Nat.succ_le_of_lt (Nat.lt_of_not_ge h))) (sq_nonneg _) | |
| _ = rankCutoffEnergy r f + node (r + 1) * (πΌ X, f X ^ 2) := by | |
| rw [Finset.sum_add_distrib, β Finset.mul_sum, linear_parseval] | |
| simp only [rankCutoffEnergy, Finset.sum_filter] | |
| theorem noiseEnergy_le_of_global (r : Nat) (Ο : β) (hΟ : 0 < Ο) (hΟ1 : Ο < 1) | |
| (f : (E ββ[F2] F) β β) (hf : IsBoolean f) | |
| (hg : IsRestrictionGlobal f r Ο) : | |
| noiseEnergy f β€ (levelCutoffConstant r Ο + node (r + 1)) * (πΌ X, f X ^ 2) := by | |
| have hcut := rankCutoffEnergy_le_of_theorem23 | |
| (UniqueGamesTheorem.Appendix.LevelTheorem.theorem23 (E := E) (F := F)) f r Ο hΟ hΟ1 hf hg | |
| calc | |
| noiseEnergy f β€ rankCutoffEnergy r f + node (r + 1) * (πΌ X, f X ^ 2) := | |
| noiseEnergy_le_cutoff r f | |
| _ β€ levelCutoffConstant r Ο * (πΌ X, f X ^ 2) + | |
| node (r + 1) * (πΌ X, f X ^ 2) := add_le_add hcut (le_refl _) | |
| _ = _ := (add_mul _ _ _).symm | |
| theorem exists_dense_restriction (r : Nat) (Ο Ξ· : β) (hΟ : 0 < Ο) (hΟ1 : Ο < 1) | |
| (hconstants : levelCutoffConstant r Ο + node (r + 1) < Ξ·) | |
| (f : (E ββ[F2] F) β β) (hf : IsBoolean f) | |
| (hpositive : 0 < πΌ X, f X ^ 2) | |
| (hretention : Ξ· * (πΌ X, f X ^ 2) β€ noiseEnergy f) : | |
| β (W : Submodule F2 E) (C' : Submodule F2 F) (T : E ββ[F2] F), | |
| order W C' β€ r β§ Ο < (πΌ N, restrict f W C' T N) := by | |
| by_contra hnone | |
| have hg : IsRestrictionGlobal f r Ο := by | |
| apply (boolean_global_iff_density f hf r Ο).mpr | |
| intro W C' T horder | |
| apply le_of_not_gt | |
| intro hdense | |
| exact hnone β¨W, C', T, horder, hdenseβ© | |
| have hbound := noiseEnergy_le_of_global r Ο hΟ hΟ1 f hf hg | |
| have hstrict := mul_lt_mul_of_pos_right hconstants hpositive | |
| exact (not_lt_of_ge (hretention.trans hbound)) hstrict | |
| theorem exists_dense_restriction_of_family {Y : Type*} [Fintype Y] | |
| (r : Nat) (Ο Ξ· : β) (hΟ : 0 < Ο) (hΟ1 : Ο < 1) | |
| (hconstants : levelCutoffConstant r Ο + node (r + 1) < Ξ·) | |
| (f : Y β (E ββ[F2] F) β β) (hf : β y, IsBoolean (f y)) | |
| (hmass : (β y, πΌ X, f y X ^ 2) β€ 1) | |
| (hretention : Ξ· β€ β y, noiseEnergy (f y)) : | |
| β (y : Y) (W : Submodule F2 E) (C' : Submodule F2 F) (T : E ββ[F2] F), | |
| order W C' β€ r β§ Ο < (πΌ N, restrict (f y) W C' T N) := by | |
| by_contra hnone | |
| have hg (y : Y) : IsRestrictionGlobal (f y) r Ο := by | |
| apply (boolean_global_iff_density (f y) (hf y) r Ο).mpr | |
| intro W C' T horder | |
| apply le_of_not_gt | |
| intro hdense | |
| exact hnone β¨y, W, C', T, horder, hdenseβ© | |
| have hbound : (β y, noiseEnergy (f y)) β€ | |
| (levelCutoffConstant r Ο + node (r + 1)) * (β y, πΌ X, f y X ^ 2) := by | |
| rw [Finset.mul_sum] | |
| exact Finset.sum_le_sum fun y _ => noiseEnergy_le_of_global r Ο hΟ hΟ1 (f y) (hf y) (hg y) | |
| have hnonneg : 0 β€ levelCutoffConstant r Ο + node (r + 1) := | |
| add_nonneg (levelCutoffConstant_nonneg r Ο hΟ.le) (node_pos _).le | |
| have hbound' := hbound.trans (mul_le_mul_of_nonneg_left hmass hnonneg) | |
| simp only [mul_one] at hbound' | |
| exact (not_lt_of_ge (hretention.trans hbound')) hconstants | |
| end | |
| end PerfectCompleteness.MatrixInverse | |
| end | |
| end OAI | |