math / data /lean /OAI /Geometry /HeilbronnTriangle /AnisotropicCount.lean
introvoyz045's picture
Migrated from GitHub
4a56cd6 verified
Raw History Blame Contribute Delete
18.1 kB
import OAI.Geometry.HeilbronnTriangle.AnisotropicGeometry
import OAI.Geometry.HeilbronnTriangle.AnisotropicDyadic
import OAI.Geometry.HeilbronnTriangle.PlaneFiberAssembly
import OAI.Geometry.HeilbronnTriangle.IntegerNormalGroups
import OAI.Geometry.HeilbronnTriangle.AnisotropicPlaneData
namespace OAI
noncomputable section
namespace Problem355.Anisotropic
open Matrix
open scoped Matrix
open PrimitiveNormal
abbrev Triple := PlaneFiberAssembly.Triple
theorem thick_fiber_card_le
(S : Finset Triple) (y : IntVector) (d : PlaneData y) (t : β„€)
(R₁ Rβ‚‚ R₃ : ℝ) (h₂₁ : Rβ‚‚ ≀ R₁) (h₃₂ : R₃ ≀ Rβ‚‚)
(hlarge : d.second ≀ R₃)
(hdet : βˆ€ x ∈ S, x.1 ⬝α΅₯ (x.2.1 ⨯₃ x.2.2) = t)
(hcross : βˆ€ x ∈ S, βˆƒ a : β„€, a β‰  0 ∧ x.2.1 ⨯₃ x.2.2 = a β€’ y)
(hplane : βˆ€ x ∈ S, x.2.1 ⬝α΅₯ y = 0 ∧ x.2.2 ⬝α΅₯ y = 0)
(hnorm : βˆ€ x ∈ S, length x.1 ≀ R₁ ∧
length x.2.1 ≀ Rβ‚‚ ∧ length x.2.2 ≀ R₃) :
(S.card : ℝ) ≀ 2916 * Real.pi ^ 3 * (R₁ * Rβ‚‚ * R₃) ^ 2 / length y ^ 3 := by
have h := PlaneFiberAssembly.triple_count_of_plane_counts S y t R₁ Rβ‚‚ R₃
(36 * Real.pi * R₁ ^ 2 / length y)
(9 * Real.pi * Rβ‚‚ ^ 2 / length y)
(9 * Real.pi * R₃ ^ 2 / length y)
(by positivity) (by positivity) hdet hcross hplane hnorm
(fun T center hT => affine_plane_card_le y d T center R₁
(hlarge.trans (h₃₂.trans h₂₁)) (fun v hv => (hT v hv).2)
(fun v hv w hw => by rw [sub_dotProduct, (hT v hv).1, (hT w hw).1, sub_self]))
(fun T hT => d.large_count T Rβ‚‚ (hlarge.trans h₃₂) hT)
(fun T hT => d.large_count T R₃ hlarge hT)
convert h using 1; ring
theorem thin_fiber_card_le
(S : Finset Triple) (y : IntVector) (d : PlaneData y) (t : β„€)
(R₁ Rβ‚‚ R₃ : ℝ) (h₂₁ : Rβ‚‚ ≀ R₁)
(hlarge : d.second ≀ Rβ‚‚) (hfirst : d.first ≀ R₃) (hthin : R₃ < d.second)
(hdet : βˆ€ x ∈ S, x.1 ⬝α΅₯ (x.2.1 ⨯₃ x.2.2) = t)
(hcross : βˆ€ x ∈ S, βˆƒ a : β„€, a β‰  0 ∧ x.2.1 ⨯₃ x.2.2 = a β€’ y)
(hplane : βˆ€ x ∈ S, x.2.1 ⬝α΅₯ y = 0 ∧ x.2.2 ⬝α΅₯ y = 0)
(hnorm : βˆ€ x ∈ S, length x.1 ≀ R₁ ∧
length x.2.1 ≀ Rβ‚‚ ∧ length x.2.2 ≀ R₃) :
(S.card : ℝ) ≀ 972 * Real.pi ^ 2 * R₁ ^ 2 * Rβ‚‚ ^ 2 * R₃ /
(length y ^ 2 * d.first) := by
have h := PlaneFiberAssembly.triple_count_of_plane_counts S y t R₁ Rβ‚‚ R₃
(36 * Real.pi * R₁ ^ 2 / length y)
(9 * Real.pi * Rβ‚‚ ^ 2 / length y) (3 * R₃ / d.first)
(by positivity) (by positivity) hdet hcross hplane hnorm
(fun T center hT => affine_plane_card_le y d T center R₁
(hlarge.trans h₂₁) (fun v hv => (hT v hv).2)
(fun v hv w hw => by rw [sub_dotProduct, (hT v hv).1, (hT w hw).1, sub_self]))
(fun T hT => d.large_count T Rβ‚‚ hlarge hT)
(fun T hT => d.small_count T R₃ hfirst hthin hT)
convert h using 1; ring
theorem scales_le_of_nonempty
(S : Finset Triple) (y : IntVector) (d : PlaneData y) (t : β„€) (ht : t β‰  0)
(Rβ‚‚ R₃ : ℝ) (h₃₂ : R₃ ≀ Rβ‚‚) (hS : S.Nonempty)
(hdet : βˆ€ x ∈ S, x.1 ⬝α΅₯ (x.2.1 ⨯₃ x.2.2) = t)
(hplane : βˆ€ x ∈ S, x.2.1 ⬝α΅₯ y = 0 ∧ x.2.2 ⬝α΅₯ y = 0)
(hnorm : βˆ€ x ∈ S, length x.2.1 ≀ Rβ‚‚ ∧ length x.2.2 ≀ R₃) :
d.first ≀ R₃ ∧ d.second ≀ Rβ‚‚ := by
obtain ⟨x, hx⟩ := hS
have hc : x.2.1 ⨯₃ x.2.2 β‰  0 := by
intro hc
apply ht
have h := hdet x hx
simpa [hc] using h.symm
have hv : x.2.2 β‰  0 := by
intro hv
apply hc
simp [hv]
refine ⟨(d.first_le _ (hplane x hx).2 hv).trans (hnorm x hx).2, ?_⟩
exact (d.second_le _ _ (hplane x hx).1 (hplane x hx).2 hc).trans
(max_le (hnorm x hx).1 ((hnorm x hx).2.trans h₃₂))
theorem thin_shell_sum_le
(S : Finset IntVector) (first weight : IntVector β†’ ℝ)
(R₁ Rβ‚‚ R₃ U Y Cβ‚€ C₁ : ℝ)
(hU : 0 < U) (hY : 0 < Y) (hR₃ : 0 ≀ R₃) (hUR : U ≀ R₃)
(hCβ‚€ : 0 ≀ Cβ‚€) (hC₁ : 0 ≀ C₁)
(hcard : (S.card : ℝ) ≀ Cβ‚€ * U ^ 2 * Y ^ 2)
(hrange : βˆ€ y ∈ S, U ≀ first y ∧ Y ≀ length y)
(hweight : βˆ€ y ∈ S, weight y ≀
C₁ * R₁ ^ 2 * Rβ‚‚ ^ 2 * R₃ / (length y ^ 2 * first y)) :
βˆ‘ y ∈ S, weight y ≀ Cβ‚€ * C₁ * (R₁ * Rβ‚‚ * R₃) ^ 2 := by
have hB : 0 ≀ C₁ * R₁ ^ 2 * Rβ‚‚ ^ 2 * R₃ / (Y ^ 2 * U) := by positivity
calc
βˆ‘ y ∈ S, weight y ≀
βˆ‘ _y ∈ S, C₁ * R₁ ^ 2 * Rβ‚‚ ^ 2 * R₃ / (Y ^ 2 * U) := by
apply Finset.sum_le_sum
intro y hy
apply (hweight y hy).trans
apply div_le_div_of_nonneg_left (by positivity) (by positivity)
exact mul_le_mul (pow_le_pow_leftβ‚€ hY.le (hrange y hy).2 2)
(hrange y hy).1 hU.le (sq_nonneg _)
_ = (S.card : ℝ) * (C₁ * R₁ ^ 2 * Rβ‚‚ ^ 2 * R₃ / (Y ^ 2 * U)) := by simp
_ ≀ (Cβ‚€ * U ^ 2 * Y ^ 2) *
(C₁ * R₁ ^ 2 * Rβ‚‚ ^ 2 * R₃ / (Y ^ 2 * U)) :=
mul_le_mul_of_nonneg_right hcard hB
_ = (Cβ‚€ * C₁) * U ^ 2 * Y ^ 2 * (R₁ ^ 2 / Y) *
(Rβ‚‚ ^ 2 / Y) * (R₃ / U) := by field_simp
_ ≀ (Cβ‚€ * C₁) * (R₁ * Rβ‚‚ * R₃) ^ 2 :=
thin_normal_group_numeric hU hY hR₃ hUR (mul_nonneg hCβ‚€ hC₁)
theorem thin_normal_sum_le
(S : Finset IntVector) (first weight : IntVector β†’ ℝ)
(R₁ Rβ‚‚ R₃ Cβ‚€ C₁ : ℝ)
(hβ‚‚ : 1 ≀ Rβ‚‚) (h₃ : 1 ≀ R₃)
(h₂₁ : Rβ‚‚ ≀ R₁) (h₃₁ : R₃ ≀ R₁)
(hCβ‚€ : 0 ≀ Cβ‚€) (hC₁ : 0 ≀ C₁)
(hweight0 : βˆ€ y ∈ S, 0 ≀ weight y)
(hrange : βˆ€ y ∈ S, 1 ≀ first y ∧ first y ≀ R₃ ∧
1 ≀ length y ∧ length y ≀ Rβ‚‚ * R₃)
(hweight : βˆ€ y ∈ S, weight y ≀
C₁ * R₁ ^ 2 * Rβ‚‚ ^ 2 * R₃ / (length y ^ 2 * first y))
(hgroup : βˆ€ (T : Finset IntVector), T βŠ† S β†’ βˆ€ U Y : ℝ,
1 ≀ U β†’ 1 ≀ Y β†’
(βˆ€ y ∈ T, U ≀ first y ∧ first y ≀ 2 * U ∧
Y ≀ length y ∧ length y ≀ 2 * Y) β†’
(T.card : ℝ) ≀ Cβ‚€ * U ^ 2 * Y ^ 2) :
βˆ‘ y ∈ S, weight y ≀
2 * Cβ‚€ * C₁ * (R₁ * Rβ‚‚ * R₃) ^ 2 *
(Real.log (2 * R₁) / Real.log 2) ^ 2 := by
classical
have hprod : 1 ≀ Rβ‚‚ * R₃ := by nlinarith
have hA : 0 ≀ Cβ‚€ * C₁ * (R₁ * Rβ‚‚ * R₃) ^ 2 := by positivity
have h := sum_le_of_dyadic_shell_estimates S first length weight h₃ hprod hA
hweight0 hrange (by
intro i j
let T := S.filter fun y => (2 : ℝ) ^ i ≀ first y ∧ first y < 2 ^ (i + 1) ∧
(2 : ℝ) ^ j ≀ length y ∧ length y < 2 ^ (j + 1)
have hU : 1 ≀ (2 : ℝ) ^ i := one_le_powβ‚€ (by norm_num)
have hY : 1 ≀ (2 : ℝ) ^ j := one_le_powβ‚€ (by norm_num)
have hTS : T βŠ† S := Finset.filter_subset _ _
have hT (y : IntVector) (hy : y ∈ T) :
(2 : ℝ) ^ i ≀ first y ∧ first y ≀ 2 * 2 ^ i ∧
(2 : ℝ) ^ j ≀ length y ∧ length y ≀ 2 * 2 ^ j := by
obtain ⟨_, h₁, hβ‚‚, h₃, hβ‚„βŸ© := Finset.mem_filter.mp hy
exact ⟨h₁, by simpa [pow_succ, mul_comm] using hβ‚‚.le,
h₃, by simpa [pow_succ, mul_comm] using hβ‚„.le⟩
change βˆ‘ y ∈ T, weight y ≀ _
by_cases hne : T.Nonempty
· obtain ⟨y, hy⟩ := hne
exact thin_shell_sum_le T first weight R₁ Rβ‚‚ R₃ _ _ Cβ‚€ C₁
(by positivity) (by positivity) (by linarith)
((hT y hy).1.trans (hrange y (hTS hy)).2.1) hCβ‚€ hC₁
(hgroup T hTS _ _ hU hY hT)
(fun z hz => ⟨(hT z hz).1, (hT z hz).2.2.1⟩)
(fun z hz => hweight z (hTS hz))
Β· rw [Finset.not_nonempty_iff_eq_empty.mp hne]
simpa using hA)
calc
βˆ‘ y ∈ S, weight y ≀
(Cβ‚€ * C₁ * (R₁ * Rβ‚‚ * R₃) ^ 2) *
((Real.log (2 * R₃) / Real.log 2) *
(Real.log (2 * (Rβ‚‚ * R₃)) / Real.log 2)) := by
simpa only [mul_assoc] using h
_ ≀ (Cβ‚€ * C₁ * (R₁ * Rβ‚‚ * R₃) ^ 2) *
(2 * (Real.log (2 * R₁) / Real.log 2) ^ 2) :=
mul_le_mul_of_nonneg_left (dyadic_log_product_le hβ‚‚ h₃ h₂₁ h₃₁) hA
_ = _ := by ring
theorem triple_card_le_of_normal_assignment
(hplanes : βˆ€ y : IntVector, IsPrimitive y β†’ Nonempty (PlaneData y))
(S : Finset Triple) (normal : Triple β†’ IntVector) (t : β„€) (ht : t β‰  0)
(R₁ Rβ‚‚ R₃ : ℝ) (h₃ : 1 ≀ R₃) (h₃₂ : R₃ ≀ Rβ‚‚) (h₂₁ : Rβ‚‚ ≀ R₁)
(hdet : βˆ€ x ∈ S, x.1 ⬝α΅₯ (x.2.1 ⨯₃ x.2.2) = t)
(hprim : βˆ€ x ∈ S, IsPrimitive (normal x))
(hcross : βˆ€ x ∈ S, βˆƒ a : β„€, a β‰  0 ∧ x.2.1 ⨯₃ x.2.2 = a β€’ normal x)
(hplane : βˆ€ x ∈ S, x.2.1 ⬝α΅₯ normal x = 0 ∧ x.2.2 ⬝α΅₯ normal x = 0)
(hnormal : βˆ€ x ∈ S, length (normal x) ≀ Rβ‚‚ * R₃)
(hnorm : βˆ€ x ∈ S, length x.1 ≀ R₁ ∧
length x.2.1 ≀ Rβ‚‚ ∧ length x.2.2 ≀ R₃) :
(S.card : ℝ) ≀ 35721000 * Real.pi ^ 3 * (R₁ * Rβ‚‚ * R₃) ^ 2 *
(Real.log (2 * R₁) / Real.log 2) ^ 2 := by
classical
let Y := S.image normal
let F (y : IntVector) := S.filter (fun x => normal x = y)
let weight (y : IntVector) : ℝ := (F y).card
let data (y : IntVector) (hy : IsPrimitive y) : PlaneData y :=
Classical.choice (hplanes y hy)
let first (y : IntVector) := if hy : IsPrimitive y then (data y hy).first else 1
let second (y : IntVector) := if hy : IsPrimitive y then (data y hy).second else 1
have hY (y : IntVector) (hy : y ∈ Y) : IsPrimitive y ∧
1 ≀ length y ∧ length y ≀ Rβ‚‚ * R₃ ∧ (F y).Nonempty := by
obtain ⟨x, hx, rfl⟩ := Finset.mem_image.mp hy
exact ⟨hprim x hx, LatticeBox.one_le_norm_realVector (hprim x hx).ne_zero,
hnormal x hx, ⟨x, Finset.mem_filter.mpr ⟨hx, rfl⟩⟩⟩
have hFdet (y : IntVector) : βˆ€ x ∈ F y,
x.1 ⬝α΅₯ (x.2.1 ⨯₃ x.2.2) = t :=
fun x hx => hdet x (Finset.mem_filter.mp hx).1
have hFcross (y : IntVector) : βˆ€ x ∈ F y,
βˆƒ a : β„€, a β‰  0 ∧ x.2.1 ⨯₃ x.2.2 = a β€’ y := by
intro x hx
obtain ⟨hxS, hxy⟩ := Finset.mem_filter.mp hx
simpa only [hxy] using hcross x hxS
have hFplane (y : IntVector) : βˆ€ x ∈ F y,
x.2.1 ⬝α΅₯ y = 0 ∧ x.2.2 ⬝α΅₯ y = 0 := by
intro x hx
obtain ⟨hxS, hxy⟩ := Finset.mem_filter.mp hx
simpa only [hxy] using hplane x hxS
have hFnorm (y : IntVector) : βˆ€ x ∈ F y, length x.1 ≀ R₁ ∧
length x.2.1 ≀ Rβ‚‚ ∧ length x.2.2 ≀ R₃ :=
fun x hx => hnorm x (Finset.mem_filter.mp hx).1
have hscale (y : IntVector) (hy : y ∈ Y) :
1 ≀ first y ∧ first y ≀ R₃ ∧ second y ≀ Rβ‚‚ := by
have hp := (hY y hy).1
have hs := scales_le_of_nonempty (F y) y (data y hp) t ht Rβ‚‚ R₃ h₃₂
(hY y hy).2.2.2 (hFdet y) (hFplane y) (fun x hx => (hFnorm y x hx).2)
simpa only [first, second, dite_eq_left hp] using
And.intro (data y hp).one_le_first hs
let E := Y.filter (fun y => second y ≀ R₃)
let T := Y.filter (fun y => Β¬ second y ≀ R₃)
have hβ‚‚ : 1 ≀ Rβ‚‚ := h₃.trans h₃₂
have h₁ : 1 ≀ R₁ := hβ‚‚.trans h₂₁
have hRprod : 1 ≀ Rβ‚‚ * R₃ := by nlinarith
have hthin : βˆ‘ y ∈ T, weight y ≀
2 * (18000 * Real.pi) * (972 * Real.pi ^ 2) * (R₁ * Rβ‚‚ * R₃) ^ 2 *
(Real.log (2 * R₁) / Real.log 2) ^ 2 := by
apply thin_normal_sum_le T first weight R₁ Rβ‚‚ R₃ _ _ hβ‚‚ h₃ h₂₁ (h₃₂.trans h₂₁)
(by positivity) (by positivity)
Β· intro y hy
exact Nat.cast_nonneg _
Β· intro y hy
have hyY := (Finset.mem_filter.mp hy).1
exact ⟨(hscale y hyY).1, (hscale y hyY).2.1,
(hY y hyY).2.1, (hY y hyY).2.2.1⟩
Β· intro y hy
obtain ⟨hyY, hyt⟩ := Finset.mem_filter.mp hy
have hp := (hY y hyY).1
have hlarge : (data y hp).second ≀ Rβ‚‚ := by
simpa only [second, dite_eq_left hp] using (hscale y hyY).2.2
have hfirst : (data y hp).first ≀ R₃ := by
simpa only [first, dite_eq_left hp] using (hscale y hyY).2.1
have hlow : R₃ < (data y hp).second := by
simpa only [second, dite_eq_left hp] using lt_of_not_ge hyt
simpa only [first, dite_eq_left hp, weight] using
thin_fiber_card_le (F y) y (data y hp) t R₁ Rβ‚‚ R₃ h₂₁
hlarge hfirst hlow (hFdet y) (hFcross y) (hFplane y) (hFnorm y)
Β· intro A hAT U Z hU hZ hA
apply normal_shell_card_le hplanes hU (by linarith) A
intro y hy
have hyY := (Finset.mem_filter.mp (hAT hy)).1
have hp := (hY y hyY).1
refine ⟨hp, (hA y hy).2.2.2, data y hp, ?_, ?_⟩
Β· simpa only [first, dite_eq_left hp] using (hA y hy).1
Β· simpa only [first, dite_eq_left hp] using (hA y hy).2.1
have heasy : βˆ‘ y ∈ E, weight y ≀
(2916 * Real.pi ^ 3 * (R₁ * Rβ‚‚ * R₃) ^ 2) *
((125 / Real.log 2) * Real.log (2 * (Rβ‚‚ * R₃))) := by
calc
βˆ‘ y ∈ E, weight y ≀ βˆ‘ y ∈ E,
(2916 * Real.pi ^ 3 * (R₁ * Rβ‚‚ * R₃) ^ 2) / length y ^ 3 := by
apply Finset.sum_le_sum
intro y hy
obtain ⟨hyY, hye⟩ := Finset.mem_filter.mp hy
have hp := (hY y hyY).1
have hlarge : (data y hp).second ≀ R₃ := by
simpa only [second, dite_eq_left hp] using hye
exact thick_fiber_card_le (F y) y (data y hp) t R₁ Rβ‚‚ R₃ h₂₁ h₃₂
hlarge (hFdet y) (hFcross y) (hFplane y) (hFnorm y)
_ = (2916 * Real.pi ^ 3 * (R₁ * Rβ‚‚ * R₃) ^ 2) *
βˆ‘ y ∈ E, 1 / length y ^ 3 := by
rw [Finset.mul_sum]
apply Finset.sum_congr rfl
intro y hy
ring
_ ≀ _ := mul_le_mul_of_nonneg_left
(LatticeBox.reciprocal_cube_sum_le_log hRprod E (by
intro y hy
have h := hY y (Finset.mem_filter.mp hy).1
exact ⟨h.1.ne_zero, h.2.2.1⟩)) (by positivity)
have hlog2 : 0 < Real.log 2 := Real.log_pos (by norm_num)
have hlogprod : 0 ≀ Real.log (2 * (Rβ‚‚ * R₃)) / Real.log 2 := by
apply div_nonneg _ hlog2.le
exact Real.log_nonneg (by nlinarith)
have hlog3 : 1 ≀ Real.log (2 * R₃) / Real.log 2 := by
apply (le_div_iffβ‚€ hlog2).mpr
simpa using Real.log_le_log (by norm_num : (0 : ℝ) < 2) (by linarith : 2 ≀ 2 * R₃)
have hlogbound : Real.log (2 * (Rβ‚‚ * R₃)) / Real.log 2 ≀
2 * (Real.log (2 * R₁) / Real.log 2) ^ 2 := by
exact (le_mul_of_one_le_left hlogprod hlog3).trans
(dyadic_log_product_le hβ‚‚ h₃ h₂₁ (h₃₂.trans h₂₁))
have heasy' : βˆ‘ y ∈ E, weight y ≀
250 * 2916 * Real.pi ^ 3 * (R₁ * Rβ‚‚ * R₃) ^ 2 *
(Real.log (2 * R₁) / Real.log 2) ^ 2 := by
calc
βˆ‘ y ∈ E, weight y ≀ _ := heasy
_ = (125 * 2916 * Real.pi ^ 3 * (R₁ * Rβ‚‚ * R₃) ^ 2) *
(Real.log (2 * (Rβ‚‚ * R₃)) / Real.log 2) := by ring
_ ≀ (125 * 2916 * Real.pi ^ 3 * (R₁ * Rβ‚‚ * R₃) ^ 2) *
(2 * (Real.log (2 * R₁) / Real.log 2) ^ 2) :=
mul_le_mul_of_nonneg_left hlogbound (by positivity)
_ = _ := by ring
have hcard : (S.card : ℝ) = βˆ‘ y ∈ Y, weight y := by
dsimp only [weight, F]
exact_mod_cast (Finset.card_eq_sum_card_fiberwise
(s := S) (t := Y) (f := normal) (fun x hx => Finset.mem_image_of_mem normal hx))
have hsplit : (βˆ‘ y ∈ E, weight y) + (βˆ‘ y ∈ T, weight y) =
βˆ‘ y ∈ Y, weight y := Finset.sum_filter_add_sum_filter_not Y _ _
rw [hcard, ← hsplit]
calc
_ ≀ _ := add_le_add heasy' hthin
_ = _ := by ring
theorem anisotropic_count_of_planeData
(hplanes : βˆ€ y : IntVector, IsPrimitive y β†’ Nonempty (PlaneData y))
(S : Finset Triple) (t : β„€) (ht : t β‰  0)
(R₁ Rβ‚‚ R₃ : ℝ) (h₃ : 1 ≀ R₃) (h₃₂ : R₃ ≀ Rβ‚‚) (h₂₁ : Rβ‚‚ ≀ R₁)
(hdet : βˆ€ x ∈ S, x.1 ⬝α΅₯ (x.2.1 ⨯₃ x.2.2) = t)
(hnorm : βˆ€ x ∈ S, length x.1 ≀ R₁ ∧
length x.2.1 ≀ Rβ‚‚ ∧ length x.2.2 ≀ R₃) :
(S.card : ℝ) ≀ (35721000 * Real.pi ^ 3 / (Real.log 2) ^ 2) *
(R₁ * Rβ‚‚ * R₃) ^ 2 * Real.log (2 * R₁) ^ 2 := by
classical
have hex : βˆ€ x : Triple, βˆƒ y : IntVector, x ∈ S β†’
IsPrimitive y ∧ (βˆƒ a : β„€, a β‰  0 ∧ x.2.1 ⨯₃ x.2.2 = a β€’ y) ∧
(x.2.1 ⬝α΅₯ y = 0 ∧ x.2.2 ⬝α΅₯ y = 0) ∧ length y ≀ Rβ‚‚ * R₃ := by
intro x
by_cases hx : x ∈ S
Β· have hnz : x.2.1 ⨯₃ x.2.2 β‰  0 := by
intro hc
apply ht
have hd := hdet x hx
simpa [hc] using hd.symm
obtain ⟨a, ha, y, hyp, hfactor, horth₁, horthβ‚‚, hyl, _⟩ :=
CrossNormal.exists_bounded_primitive_cross_factor x.2.1 x.2.2 hnz
refine ⟨y, fun _ => ⟨hyp, ⟨a, ne_of_gt ha, hfactor⟩, ⟨horth₁, horthβ‚‚βŸ©, ?_⟩⟩
exact hyl.trans (mul_le_mul (hnorm x hx).2.1 (hnorm x hx).2.2
(norm_nonneg _) ((norm_nonneg _).trans (hnorm x hx).2.1))
· exact ⟨0, fun h => (hx h).elim⟩
choose normal hnormal using hex
have h := triple_card_le_of_normal_assignment hplanes S normal t ht
R₁ Rβ‚‚ R₃ h₃ h₃₂ h₂₁ hdet (fun x hx => (hnormal x hx).1)
(fun x hx => (hnormal x hx).2.1) (fun x hx => (hnormal x hx).2.2.1)
(fun x hx => (hnormal x hx).2.2.2) hnorm
convert h using 1; simp only [div_pow]; ring
theorem anisotropic_count
(S : Finset Triple) (t : β„€) (ht : t β‰  0)
(R₁ Rβ‚‚ R₃ : ℝ) (h₃ : 1 ≀ R₃) (h₃₂ : R₃ ≀ Rβ‚‚) (h₂₁ : Rβ‚‚ ≀ R₁)
(hdet : βˆ€ x ∈ S, x.1 ⬝α΅₯ (x.2.1 ⨯₃ x.2.2) = t)
(hnorm : βˆ€ x ∈ S, length x.1 ≀ R₁ ∧
length x.2.1 ≀ Rβ‚‚ ∧ length x.2.2 ≀ R₃) :
(S.card : ℝ) ≀ (35721000 * Real.pi ^ 3 / (Real.log 2) ^ 2) *
(R₁ * Rβ‚‚ * R₃) ^ 2 * Real.log (2 * R₁) ^ 2 :=
anisotropic_count_of_planeData exists_planeData S t ht R₁ Rβ‚‚ R₃
h₃ h₃₂ h₂₁ hdet hnorm
theorem anisotropic_constant_pos :
0 < 35721000 * Real.pi ^ 3 / (Real.log 2) ^ 2 := by
have h : 0 < Real.log 2 := Real.log_pos (by norm_num)
positivity
end Problem355.Anisotropic
end
end OAI