chebyshev_semicircle_slow_mode_limit_two
For random transpositions (cycle length m = 2), the Chebyshev polynomial U_1(x/2) simplifies to x, so the slow-mode limiting profile is the squared modulus of the Fourier transform of the Wigner semicircle distribution on [-2, 2].
Statement
theorem chebyshev_semicircle_slow_mode_limit_two (t : ℝ) : chebyshev_semicircle_slow_mode_limit 2 t = ‖∫ x in (-2 : ℝ)..2, Complex.exp (Complex.I * (t * (x : ℂ))) * ((Real.sqrt (4 - x ^ 2) / (2 * Real.pi) : ℝ) : ℂ)‖ ^ 2
- Source
- arXiv:2609.13387
- Verified
- 11 Nov 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 1
- chebyshev_semicircle_slow_mode_limitThe limiting quantum slow-mode dephasing profile for cycle length m at rescaled time t, defined as the squared modulus of the integral of…
Read back from the Lean
For every real number $t$, chebyshev_semicircle_slow_mode_limit 2 t equals the squared complex norm of the interval integral from $-2$ to $2$ of $\exp(i t x) \cdot \frac{\sqrt{4 - x^2}}{2\pi}$ with respect to $x$.
Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.
The proof, explained
The slow-mode limit profile for cycle length m = 2 is defined by an interval integral containing the Chebyshev polynomial U_{2-1}(x/2) = U₁(x/2) in the exponent. The proof strips the outer squared modulus and reduces equality of the integrals to pointwise equality of their integrands on [-2, 2]. It then applies the Chebyshev identity U₁ = 2X and evaluates 2X at x/2 to obtain x, matching the Fourier transform of the semicircle law.
It suffices to show that the integrands of the two profiles agree pointwise on the interval [-2, 2].
Unfolding the definition of `chebyshev_semicircle_slow_mode_limit` with cycle length m = 2 gives the squared modulus of an integral involving the Chebyshev polynomial U_{2-1} = U₁. Peeling off the outer squared modulus with `congr 2` leaves an equality of two interval integrals over [-2, 2]. Applying `intervalIntegral.integral_congr` reduces this equality to showing that the integrands coincide pointwise on the interval [-2, 2].
uses
intervalIntegral.integral_congrunfold chebyshev_semicircle_slow_mode_limit congr 2 apply intervalIntegral.integral_congr
For each x ∈ [-2, 2], the polynomial term U_{2-1}(x/2) in the integrand reduces to evaluating 2X at x/2.
Fix x ∈ [-2, 2]. The Chebyshev degree simplifies to 2 - 1 = 1. Rewriting with `Polynomial.Chebyshev.U_one` replaces U₁ with the polynomial 2X, so the polynomial factor in the exponent becomes the evaluation of 2X at x/2.
uses
Polynomial.Chebyshev.U_oneintro x _ dsimp rw [Polynomial.Chebyshev.U_one]
Evaluating 2X at x/2 yields x, which makes the two integrands identical and concludes the proof.
Evaluating the polynomial 2X at x/2 gives 2 * (x / 2) = x by elementary polynomial evaluation and ring arithmetic (`simp; ring`). Rewriting this value into the integrand makes both sides identical, closing the goal.
have h : Polynomial.eval (x / 2) (2 * Polynomial.X : Polynomial ℝ) = x := by simp; ring rw [h]
intervalIntegral.integral_congr- If two functions agree on the interval between a and b, their interval integrals from a to b are equal.
Polynomial.Chebyshev.U_one- The first Chebyshev polynomial of the second kind, U₁, is equal to 2X.
Written by a model (gemini-3.8-flash) from the Lean proof and the goal states Lean reported at each step. Lean verified the proof; this explanation is a reading aid and is not itself machine-checked.
Lean source view module on GitHub
Choose a tactic — a marked line — to see the goals Lean had before and after it, as in Lean’s infoview. Step with ← → or j k.
/-- For m = 2, the Chebyshev-semicircle limit reduces to the squared modulus of the semicircle Fourier transform. -/theorem chebyshev_semicircle_slow_mode_limit_two (t : ℝ) : chebyshev_semicircle_slow_mode_limit 2 t = ‖∫ x in (-2 : ℝ)..2, Complex.exp (Complex.I * (t * (x : ℂ))) * ((Real.sqrt (4 - x ^ 2) / (2 * Real.pi) : ℝ) : ℂ)‖ ^ 2 := by unfold chebyshev_semicircle_slow_mode_limit congr 2 apply intervalIntegral.integral_congr intro x _ dsimp rw [Polynomial.Chebyshev.U_one] have h : Polynomial.eval (x / 2) (2 * Polynomial.X : Polynomial ℝ) = x := by simp; ring rw [h]