math / data /lean /OAI /Geometry /HeilbronnTriangle /Definitions.lean
introvoyz045's picture
Migrated from GitHub
4a56cd6 verified
Raw History Blame Contribute Delete
1.43 kB
import Mathlib
namespace OAI
noncomputable section
namespace Problem355
abbrev Point := ℝ Γ— ℝ
def triangleArea (p q r : Point) : ℝ :=
abs ((q.1 - p.1) * (r.2 - p.2) - (q.2 - p.2) * (r.1 - p.1)) / 2
def pointInUnitSquare (p : Point) : Prop :=
0 ≀ p.1 ∧ p.1 ≀ 1 ∧ 0 ≀ p.2 ∧ p.2 ≀ 1
def pointsInUnitSquare (P : Finset Point) : Prop := by
classical
exact βˆ€ p, p ∈ P β†’ pointInUnitSquare p
def triangleAreasAtLeast (P : Finset Point) (a : ℝ) : Prop := by
classical
exact βˆ€ p, p ∈ P β†’ βˆ€ q, q ∈ P β†’ βˆ€ r, r ∈ P β†’
p β‰  q β†’ p β‰  r β†’ q β‰  r β†’ a ≀ triangleArea p q r
def hasTriangleAreaAtMost (P : Finset Point) (a : ℝ) : Prop := by
classical
exact βˆƒ p, p ∈ P ∧ βˆƒ q, q ∈ P ∧ βˆƒ r, r ∈ P ∧
p β‰  q ∧ p β‰  r ∧ q β‰  r ∧ triangleArea p q r ≀ a
def heilbronnD : β„• := 41
def heilbronnM : β„• := Nat.choose (4 * heilbronnD - 1) heilbronnD
def heilbronnT : β„• := Nat.choose heilbronnM 3
@[irreducible] def heilbronnK : β„• := heilbronnT ^ 2 + 1
def heilbronnExponent : ℝ :=
1 / (100000 * (heilbronnK : ℝ))
def eventualAlmostUpperBound (epsilon : ℝ) : Prop :=
βˆƒ C : ℝ, 0 < C ∧ βˆƒ n0 : β„•, βˆ€ n : β„•, n0 ≀ n β†’ 3 ≀ n β†’
βˆ€ P : Finset Point, P.card = n β†’ pointsInUnitSquare P β†’
hasTriangleAreaAtMost P
(C * Real.rpow (n : ℝ) (-2 + epsilon))
end Problem355
end
end OAI