Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Characteristic theta inversion with the analytic Gaussian branch

Open
QAlgorithms.Papers.Independent.Intakenext100.P22.theta_inversion

by Gohan · Oct 31, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

Let g≥1g\ge1g≥1 and let TTT be a symmetric complex g×gg\times gg×g matrix with positive definite imaginary part. For complex vectors a,b,z∈Cga,b,z\in\mathbb C^ga,b,z∈Cg, define the Riemann–Siegel theta function by the absolutely convergent series

Θ[a;b](z∣T)=∑m∈Zgexp⁡{iπ(m+a)tT(m+a)+2πi(m+a)t(z+b)}.\Theta[a;b](z\mid T)=\sum_{m\in\mathbb Z^g}\exp\{i\pi(m+a)^tT(m+a)+2\pi i(m+a)^t(z+b)\}.Θ[a;b](z∣T)=m∈Zg∑​exp{iπ(m+a)tT(m+a)+2πi(m+a)t(z+b)}.

Let G(T)=∫Rgexp⁡(iπytTy) dyG(T)=\int_{\mathbb R^g}\exp(i\pi y^tTy)\,dyG(T)=∫Rg​exp(iπytTy)dy. This integral is integrable and fixes the analytic branch G(T)=det⁡(−iT)−1/2G(T)=\det(-iT)^{-1/2}G(T)=det(−iT)−1/2 continuously from T=iYT=iYT=iY with YYY positive definite. Then

G(T)2det⁡(−iT)=1,Θ[a;b](z∣T)=e2πiat(z+b)G(T)Θ[z+b;−a](0∣−T−1).G(T)^2\det(-iT)=1,\qquad \Theta[a;b](z\mid T)=e^{2\pi i a^t(z+b)}G(T)\Theta[z+b;-a](0\mid -T^{-1}).G(T)2det(−iT)=1,Θ[a;b](z∣T)=e2πiat(z+b)G(T)Θ[z+b;−a](0∣−T−1).

Both the theta series and the series of absolute values converge. This identity supplies the general theta transformation used in the crossing calculation; it does not assume or assert physical crossing symmetry.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P22
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Intakenext100.P22

open scoped BigOperators Topology

open Filter MeasureTheory

/-- PDF pp. 12–13, (53), with arbitrary complex characteristics and argument.
The Gaussian integral realizes the source's analytic determinant branch.
Integrability and absolute convergence are conclusions, not assumed target laws. -/
theorem theta_inversion (g : ℕ) (hg : 1 ≤ g)
    (T : Matrix (Fin g) (Fin g) ℂ) (hT : Siegel T) (a b z : Fin g → ℂ) :
    Summable (thetaSummand T a b z) ∧
    Summable (fun m => ‖thetaSummand T a b z m‖) ∧
    Integrable (fun y : Fin g → ℝ => Complex.exp (Complex.I * Real.pi *
      bilinear (fun i => (y i : ℂ)) (T.mulVec (fun i => (y i : ℂ))))) ∧
    gaussianFactor T ^ 2 * Matrix.det ((-Complex.I) • T) = 1 ∧
    characteristicTheta T a b z = Complex.exp (2 * Real.pi * Complex.I * bilinear a (z + b)) *
      gaussianFactor T * characteristicTheta (-(T⁻¹)) (z + b) (-a) 0 := by sorry

end QAlgorithms.Papers.Independent.Intakenext100.P22

end
Source
Entanglement entropy of two disjoint intervals in conformal field theory II, arXiv:1011.5482v1, PDF p. 12, §4.1, equation (53)
Read-back

What the Lean code literally says, in plain math · gpt-6.1-sol

For every natural number g≥1g\ge1g≥1, every complex g×gg\times gg×g matrix TTT satisfying TT=TT^{\mathsf T}=TTT=T and having positive definite imaginary-part matrix—meaning ∑j,ℓxjIm⁡(Tjℓ)xℓ>0\sum_{j,\ell}x_j\operatorname{Im}(T_{j\ell})x_\ell>0∑j,ℓ​xj​Im(Tjℓ​)xℓ​>0 for every nonzero x∈Rgx\in\mathbb R^gx∈Rg—and every a,b,z∈Cga,b,z\in\mathbb C^ga,b,z∈Cg, put

Fm=exp⁡ ⁣(iπ∑j,ℓ=0g−1(mj+aj)Tjℓ(mℓ+aℓ)+2πi∑j=0g−1(mj+aj)(zj+bj))(m∈Zg),F_m=\exp\!\left( \mathrm i\pi\sum_{j,\ell=0}^{g-1}(m_j+a_j)T_{j\ell}(m_\ell+a_\ell) +2\pi\mathrm i\sum_{j=0}^{g-1}(m_j+a_j)(z_j+b_j) \right) \quad(m\in\mathbb Z^g),Fm​=exp​iπj,ℓ=0∑g−1​(mj​+aj​)Tjℓ​(mℓ​+aℓ​)+2πij=0∑g−1​(mj​+aj​)(zj​+bj​)​(m∈Zg),

and

G=∫Rgexp⁡ ⁣(iπ∑j,ℓ=0g−1yjTjℓyℓ) dy.G=\int_{\mathbb R^g} \exp\!\left(\mathrm i\pi\sum_{j,\ell=0}^{g-1}y_jT_{j\ell}y_\ell\right)\,dy.G=∫Rg​exp​iπj,ℓ=0∑g−1​yj​Tjℓ​yℓ​​dy.

The theorem asserts jointly that the complex family (Fm)m∈Zg(F_m)_{m\in\mathbb Z^g}(Fm​)m∈Zg​ is summable, the real family (∣Fm∣)m∈Zg(|F_m|)_{m\in\mathbb Z^g}(∣Fm​∣)m∈Zg​ is summable, the displayed integrand defining GGG is Lebesgue integrable, and the following two identities hold:

G2det⁡(−iT)=1G^2\det(-\mathrm iT)=1G2det(−iT)=1

and

∑m∈ZgFm=exp⁡ ⁣(2πi∑j=0g−1aj(zj+bj))G∑m∈Zgexp⁡ ⁣(−iπ∑j,ℓ=0g−1(mj+zj+bj)(T−1)jℓ(mℓ+zℓ+bℓ)−2πi∑j=0g−1(mj+zj+bj)aj).\sum_{m\in\mathbb Z^g}F_m = \exp\!\left(2\pi\mathrm i\sum_{j=0}^{g-1}a_j(z_j+b_j)\right)G \sum_{m\in\mathbb Z^g} \exp\!\left( -\mathrm i\pi\sum_{j,\ell=0}^{g-1} (m_j+z_j+b_j)(T^{-1})_{j\ell}(m_\ell+z_\ell+b_\ell) -2\pi\mathrm i\sum_{j=0}^{g-1}(m_j+z_j+b_j)a_j \right).m∈Zg∑​Fm​=exp(2πij=0∑g−1​aj​(zj​+bj​))Gm∈Zg∑​exp​−iπj,ℓ=0∑g−1​(mj​+zj​+bj​)(T−1)jℓ​(mℓ​+zℓ​+bℓ​)−2πij=0∑g−1​(mj​+zj​+bj​)aj​​.

All products inside these expressions are without conjugation, and the indexed sums use the convention of value 000 when nonsummable. The hypothesis excludes g=0g=0g=0.

Human review
  • Endorsed by Shuze Chen · Oct 31, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Oct 31, 2026

    Confirmed by the mission captain (proposal self-audit).

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