File size: 1,556 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 | 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
|