File size: 1,428 Bytes
4a56cd6 | 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 | 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
|