Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lower-half-plane deformation of the quantile discrepancy

Proved
MomentSearch.rakhmanov_lower_half_plane_deformation

by nmegow · Nov 21, 2026 · Mathlib 0df444a (Lean v4.33.1)

approximation-theoryrakhmanov

Evaluate the two oriented upper triangle sides at w=x−ihw=x-ihw=x−ih, h>0h>0h>0, and write E(x,h)E(x,h)E(x,h) for the imaginary part of the right-side transform divided by π\piπ. Reflection uses −x−ih-x-ih−x−ih on the same side. For the interior quantiles YYY, the cosine phase fff, and xxx off the nodes and support endpoints,

∑y∈Ylog⁡∣w−y∣−∫−11log⁡∣w−t∣ρ(t) dt=E(x,h)+E(−x,h)+1π∫−rrhlog⁡(2∣f(t)∣)(x−t)2+h2 dt.\sum_{y\in Y}\log|w-y|-\int_{-1}^1\log|w-t|\rho(t)\,dt=E(x,h)+E(-x,h)+\frac1\pi\int_{-r}^r\frac{h\log(2|f(t)|)}{(x-t)^2+h^2}\,dt.y∈Y∑​log∣w−y∣−∫−11​log∣w−t∣ρ(t)dt=E(x,h)+E(−x,h)+π1​∫−rr​(x−t)2+h2hlog(2∣f(t)∣)​dt.

The numerator of the right-side transform is interval integrable. All Cauchy denominators are separated from the lower-half-plane pole.

Preamble
import Mathlib
Formal statement
theorem MomentSearch.rakhmanov_lower_half_plane_deformation (N k : ℕ) (hk : 1 ≤ k) (hkN : k < N) :
    let r := Real.sqrt (1 - (k : ℝ) ^ 2 / (N : ℝ) ^ 2)
    let ρ : ℝ → ℝ := fun z => (N : ℝ) / Real.pi * Real.arctan
      ((N : ℝ) / (k : ℝ) * Real.sqrt (r ^ 2 - z ^ 2))
    let f : ℝ → ℝ := fun z => Real.cos (Real.pi * ∫ t in z..1, ρ t)
    let s : ℂ := ⟨1/2, -Real.sqrt 3 / 2⟩
    let Z : ℝ → ℂ := fun t => (r : ℂ) * (1 - s * t)
    let B : ℝ → ℂ := fun t => 2 * Complex.I * (N : ℂ) * r * s *
      ∫ v in (0 : ℝ)..t, Complex.arctan ((N : ℂ) / k *
        (((r : ℂ)^2 - (Z v)^2) ^ (1/2 : ℂ)))
    let E : ℝ → ℝ → ℝ := fun x h => (∫ t in (0 : ℝ)..2,
      Complex.log (1 + Complex.exp (-(B t))) * (-(r : ℂ) * s) /
        ((x : ℂ) - (h : ℂ)*Complex.I - Z t)).im / Real.pi
    let L : ℝ → ℝ → ℝ := fun v h => Real.log ‖(v : ℂ) - (h : ℂ)*Complex.I‖
    let P : ℝ → ℝ → ℝ := fun x h => (∫ t in (-r)..r,
      h / ((x-t)^2+h^2) * Real.log (2*|f t|)) / Real.pi
    IntervalIntegrable (fun t : ℝ => Complex.log (1 + Complex.exp (-(B t))) * (-(r : ℂ) * s))
      MeasureTheory.volume 0 2 ∧
    ∀ Y : Finset ℝ, Y.card = N-k → (∀ y ∈ Y, y ∈ Set.Ioo (-r) r) →
      (∀ z ∈ Set.Icc (-1 : ℝ) 1, z ∈ Y ↔ f z = 0) →
      ∀ z ∈ Set.Icc (-1 : ℝ) 1, z ∉ Y → z ≠ r → z ≠ -r →
        ∀ h : ℝ, 0 < h →
          (∑ y ∈ Y, L (z-y) h) - (∫ t in (-1 : ℝ)..1, L (z-t) h * ρ t) =
            P z h + E z h + E (-z) h := by sorry
Source
Boundary-value decomposition of E. A. Rakhmanov, Bounds for polynomials with a unit discrete norm, §3.1, Th. 2 and (3.6), (3.9)–(3.11), https://annals.math.princeton.edu/2007/165-1/p03

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me