Download data/lean/OAI/Geometry/HeilbronnTriangle/AuxiliarySet.lean from introvoyz045/math: direct link, hf CLI and curl.
- Browser
- Download file 11.2 kB
-
https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/Geometry/HeilbronnTriangle/AuxiliarySet.lean
- Command line
-
hf download hf://datasets/introvoyz045/math/data/lean/OAI/Geometry/HeilbronnTriangle/AuxiliarySet.lean
-
curl -L -o AuxiliarySet.lean https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/Geometry/HeilbronnTriangle/AuxiliarySet.lean
11.2 kB
| import OAI.Geometry.HeilbronnTriangle.AuxiliaryCap | |
| import OAI.Geometry.HeilbronnTriangle.ShortRelations | |
| import OAI.Geometry.HeilbronnTriangle.AllowedShifts | |
| import OAI.Geometry.HeilbronnTriangle.CapInBox | |
| namespace OAI | |
| namespace Problem355.AuxiliarySet | |
| open scoped BigOperators | |
| variable {F : Type*} [Field F] | |
| theorem affineIndependent_of_mem_cap | |
| {S : Set (Fin 3 β F)} (hS : AuxiliaryCap.IsCap S) | |
| {p : Fin 3 β (Fin 3 β F)} (hp : β i, p i β S) | |
| (hinj : Function.Injective p) : AffineIndependent F p := by | |
| have hcol := hS (p 0) (hp 0) (p 1) (hp 1) (p 2) (hp 2) | |
| (hinj.ne (by decide)) (hinj.ne (by decide)) (hinj.ne (by decide)) | |
| have h := affineIndependent_iff_not_collinear_set.mpr hcol | |
| convert h using 1 | |
| funext i | |
| fin_cases i <;> rfl | |
| noncomputable def transformed (S : Finset (Fin 3 β F)) (a : Fin 3 β F) | |
| (G : (Fin 3 β F) ββ[F] (Fin 3 β F)) : Finset (Fin 3 β F) := by | |
| classical | |
| exact S.image (fun v => G (a + v)) | |
| @[simp] theorem mem_transformed (S : Finset (Fin 3 β F)) (a : Fin 3 β F) | |
| (G : (Fin 3 β F) ββ[F] (Fin 3 β F)) (u : Fin 3 β F) : | |
| u β transformed S a G β β v β S, G (a + v) = u := by | |
| classical | |
| simp [transformed] | |
| @[simp] theorem card_transformed (S : Finset (Fin 3 β F)) (a : Fin 3 β F) | |
| (G : (Fin 3 β F) ββ[F] (Fin 3 β F)) : | |
| (transformed S a G).card = S.card := by | |
| classical | |
| apply Finset.card_image_iff.mpr | |
| intro v hv w hw heq | |
| exact add_left_cancel (G.injective heq) | |
| theorem isCap_transformed {S : Finset (Fin 3 β F)} | |
| (hS : AuxiliaryCap.IsCap (S : Set (Fin 3 β F))) | |
| (a : Fin 3 β F) (G : (Fin 3 β F) ββ[F] (Fin 3 β F)) : | |
| AuxiliaryCap.IsCap (transformed S a G : Set (Fin 3 β F)) := by | |
| have h := (hS.translate a).image G.toAffineEquiv.toAffineMap G.injective | |
| convert h using 1 | |
| ext v | |
| simp only [Finset.mem_coe, mem_transformed, Set.mem_image] | |
| constructor | |
| Β· rintro β¨w, hw, rflβ© | |
| exact β¨a + w, β¨w, hw, rflβ©, rflβ© | |
| Β· rintro β¨_, β¨w, hw, rflβ©, rflβ© | |
| exact β¨w, hw, rflβ© | |
| theorem zero_not_mem_transformed {S : Finset (Fin 3 β F)} {a : Fin 3 β F} | |
| (ha : β v β S, a + v β 0) | |
| (G : (Fin 3 β F) ββ[F] (Fin 3 β F)) : | |
| (0 : Fin 3 β F) β transformed S a G := by | |
| rintro h | |
| obtain β¨v, hv, hzeroβ© := (mem_transformed S a G 0).mp h | |
| exact ha v hv (G.map_eq_zero_iff.mp hzero) | |
| theorem short_sum_zero_relation_excluded | |
| {q H : β} [Fact q.Prime] | |
| {S : Finset (Fin 3 β ZMod q)} | |
| (hS : AuxiliaryCap.IsCap (S : Set (Fin 3 β ZMod q))) | |
| (a : Fin 3 β ZMod q) | |
| (G : (Fin 3 β ZMod q) ββ[ZMod q] (Fin 3 β ZMod q)) | |
| {p : Fin 3 β (Fin 3 β ZMod q)} | |
| (hp : β i, p i β transformed S a G) (hinj : Function.Injective p) | |
| {x : Fin 3 β β€} (hsum : β i, x i = 0) | |
| (hshort : β i, |x i| β€ (H : β€)) (hHq : H < q) (hne : x β 0) : | |
| (β i, (x i : ZMod q) β’ p i) β 0 := by | |
| exact ShortRelations.sum_smul_ne_zero_of_bounded_coefficients | |
| (affineIndependent_of_mem_cap (isCap_transformed hS a G) hp hinj) | |
| hsum hshort hHq hne | |
| theorem short_nonzero_sum_relation_excluded | |
| {q H w : β} [Fact q.Prime] | |
| {S : Finset (Fin 3 β ZMod q)} | |
| (hbox : β v β S, (v 0).val < w) | |
| (a : Fin 3 β ZMod q) | |
| (ha : β n : β, 1 β€ n β n β€ 3 * H β | |
| (n : ZMod q) * a 0 β Auxiliary.integerWindow q (3 * H * w)) | |
| (G : (Fin 3 β ZMod q) ββ[ZMod q] (Fin 3 β ZMod q)) | |
| {p : Fin 3 β (Fin 3 β ZMod q)} | |
| (hp : β i, p i β transformed S a G) | |
| {x : Fin 3 β β€} (hsum : β i, x i β 0) | |
| (hshort : β i, |x i| β€ (H : β€)) : | |
| (β i, (x i : ZMod q) β’ p i) β 0 := by | |
| classical | |
| choose v hv heq using fun i => (mem_transformed S a G (p i)).mp (hp i) | |
| let z : Fin 3 β Fin 3 β β€ := fun i j => (v i j).val | |
| have hz : β i, (fun j => (z i j : ZMod q)) = v i := by | |
| intro i | |
| funext j | |
| simp [z] | |
| have hb : β i, 0 β€ z i 0 β§ z i 0 β€ (w : β€) := by | |
| intro i | |
| constructor | |
| Β· exact Int.natCast_nonneg _ | |
| Β· dsimp [z] | |
| exact_mod_cast (hbox (v i) (hv i)).le | |
| have h := Auxiliary.shifted_vector_short_relation_ne_zero q H w a ha x z | |
| hshort hb hsum G | |
| simpa only [hz, heq] using h | |
| theorem zero_not_mem_of_allowed | |
| {q H w : β} [Fact q.Prime] (hH : 1 β€ H) | |
| {S : Finset (Fin 3 β ZMod q)} | |
| (hbox : β v β S, (v 0).val < w) | |
| (a : Fin 3 β ZMod q) | |
| (ha : β n : β, 1 β€ n β n β€ 3 * H β | |
| (n : ZMod q) * a 0 β Auxiliary.integerWindow q (3 * H * w)) | |
| (G : (Fin 3 β ZMod q) ββ[ZMod q] (Fin 3 β ZMod q)) : | |
| (0 : Fin 3 β ZMod q) β transformed S a G := by | |
| intro hzero | |
| have h := short_nonzero_sum_relation_excluded hbox a ha G | |
| (p := fun _ => 0) (fun _ => hzero) (x := ![1, 0, 0]) | |
| (by norm_num [Fin.sum_univ_succ]) | |
| (by | |
| intro i | |
| fin_cases i | |
| Β· simpa using (show (1 : β€) β€ H by exact_mod_cast hH) | |
| Β· simp | |
| Β· simp) | |
| exact h (by simp) | |
| theorem short_relation_excluded | |
| {q H w : β} [Fact q.Prime] | |
| {S : Finset (Fin 3 β ZMod q)} | |
| (hS : AuxiliaryCap.IsCap (S : Set (Fin 3 β ZMod q))) | |
| (hbox : β v β S, (v 0).val < w) | |
| (a : Fin 3 β ZMod q) | |
| (ha : β n : β, 1 β€ n β n β€ 3 * H β | |
| (n : ZMod q) * a 0 β Auxiliary.integerWindow q (3 * H * w)) | |
| (G : (Fin 3 β ZMod q) ββ[ZMod q] (Fin 3 β ZMod q)) | |
| {p : Fin 3 β (Fin 3 β ZMod q)} | |
| (hp : β i, p i β transformed S a G) (hinj : Function.Injective p) | |
| {x : Fin 3 β β€} (hshort : β i, |x i| β€ (H : β€)) | |
| (hHq : H < q) (hne : x β 0) : | |
| (β i, (x i : ZMod q) β’ p i) β 0 := by | |
| by_cases hsum : β i, x i = 0 | |
| Β· exact short_sum_zero_relation_excluded hS a G hp hinj hsum hshort hHq hne | |
| Β· exact short_nonzero_sum_relation_excluded hbox a ha G hp hsum hshort | |
| theorem transformed_properties | |
| {q H w : β} [Fact q.Prime] (hH : 1 β€ H) (hHq : H < q) | |
| {S : Finset (Fin 3 β ZMod q)} | |
| (hS : AuxiliaryCap.IsCap (S : Set (Fin 3 β ZMod q))) | |
| (hbox : β v β S, (v 0).val < w) | |
| (a : Fin 3 β ZMod q) | |
| (ha : β n : β, 1 β€ n β n β€ 3 * H β | |
| (n : ZMod q) * a 0 β Auxiliary.integerWindow q (3 * H * w)) | |
| (G : (Fin 3 β ZMod q) ββ[ZMod q] (Fin 3 β ZMod q)) : | |
| (transformed S a G).card = S.card β§ | |
| (0 : Fin 3 β ZMod q) β transformed S a G β§ | |
| AuxiliaryCap.IsCap (transformed S a G : Set (Fin 3 β ZMod q)) β§ | |
| β p : Fin 3 β (Fin 3 β ZMod q), | |
| (β i, p i β transformed S a G) β Function.Injective p β | |
| β x : Fin 3 β β€, (β i, |x i| β€ (H : β€)) β x β 0 β | |
| (β i, (x i : ZMod q) β’ p i) β 0 := by | |
| refine β¨card_transformed S a G, zero_not_mem_of_allowed hH hbox a ha G, | |
| isCap_transformed hS a G, ?_β© | |
| intro p hp hinj x hx hne | |
| exact short_relation_excluded hS hbox a ha G hp hinj hx hHq hne | |
| theorem exists_set_excluding_short_relations | |
| {q H w : β} [Fact q.Prime] (hH : 1 β€ H) | |
| (hq : 2000 * H ^ 2 β€ q) (hw : 1000 * H ^ 2 * w β€ q) | |
| {S : Finset (Fin 3 β ZMod q)} | |
| (hS : AuxiliaryCap.IsCap (S : Set (Fin 3 β ZMod q))) | |
| (hbox : β v β S, (v 0).val < w) : | |
| β V : Finset (Fin 3 β ZMod q), V.card = S.card β§ | |
| (0 : Fin 3 β ZMod q) β V β§ | |
| AuxiliaryCap.IsCap (V : Set (Fin 3 β ZMod q)) β§ | |
| β p : Fin 3 β (Fin 3 β ZMod q), | |
| (β i, p i β V) β Function.Injective p β | |
| β x : Fin 3 β β€, (β i, |x i| β€ (H : β€)) β x β 0 β | |
| (β i, (x i : ZMod q) β’ p i) β 0 := by | |
| obtain β¨aβ, haββ© := Auxiliary.exists_auxiliary_allowed_shift q H w hH hq hw | |
| let a : Fin 3 β ZMod q := ![aβ, 0, 0] | |
| let G := LinearEquiv.refl (ZMod q) (Fin 3 β ZMod q) | |
| refine β¨transformed S a G, transformed_properties hH ?_ hS hbox a ?_ Gβ© | |
| Β· have h := Auxiliary.auxiliary_multiplier_range q H hH hq | |
| omega | |
| Β· simpa only [a, Matrix.cons_val_zero] using haβ | |
| theorem le_twice_mul_div {q d : β} (hd : 0 < d) (hdq : d β€ q) : | |
| q β€ 2 * d * (q / d) := by | |
| have hquot : 1 β€ q / d := (Nat.le_div_iff_mul_le hd).mpr (by simpa using hdq) | |
| have hrem := Nat.mod_lt q hd | |
| have hsplit := Nat.mod_add_div q d | |
| have hprod : d β€ d * (q / d) := by | |
| simpa using Nat.mul_le_mul_left d hquot | |
| nlinarith | |
| theorem exists_large_auxiliary_set | |
| {q H : β} [Fact q.Prime] (hH : 1 β€ H) (hq : 2000 * H ^ 2 β€ q) : | |
| β V : Finset (Fin 3 β ZMod q), | |
| q ^ 2 β€ 2000 ^ 3 * H ^ 6 * V.card β§ | |
| (0 : Fin 3 β ZMod q) β V β§ | |
| AuxiliaryCap.IsCap (V : Set (Fin 3 β ZMod q)) β§ | |
| β p : Fin 3 β (Fin 3 β ZMod q), | |
| (β i, p i β V) β Function.Injective p β | |
| β x : Fin 3 β β€, (β i, |x i| β€ (H : β€)) β x β 0 β | |
| (β i, (x i : ZMod q) β’ p i) β 0 := by | |
| let w := q / (1000 * H ^ 2) | |
| have hHsq : 1 β€ H ^ 2 := by nlinarith | |
| have hd : 0 < 1000 * H ^ 2 := by positivity | |
| have hdq : 1000 * H ^ 2 β€ q := by omega | |
| have hq2 : q β 2 := by omega | |
| have hwq : w β€ q := Nat.div_le_self _ _ | |
| obtain β¨S, hbox, hsize, hcapβ© := AuxiliaryCap.exists_cap_in_residueBox hq2 hwq | |
| have hw : 1000 * H ^ 2 * w β€ q := Nat.mul_div_le _ _ | |
| obtain β¨V, hcard, hzero, hVcap, hrelβ© := | |
| exists_set_excluding_short_relations hH hq hw hcap (fun v hv => hbox v hv 0) | |
| refine β¨V, ?_, hzero, hVcap, hrelβ© | |
| rw [hcard] | |
| have hfloor : q β€ 2000 * H ^ 2 * w := by | |
| calc | |
| q β€ 2 * (1000 * H ^ 2) * w := le_twice_mul_div hd hdq | |
| _ = 2000 * H ^ 2 * w := by ring | |
| have hcube : q ^ 3 β€ (2000 * H ^ 2 * w) ^ 3 := by gcongr | |
| have hmul : q * q ^ 2 β€ q * (2000 ^ 3 * H ^ 6 * S.card) := by | |
| calc | |
| q * q ^ 2 = q ^ 3 := by ring | |
| _ β€ (2000 * H ^ 2 * w) ^ 3 := hcube | |
| _ = (2000 ^ 3 * H ^ 6) * w ^ 3 := by ring | |
| _ β€ (2000 ^ 3 * H ^ 6) * (q * S.card) := Nat.mul_le_mul_left _ hsize | |
| _ = q * (2000 ^ 3 * H ^ 6 * S.card) := by ring | |
| exact Nat.le_of_mul_le_mul_left hmul (Fact.out : q.Prime).pos | |
| theorem exists_large_auxiliary_set_real | |
| {q H : β} [Fact q.Prime] (hH : 1 β€ H) (hq : 2000 * H ^ 2 β€ q) : | |
| β V : Finset (Fin 3 β ZMod q), | |
| (q : β) ^ 2 / (2000 ^ 3 * (H : β) ^ 6) β€ V.card β§ V.Nonempty β§ | |
| (0 : Fin 3 β ZMod q) β V β§ | |
| AuxiliaryCap.IsCap (V : Set (Fin 3 β ZMod q)) β§ | |
| β p : Fin 3 β (Fin 3 β ZMod q), | |
| (β i, p i β V) β Function.Injective p β | |
| β x : Fin 3 β β€, (β i, |x i| β€ (H : β€)) β x β 0 β | |
| (β i, (x i : ZMod q) β’ p i) β 0 := by | |
| obtain β¨V, hsize, hzero, hcap, hrelβ© := exists_large_auxiliary_set hH hq | |
| have hHp : (0 : β) < H := by exact_mod_cast (show 0 < H by omega) | |
| have hsizeR : (q : β) ^ 2 β€ (2000 ^ 3 * (H : β) ^ 6) * V.card := by | |
| exact_mod_cast hsize | |
| have hVpos : 0 < V.card := by | |
| by_contra hnot | |
| have hv : V.card = 0 := by omega | |
| have hqp : 0 < q ^ 2 := pow_pos (Fact.out : q.Prime).pos 2 | |
| simp only [hv, mul_zero] at hsize | |
| omega | |
| refine β¨V, ?_, Finset.card_pos.mp hVpos, hzero, hcap, hrelβ© | |
| exact (div_le_iffβ (by positivity)).mpr (by simpa [mul_comm] using hsizeR) | |
| end Problem355.AuxiliarySet | |
| end OAI | |