math / data /lean /ComparatorChallenges /SubpolynomialLp.lean
introvoyz045's picture
Migrated from GitHub
4a56cd6 verified
Raw History Blame Contribute Delete
1.91 kB
import Mathlib
namespace OAI
noncomputable section
open MeasureTheory Filter
open scoped BigOperators Topology
universe u
namespace SubpolynomialLp
def coordinateDistance (p : ℝ) {d : β„•} (x y : Fin d β†’ ℝ) : ℝ :=
(βˆ‘ a, |x a - y a| ^ p) ^ (1 / p)
/-- The universal property used in the definition of d_p(n,D). -/
def GoodDimension (p : ℝ) (n : β„•) (D : ℝ) (d : β„•) : Prop :=
βˆ€ (Ξ© : Type u) (mΞ© : MeasurableSpace Ξ©) (ΞΌ : @Measure Ξ© mΞ©)
(x : Fin n β†’ @Lp Ξ© ℝ mΞ© _ (ENNReal.ofReal p) ΞΌ),
Function.Injective x β†’
βˆƒ (y : Fin n β†’ Fin d β†’ ℝ) (s : ℝ), 0 < s ∧
βˆ€ i j, s * β€–x i - x jβ€– ≀ coordinateDistance p (y i) (y j) ∧
coordinateDistance p (y i) (y j) ≀ D * s * β€–x i - x jβ€–
/-- The least universal coordinate dimension. The theorem also asserts that
this least dimension has the defining property, ruling out an empty infimum. -/
def dimension (p : ℝ) (n : β„•) (D : ℝ) : β„• :=
sInf {d : β„• | GoodDimension.{u} p n D d}
def gamma (p : ℝ) : ℝ := if p < 2 then 2 - p else 1 - 2 / p
/-- The universal coordinate dimension bounds and their logarithmic limits. -/
theorem source_main (p : ℝ) (hp : 1 < p) (hp2 : p β‰  2) :
(βˆ€ D : ℝ, 1 < D β†’ βˆƒ C : ℝ, βˆ€ n : β„•, 2 ≀ n β†’
GoodDimension.{u} p n D (dimension.{u} p n D) ∧
Real.log (n : ℝ) / Real.log (1 + 2 * D) ≀ (dimension.{u} p n D : ℝ) ∧
(dimension.{u} p n D : ℝ) ≀ Real.exp (C * Real.log (n : ℝ) ^ gamma p)) ∧
(βˆ€ n : β„•, 9 ≀ n β†’
GoodDimension.{u} p n 1 (dimension.{u} p n 1) ∧
((n - 1) / 4) ^ 2 ≀ dimension.{u} p n 1 ∧
dimension.{u} p n 1 ≀ n.choose 2) ∧
(βˆ€ D : ℝ, 1 ≀ D β†’
Tendsto (fun n : β„• => Real.log (dimension.{u} p n D : ℝ) / Real.log (n : ℝ))
atTop (𝓝 (if 1 < D then 0 else 2))) := by
sorry
end SubpolynomialLp
end
end OAI