Download data/lean/OAI/Geometry/HeilbronnTriangle/DigitColumnLaw.lean from introvoyz045/math: direct link, hf CLI and curl.
- Browser
- Download file 3.91 kB
-
https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/Geometry/HeilbronnTriangle/DigitColumnLaw.lean
- Command line
-
hf download hf://datasets/introvoyz045/math/data/lean/OAI/Geometry/HeilbronnTriangle/DigitColumnLaw.lean
-
curl -L -o DigitColumnLaw.lean https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/Geometry/HeilbronnTriangle/DigitColumnLaw.lean
3.91 kB
| import OAI.Geometry.HeilbronnTriangle.ConditionalSamples | |
| import OAI.Geometry.HeilbronnTriangle.ConditionalMatrix | |
| namespace OAI | |
| namespace Problem355.DigitColumnLaw | |
| noncomputable section | |
| open scoped BigOperators | |
| abbrev Column (X : Type*) (k : β) := Fin 3 β Fin k β X | |
| abbrev Latent (Ξ X : Type*) (k : β) := Ξ Γ Column X k | |
| abbrev Array (X : Type*) (k : β) := Fin 3 β Fin 3 β Fin k β X | |
| def uniformWeight (Ξ± : Type*) [Fintype Ξ±] (_ : Ξ±) : β := 1 / Fintype.card Ξ± | |
| lemma uniformWeight_nonneg (Ξ± : Type*) [Fintype Ξ±] (a : Ξ±) : | |
| 0 β€ uniformWeight Ξ± a := by unfold uniformWeight; positivity | |
| lemma sum_uniformWeight (Ξ± : Type*) [Fintype Ξ±] [Nonempty Ξ±] : | |
| β a : Ξ±, uniformWeight Ξ± a = 1 := by | |
| have hcard : (0 : β) < Fintype.card Ξ± := by exact_mod_cast Fintype.card_pos | |
| simp only [uniformWeight, Finset.sum_const, Finset.card_univ, nsmul_eq_mul] | |
| exact mul_one_div_cancel hcard.ne' | |
| lemma productWeight_uniform {ΞΉ Ξ± : Type*} [Fintype ΞΉ] [DecidableEq ΞΉ] [Fintype Ξ±] | |
| (s : ΞΉ β Ξ±) : | |
| ConditionalSamples.productWeight (uniformWeight Ξ±) s = uniformWeight (ΞΉ β Ξ±) s := by | |
| simp [ConditionalSamples.productWeight, uniformWeight] | |
| def tripleEquiv {Ξ X : Type*} {k : β} : | |
| (Fin 3 β Latent Ξ X k) β ((Fin 3 β Ξ) Γ Array X k) where | |
| toFun s := (fun c => (s c).1, fun a c v => (s c).2 a v) | |
| invFun t := fun c => (t.1 c, fun a v => t.2 a c v) | |
| left_inv s := by funext c; rfl | |
| right_inv t := by cases t; rfl | |
| theorem expectation_triple {Ξ X : Type*} [Fintype Ξ] [Fintype X] {k : β} | |
| (F : (Fin 3 β Ξ) β Array X k β β) : | |
| (β s : Fin 3 β Latent Ξ X k, | |
| ConditionalSamples.productWeight (uniformWeight (Latent Ξ X k)) s * | |
| F (tripleEquiv s).1 (tripleEquiv s).2) = | |
| β labels : Fin 3 β Ξ, uniformWeight (Fin 3 β Ξ) labels * | |
| β f : Array X k, uniformWeight (Array X k) f * F labels f := by | |
| simp_rw [productWeight_uniform] | |
| have hcard := Fintype.card_congr (tripleEquiv (Ξ := Ξ) (X := X) (k := k)) | |
| have hsum := (tripleEquiv (Ξ := Ξ) (X := X) (k := k)).sum_comp | |
| (fun t => (1 / (Fintype.card (Fin 3 β Latent Ξ X k) : β)) * F t.1 t.2) | |
| change (β s : Fin 3 β Latent Ξ X k, | |
| (1 / (Fintype.card (Fin 3 β Latent Ξ X k) : β)) * | |
| F (tripleEquiv s).1 (tripleEquiv s).2) = _ | |
| rw [hsum, Fintype.sum_prod_type] | |
| apply Finset.sum_congr rfl | |
| intro labels _ | |
| rw [Finset.mul_sum] | |
| apply Finset.sum_congr rfl | |
| intro f _ | |
| rw [hcard] | |
| simp only [uniformWeight, Fintype.card_prod, Nat.cast_mul, one_div, mul_inv_rev] | |
| ring | |
| theorem expectation_triple_le {Ξ X : Type*} [Fintype Ξ] [Nonempty Ξ] [Fintype X] {k : β} | |
| (F : (Fin 3 β Ξ) β Array X k β β) (M : β) | |
| (hF : β labels, (β f : Array X k, uniformWeight (Array X k) f * F labels f) β€ M) : | |
| (β s : Fin 3 β Latent Ξ X k, | |
| ConditionalSamples.productWeight (uniformWeight (Latent Ξ X k)) s * | |
| F (tripleEquiv s).1 (tripleEquiv s).2) β€ M := by | |
| rw [expectation_triple] | |
| calc | |
| _ β€ β labels : Fin 3 β Ξ, uniformWeight (Fin 3 β Ξ) labels * M := by | |
| apply Finset.sum_le_sum | |
| intro labels _ | |
| exact mul_le_mul_of_nonneg_left (hF labels) (uniformWeight_nonneg _ labels) | |
| _ = M := by rw [β Finset.sum_mul, sum_uniformWeight, one_mul] | |
| def residueColumn {Ξ X : Type*} {B k : β} | |
| (digit : Ξ β Fin 3 β Fin k β X β Fin B) | |
| (x : Latent Ξ X k) : Fin 3 β ZMod (B ^ k) := | |
| fun a => ((β v : Fin k, (digit x.1 a v (x.2 a v)).val * B ^ v.val : β) : ZMod (B ^ k)) | |
| theorem residueColumn_matrix {Ξ X : Type*} {B k : β} | |
| (digit : Ξ β Fin 3 β Fin k β X β Fin B) (s : Fin 3 β Latent Ξ X k) : | |
| (fun a c => residueColumn digit (s c) a) = | |
| ConditionalMatrix.arrayMatrix | |
| (fun a c v x => digit ((tripleEquiv s).1 c) a v x) (tripleEquiv s).2 k := rfl | |
| end | |
| end Problem355.DigitColumnLaw | |
| end OAI | |