Download data/lean/OAI/Geometry/HeilbronnTriangle/DigitBadTripleAverage.lean from introvoyz045/math: direct link, hf CLI and curl.
- Browser
- Download file 9.9 kB
-
https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/Geometry/HeilbronnTriangle/DigitBadTripleAverage.lean
- Command line
-
hf download hf://datasets/introvoyz045/math/data/lean/OAI/Geometry/HeilbronnTriangle/DigitBadTripleAverage.lean
-
curl -L -o DigitBadTripleAverage.lean https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/Geometry/HeilbronnTriangle/DigitBadTripleAverage.lean
9.9 kB
| import OAI.Geometry.HeilbronnTriangle.DigitColumnLaw | |
| import OAI.Geometry.HeilbronnTriangle.BadTripleAverage | |
| import OAI.Geometry.HeilbronnTriangle.FiniteFieldLabels | |
| namespace OAI | |
| noncomputable section | |
| namespace Problem355.DigitBadTripleAverage | |
| open scoped BigOperators | |
| open DigitColumnLaw | |
| def labelTripleEquiv (Ξ : Type*) : (Fin 3 β Ξ) β Ξ Γ Ξ Γ Ξ where | |
| toFun l := (l 0, l 1, l 2) | |
| invFun t := ![t.1, t.2.1, t.2.2] | |
| left_inv l := by funext i; fin_cases i <;> rfl | |
| right_inv t := rfl | |
| theorem uniform_label_average {Ξ : Type*} [Fintype Ξ] | |
| (F : (Fin 3 β Ξ) β β) : | |
| (β l : Fin 3 β Ξ, uniformWeight (Fin 3 β Ξ) l * F l) = | |
| (β a : Ξ, β b : Ξ, β c : Ξ, F ![a, b, c]) / | |
| (Fintype.card Ξ : β) ^ 3 := by | |
| classical | |
| calc | |
| _ = β t : Ξ Γ Ξ Γ Ξ, | |
| F ![t.1, t.2.1, t.2.2] / (Fintype.card Ξ : β) ^ 3 := by | |
| apply Fintype.sum_equiv (labelTripleEquiv Ξ) | |
| intro l | |
| change uniformWeight (Fin 3 β Ξ) l * F l = | |
| F ![l 0, l 1, l 2] / (Fintype.card Ξ : β) ^ 3 | |
| have hl : (![l 0, l 1, l 2] : Fin 3 β Ξ) = l := by | |
| funext i; fin_cases i <;> rfl | |
| simp [uniformWeight, hl, div_eq_mul_inv, mul_comm] | |
| _ = _ := by simp only [Fintype.sum_prod_type, Finset.sum_div] | |
| lemma injective_labels {Ξ : Type*} {a b c : Ξ} | |
| (hab : a β b) (hac : a β c) (hbc : b β c) : | |
| Function.Injective (![a, b, c] : Fin 3 β Ξ) := by | |
| intro i j hij | |
| fin_cases i <;> fin_cases j <;> simp_all | |
| theorem expectation_le_six {Ξ X : Type*} | |
| [Fintype Ξ] [Nonempty Ξ] [Fintype X] {k : β} | |
| (D probability : (Fin 3 β Ξ) β Array X k β β) | |
| (A : β) (hA : 0 β€ A) | |
| (hmoment : β labels, | |
| (β f : Array X k, uniformWeight (Array X k) f * D labels f) β€ 2) | |
| (hzero : β labels f, Function.Injective labels β probability labels f = 0) | |
| (hbad : β labels f, Β¬ Function.Injective labels β | |
| probability labels f β€ A * D labels f) : | |
| (β s : Fin 3 β Latent Ξ X k, | |
| ConditionalSamples.productWeight (uniformWeight (Latent Ξ X k)) s * | |
| probability (tripleEquiv s).1 (tripleEquiv s).2) β€ | |
| 6 * A / (Fintype.card Ξ : β) := by | |
| classical | |
| rw [expectation_triple, uniform_label_average] | |
| apply Sampling.bad_triple_average_le_six | |
| (fun _ _ _ f => uniformWeight (Array X k) f) | |
| (fun a b c f => D ![a, b, c] f) | |
| (fun a b c f => probability ![a, b, c] f) A hA | |
| Β· intro a b c f | |
| exact uniformWeight_nonneg _ f | |
| Β· intro a b c | |
| exact hmoment ![a, b, c] | |
| Β· intro a b c f hab hac hbc | |
| exact hzero _ f (injective_labels hab hac hbc) | |
| Β· intro a b c f hrep | |
| apply hbad | |
| intro hinj | |
| rcases hrep with hab | hac | hbc | |
| Β· have h := hinj (show (![a, b, c] : Fin 3 β Ξ) 0 = ![a, b, c] 1 from hab) | |
| exact (by decide : (0 : Fin 3) β 1) h | |
| Β· have h := hinj (show (![a, b, c] : Fin 3 β Ξ) 0 = ![a, b, c] 2 from hac) | |
| exact (by decide : (0 : Fin 3) β 2) h | |
| Β· have h := hinj (show (![a, b, c] : Fin 3 β Ξ) 1 = ![a, b, c] 2 from hbc) | |
| exact (by decide : (1 : Fin 3) β 2) h | |
| theorem latent_expectation_le_six {Ξ X : Type*} | |
| [Fintype Ξ] [Nonempty Ξ] [Fintype X] {k : β} | |
| (D probability : (Fin 3 β Latent Ξ X k) β β) | |
| (A : β) (hA : 0 β€ A) | |
| (hmoment : β labels, | |
| (β f : Array X k, uniformWeight (Array X k) f * | |
| D (tripleEquiv.symm (labels, f))) β€ 2) | |
| (hzero : β s, Function.Injective (fun i => (s i).1) β probability s = 0) | |
| (hbad : β s, Β¬ Function.Injective (fun i => (s i).1) β | |
| probability s β€ A * D s) : | |
| (β s : Fin 3 β Latent Ξ X k, | |
| ConditionalSamples.productWeight (uniformWeight (Latent Ξ X k)) s * | |
| probability s) β€ 6 * A / (Fintype.card Ξ : β) := by | |
| have h := expectation_le_six | |
| (fun labels f => D (tripleEquiv.symm (labels, f))) | |
| (fun labels f => probability (tripleEquiv.symm (labels, f))) A hA hmoment | |
| (fun labels f hi => hzero _ hi) (fun labels f hi => hbad _ hi) | |
| simpa only [Prod.mk.eta, Equiv.symm_apply_apply] using h | |
| theorem expectation_le_six_prime_labels {r : β} [Fact r.Prime] | |
| [Fintype (FiniteFieldLabels.Label r)] {X : Type*} [Fintype X] {k : β} | |
| (D probability : (Fin 3 β FiniteFieldLabels.Label r) β Array X k β β) | |
| (A : β) (hA : 0 β€ A) | |
| (hmoment : β labels, | |
| (β f : Array X k, uniformWeight (Array X k) f * D labels f) β€ 2) | |
| (hzero : β labels f, Function.Injective labels β probability labels f = 0) | |
| (hbad : β labels f, Β¬ Function.Injective labels β | |
| probability labels f β€ A * D labels f) : | |
| (β s : Fin 3 β Latent (FiniteFieldLabels.Label r) X k, | |
| ConditionalSamples.productWeight | |
| (uniformWeight (Latent (FiniteFieldLabels.Label r) X k)) s * | |
| probability (tripleEquiv s).1 (tripleEquiv s).2) β€ | |
| 6 * A / (r : β) ^ 41 := by | |
| have hc : Fintype.card (FiniteFieldLabels.Label r) = r ^ 41 := by | |
| rw [β Nat.card_eq_fintype_card, FiniteFieldLabels.card_label] | |
| rfl | |
| simpa only [hc, Nat.cast_pow] using | |
| expectation_le_six D probability A hA hmoment hzero hbad | |
| theorem expectation_le_of_lifting_bound {r : β} [Fact r.Prime] | |
| [Fintype (FiniteFieldLabels.Label r)] {X : Type*} [Fintype X] {k : β} | |
| (D probability : (Fin 3 β FiniteFieldLabels.Label r) β Array X k β β) | |
| (C R h N : β) (hC : 0 β€ C) (hh : 0 β€ h) (hN : 0 < N) | |
| (hmoment : β labels, | |
| (β f : Array X k, uniformWeight (Array X k) f * D labels f) β€ 2) | |
| (hzero : β labels f, Function.Injective labels β probability labels f = 0) | |
| (hbad : β labels f, Β¬ Function.Injective labels β | |
| probability labels f β€ (64 / 21 : β) * C * R ^ 2 * h * D labels f / N ^ 3) : | |
| (β s : Fin 3 β Latent (FiniteFieldLabels.Label r) X k, | |
| ConditionalSamples.productWeight | |
| (uniformWeight (Latent (FiniteFieldLabels.Label r) X k)) s * | |
| probability (tripleEquiv s).1 (tripleEquiv s).2) β€ | |
| (128 / 7 : β) * C * R ^ 2 * h / (N ^ 3 * (r : β) ^ 41) := by | |
| have hbound := expectation_le_six_prime_labels D probability | |
| ((64 / 21 : β) * C * R ^ 2 * h / N ^ 3) (by positivity) | |
| hmoment hzero (by | |
| intro labels f hi | |
| convert hbad labels f hi using 1; ring) | |
| convert hbound using 1; ring | |
| end Problem355.DigitBadTripleAverage | |
| namespace Problem355.DigitColumnLaw | |
| open scoped BigOperators | |
| def labelsEquiv (Ξ : Type*) : (Fin 3 β Ξ) β Ξ Γ Ξ Γ Ξ where | |
| toFun l := (l 0, l 1, l 2) | |
| invFun t := ![t.1, t.2.1, t.2.2] | |
| left_inv l := by funext i; fin_cases i <;> rfl | |
| right_inv t := rfl | |
| theorem expectation_labels_le_of_repeated | |
| {Ξ : Type*} [Fintype Ξ] [DecidableEq Ξ] [Nonempty Ξ] | |
| (F : (Fin 3 β Ξ) β β) (M : β) (hM : 0 β€ M) | |
| (hbound : β l, F l β€ M) | |
| (hzero : β l, l 0 β l 1 β l 0 β l 2 β l 1 β l 2 β F l = 0) : | |
| (β l : Fin 3 β Ξ, uniformWeight (Fin 3 β Ξ) l * F l) β€ | |
| 3 * M / (Fintype.card Ξ : β) := by | |
| have h := Sampling.average_repeated_labels_le | |
| (fun a b c => F ![a, b, c]) M hM | |
| (fun a b c => hbound _) (fun a b c hab hac hbc => hzero _ hab hac hbc) | |
| have hs : (β l : Fin 3 β Ξ, F l) = β a, β b, β c, F ![a, b, c] := by | |
| calc | |
| _ = β t : Ξ Γ Ξ Γ Ξ, F ((labelsEquiv Ξ).symm t) := | |
| (labelsEquiv Ξ).symm.sum_comp F |>.symm | |
| _ = _ := by simp only [Fintype.sum_prod_type]; rfl | |
| have he : (β l : Fin 3 β Ξ, uniformWeight (Fin 3 β Ξ) l * F l) = | |
| (β l : Fin 3 β Ξ, F l) / (Fintype.card Ξ : β) ^ 3 := by | |
| unfold uniformWeight | |
| rw [β Finset.mul_sum] | |
| simp only [Fintype.card_fun, Fintype.card_fin, Nat.cast_pow] | |
| ring | |
| rw [he, hs] | |
| exact h | |
| theorem expectation_triple_le_of_repeated | |
| {Ξ X : Type*} [Fintype Ξ] [DecidableEq Ξ] [Nonempty Ξ] [Fintype X] {k : β} | |
| (F : (Fin 3 β Ξ) β Array X k β β) (M : β) (hM : 0 β€ M) | |
| (hbound : β l, (β f : Array X k, uniformWeight (Array X k) f * F l f) β€ M) | |
| (hzero : β l f, l 0 β l 1 β l 0 β l 2 β l 1 β l 2 β F l f = 0) : | |
| (β s : Fin 3 β Latent Ξ X k, | |
| ConditionalSamples.productWeight (uniformWeight (Latent Ξ X k)) s * | |
| F (tripleEquiv s).1 (tripleEquiv s).2) β€ | |
| 3 * M / (Fintype.card Ξ : β) := by | |
| rw [expectation_triple] | |
| apply expectation_labels_le_of_repeated _ M hM hbound | |
| intro l hab hac hbc | |
| simp only [hzero l _ hab hac hbc, mul_zero, Finset.sum_const_zero] | |
| theorem bad_triple_expectation_le | |
| {Ξ X : Type*} [Fintype Ξ] [DecidableEq Ξ] [Nonempty Ξ] [Fintype X] {k : β} | |
| (D : (Fin 3 β Ξ) β Array X k β β) | |
| (p : (Fin 3 β Latent Ξ X k) β β) (A : β) (hA : 0 β€ A) | |
| (hmoment : β l, (β f : Array X k, uniformWeight (Array X k) f * D l f) β€ 2) | |
| (hbound : β l f, p (tripleEquiv.symm (l, f)) β€ A * D l f) | |
| (hzero : β s, (s 0).1 β (s 1).1 β (s 0).1 β (s 2).1 β | |
| (s 1).1 β (s 2).1 β p s = 0) : | |
| (β s : Fin 3 β Latent Ξ X k, | |
| ConditionalSamples.productWeight (uniformWeight (Latent Ξ X k)) s * p s) β€ | |
| 6 * A / (Fintype.card Ξ : β) := by | |
| have h := expectation_triple_le_of_repeated | |
| (fun l f => p (tripleEquiv.symm (l, f))) (A * 2) (by positivity) | |
| (by | |
| intro l | |
| calc | |
| _ β€ β f : Array X k, uniformWeight (Array X k) f * (A * D l f) := | |
| Finset.sum_le_sum fun f _ => mul_le_mul_of_nonneg_left | |
| (hbound l f) (uniformWeight_nonneg _ f) | |
| _ = A * β f : Array X k, uniformWeight (Array X k) f * D l f := by | |
| rw [Finset.mul_sum] | |
| apply Finset.sum_congr rfl | |
| intro f _ | |
| ring | |
| _ β€ A * 2 := mul_le_mul_of_nonneg_left (hmoment l) hA) | |
| (by intro l f hab hac hbc; exact hzero _ hab hac hbc) | |
| simpa only [Prod.mk.eta, Equiv.symm_apply_apply, | |
| show 3 * (A * 2) = 6 * A by ring] using h | |
| end Problem355.DigitColumnLaw | |
| end | |
| end OAI | |