Download data/lean/OAI/Combinatorics/ExpectationThreshold/TupleGeometric.lean from introvoyz045/math: direct link, hf CLI and curl.
- Browser
- Download file 5.25 kB
-
https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/Combinatorics/ExpectationThreshold/TupleGeometric.lean
- Command line
-
hf download hf://datasets/introvoyz045/math/data/lean/OAI/Combinatorics/ExpectationThreshold/TupleGeometric.lean
-
curl -L -o TupleGeometric.lean https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/Combinatorics/ExpectationThreshold/TupleGeometric.lean
5.25 kB
| import OAI.Combinatorics.ExpectationThreshold.TupleCoefficients | |
| import Mathlib.Data.Fintype.Pi | |
| import Mathlib.Data.Finset.Lattice.Fold | |
| import Mathlib.Algebra.BigOperators.Ring.Finset | |
| import Mathlib.Algebra.Order.BigOperators.GroupWithZero.Finset | |
| import Mathlib.Tactic.Linarith | |
| import Mathlib.Tactic.NormNum | |
| namespace OAI | |
| /-! | |
| # A finite geometric bound for nonzero tuples | |
| Every finite family of tuples lies in a finite coordinate box. Factoring | |
| the sum over this box reduces the estimate to ordinary finite geometric | |
| sums. Adding the zero tuple contributes exactly one, so removing it gives | |
| the selector's budget of strictly less than `1 / 20`. | |
| -/ | |
| namespace TalagrandThreshold | |
| open scoped BigOperators | |
| private theorem finite_geom_sum_mul_one_sub (c : β) (n : β) : | |
| (β k β Finset.range n, c ^ k) * (1 - c) = 1 - c ^ n := by | |
| induction n with | |
| | zero => simp | |
| | succ n ih => | |
| rw [Finset.sum_range_succ, pow_succ] | |
| nlinarith [ih] | |
| private theorem finite_geom_sum_le_inverse {c : β} | |
| (hc0 : 0 β€ c) (hc1 : c < 1) (n : β) : | |
| (β k β Finset.range n, c ^ k) β€ (1 - c)β»ΒΉ := by | |
| rw [β one_div] | |
| apply (le_div_iffβ (sub_pos.mpr hc1)).mpr | |
| rw [finite_geom_sum_mul_one_sub] | |
| exact sub_le_self 1 (pow_nonneg hc0 n) | |
| /-- A finite tuple family is bounded by the product of geometric bounds. -/ | |
| theorem finite_tuple_sum_le_inverse_product {ΞΉ : Type*} [Fintype ΞΉ] | |
| (T : Finset (ΞΉ β β)) (c : ΞΉ β β) | |
| (hc0 : β i, 0 β€ c i) (hc1 : β i, c i < 1) : | |
| (β t β T, β i, (c i) ^ (t i)) β€ β i, (1 - c i)β»ΒΉ := by | |
| classical | |
| let m : ΞΉ β β := fun i => T.sup (fun t => t i) + 1 | |
| let B : Finset (ΞΉ β β) := Fintype.piFinset (fun i => Finset.range (m i)) | |
| have hTB : T β B := by | |
| intro t ht | |
| apply Fintype.mem_piFinset.mpr | |
| intro i | |
| apply Finset.mem_range.mpr | |
| exact Nat.lt_succ_of_le (Finset.le_sup (f := fun u => u i) ht) | |
| calc | |
| (β t β T, β i, (c i) ^ (t i)) β€ | |
| β t β B, β i, (c i) ^ (t i) := | |
| Finset.sum_le_sum_of_subset_of_nonneg hTB | |
| (fun t _ _ => Finset.prod_nonneg fun i _ => pow_nonneg (hc0 i) (t i)) | |
| _ = β i, β k β Finset.range (m i), (c i) ^ k := | |
| (Finset.prod_univ_sum (fun i => Finset.range (m i)) | |
| (fun i k => (c i) ^ k)).symm | |
| _ β€ β i, (1 - c i)β»ΒΉ := by | |
| apply Finset.prod_le_prodβ | |
| Β· intro i _ | |
| exact Finset.sum_nonneg fun k _ => pow_nonneg (hc0 i) k | |
| Β· intro i _ | |
| exact finite_geom_sum_le_inverse (hc0 i) (hc1 i) (m i) | |
| /-- The sum of coefficients controls every finite tuple family. -/ | |
| theorem finite_tuple_sum_le_inverse_one_sub_sum {ΞΉ : Type*} [Fintype ΞΉ] | |
| (T : Finset (ΞΉ β β)) (c : ΞΉ β β) | |
| (hc0 : β i, 0 β€ c i) (hc1 : β i, c i < 1) | |
| (hsum : (β i, c i) < 1) : | |
| (β t β T, β i, (c i) ^ (t i)) β€ (1 - β i, c i)β»ΒΉ := by | |
| calc | |
| (β t β T, β i, (c i) ^ (t i)) β€ β i, (1 - c i)β»ΒΉ := | |
| finite_tuple_sum_le_inverse_product T c hc0 hc1 | |
| _ = (β i, (1 - c i))β»ΒΉ := Finset.prod_inv_distrib _ | |
| _ β€ (1 - β i, c i)β»ΒΉ := | |
| inv_antiβ (sub_pos.mpr hsum) | |
| (one_sub_sum_le_prod_one_sub c hc0 (fun i => (hc1 i).le)) | |
| /-- The actual selector coefficients give a strict budget for every finite | |
| family of nonzero tuples, without an infinite-series argument. -/ | |
| theorem tuple_geometric_sum_lt_one_twentieth {s : β} | |
| (T : Finset (Fin s β β)) (hT : β t β T, t β 0) : | |
| (β t β T, β i : Fin s, ((3 : β) / 64 ^ (i.val + 1)) ^ (t i)) < 1 / 20 := by | |
| classical | |
| let c : Fin s β β := fun i => tupleCoefficient i.val | |
| have hc0 : β i, 0 β€ c i := fun i => tupleCoefficient_nonneg i.val | |
| have hc1 : β i, c i < 1 := fun i => tupleCoefficient_lt_one i.val | |
| have hrho : (β i, c i) < (1 / 21 : β) := sum_tupleCoefficient_lt s | |
| have hsum : (β i, c i) < 1 := hrho.trans (by norm_num) | |
| have hz : (0 : Fin s β β) β T := fun hz => hT 0 hz rfl | |
| have hall := finite_tuple_sum_le_inverse_one_sub_sum (insert 0 T) c hc0 hc1 hsum | |
| have htotal : 1 + (β t β T, β i, (c i) ^ (t i)) β€ (1 - β i, c i)β»ΒΉ := by | |
| simpa only [Finset.sum_insert hz, Pi.zero_apply, pow_zero, Finset.prod_const_one] | |
| using hall | |
| have hden : (20 / 21 : β) < 1 - β i, c i := by linarith | |
| have hinv : (1 - β i, c i)β»ΒΉ < (21 / 20 : β) := by | |
| have h := (inv_lt_invβ (sub_pos.mpr hsum) | |
| (by norm_num : (0 : β) < 20 / 21)).mpr hden | |
| norm_num at h | |
| exact h | |
| change (β t β T, β i, (c i) ^ (t i)) < 1 / 20 | |
| linarith | |
| theorem tuple_geometric_sum_le_one_twentieth {s : β} | |
| (T : Finset (Fin s β β)) (hT : β t β T, t β 0) : | |
| (β t β T, β i : Fin s, ((3 : β) / 64 ^ (i.val + 1)) ^ (t i)) β€ 1 / 20 := | |
| (tuple_geometric_sum_lt_one_twentieth T hT).le | |
| /-- A positive total degree is the form supplied by a nonempty changed set. -/ | |
| theorem tuple_geometric_sum_lt_one_twentieth_of_pos_total {s : β} | |
| (T : Finset (Fin s β β)) (hT : β t β T, 0 < β i, t i) : | |
| (β t β T, β i : Fin s, ((3 : β) / 64 ^ (i.val + 1)) ^ (t i)) < 1 / 20 := by | |
| apply tuple_geometric_sum_lt_one_twentieth T | |
| intro t ht hz | |
| have hpos := hT t ht | |
| simp [hz] at hpos | |
| end TalagrandThreshold | |
| end OAI | |