introvoyz045's picture
Migrated from GitHub
4a56cd6 verified
Raw History Blame Contribute Delete
1.57 kB
import Mathlib
namespace OAI
noncomputable section
open Filter
open scoped Topology
namespace WeakPinned
abbrev Plane := EuclideanSpace ℝ (Fin 2)
def distanceFiber (P : Finset Plane) (x y : Plane) : Finset Plane :=
(P.erase x).filter (fun z => dist z x = dist y x)
def k (P : Finset Plane) (x y : Plane) : β„• :=
(distanceFiber P x y).card
def richPairs (P : Finset Plane) (s : ℝ) : Finset (Plane Γ— Plane) :=
(P Γ—Λ’ P).filter (fun xy => xy.1 β‰  xy.2 ∧
(P.card : ℝ) ^ s ≀ (k P xy.1 xy.2 : ℝ))
def pairFraction (P : Finset Plane) (s : ℝ) : ℝ :=
(richPairs P s).card / ((P.card : ℝ) * ((P.card : ℝ) - 1))
def F (n : β„•) (s : ℝ) : ℝ :=
if 2 ≀ n then sSup {a : ℝ | βˆƒ P : Finset Plane, P.card = n ∧ a = pairFraction P s}
else 0
def distances (P : Finset Plane) (x : Plane) : Finset ℝ :=
(P.erase x).image (fun y => dist y x)
def badPins (P : Finset Plane) (Ξ΅ : ℝ) : Finset Plane :=
P.filter (fun x => ((distances P x).card : ℝ) < (P.card : ℝ) ^ (1 - Ξ΅))
def badPinFraction (P : Finset Plane) (Ξ΅ : ℝ) : ℝ :=
(badPins P Ξ΅).card / (P.card : ℝ)
def B (n : β„•) (Ξ΅ : ℝ) : ℝ :=
if 0 < n then sSup {a : ℝ | βˆƒ P : Finset Plane, P.card = n ∧ a = badPinFraction P Ξ΅}
else 0
/- Uniform multiplicity and pinned-distance convergence statements. -/
def MainStatement : Prop :=
βˆ€ s : ℝ, 0 < s β†’ Tendsto (fun n : β„• => F n s) atTop (nhds 0)
def PinsStatement : Prop :=
βˆ€ Ξ΅ : ℝ, 0 < Ξ΅ β†’ Tendsto (fun n : β„• => B n Ξ΅) atTop (nhds 0)
end WeakPinned
end
end OAI