math / data /lean /ComparatorChallenges /BallPacking.lean
introvoyz045's picture
Migrated from GitHub
4a56cd6 verified
Raw History Blame Contribute Delete
1.56 kB
import Mathlib
namespace OAI
namespace HigherDimensionalBallPacking
open scoped ContDiff
abbrev Phase (n : β„•) := Fin n β†’ β„‚
noncomputable def capacity {n : β„•} (z : Phase n) : ℝ :=
Real.pi * βˆ‘ j, Complex.normSq (z j)
def closedBall (n : β„•) (r : ℝ) : Set (Phase n) := {z | capacity z ≀ r}
def openBall (n : β„•) (r : ℝ) : Set (Phase n) := {z | capacity z < r}
noncomputable def standardForm {n : β„•} (u v : Phase n) : ℝ :=
βˆ‘ j, ((u j).re * (v j).im - (u j).im * (v j).re)
def SymplecticOn {n : β„•} (U : Set (Phase n)) (f : Phase n β†’ Phase n) : Prop :=
IsOpen U ∧ ContDiffOn ℝ ∞ f U ∧
Topology.IsEmbedding (fun x : U => f x) ∧
βˆ€ x ∈ U, βˆ€ u v : Phase n,
standardForm (fderiv ℝ f x u) (fderiv ℝ f x v) = standardForm u v
def HasPacking (n k : β„•) (R : ℝ) (r : Fin k β†’ ℝ) : Prop :=
βˆƒ (U : Fin k β†’ Set (Phase n)) (f : Fin k β†’ Phase n β†’ Phase n),
(βˆ€ i, closedBall n (r i) βŠ† U i ∧ SymplecticOn (U i) (f i) ∧
Set.MapsTo (f i) (closedBall n (r i)) (openBall n R)) ∧
(βˆ€ i j, i β‰  j β†’
Disjoint (f i '' closedBall n (r i)) (f j '' closedBall n (r j)))
def PackingInequalities (n k : β„•) (R : ℝ) (r : Fin k β†’ ℝ) : Prop :=
(βˆ‘ i, r i ^ n) < R ^ n ∧ βˆ€ i j, i β‰  j β†’ r i + r j < R
theorem main_theorem (n k : β„•) (hn : 3 ≀ n) (hk : 1 ≀ k)
(R : ℝ) (r : Fin k β†’ ℝ) (hR : 0 < R) (hr : βˆ€ i, 0 < r i) :
HasPacking n k R r ↔ PackingInequalities n k R r := by
sorry
end HigherDimensionalBallPacking
end OAI