Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theta lattice minima, domain-wall sectors, and amplitudes

Open
QAlgorithms.Papers.Independent.Intakenext100.P22.lattice_sectors

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

prove2quantum

Fix n≥2n\ge2n≥2. For v∈Rn−1v\in\mathbb R^{n-1}v∈Rn−1 set v0=vn=0v_0=v_n=0v0​=vn​=0, Crs(k)=cos⁡(2πk(r−s)/n)C^{(k)}_{rs}=\cos(2\pi k(r-s)/n)Crs(k)​=cos(2πk(r−s)/n), and fy=2γE+ψ(y)+ψ(1−y)f_y=2\gamma_E+\psi(y)+\psi(1-y)fy​=2γE​+ψ(y)+ψ(1−y), where ψ\psiψ is the digamma function. Define

a(v)=2n∑k=1n−1sin⁡2(πk/n) vtC(k)v,b(v)=2n∑k=1n−1sin⁡2(πk/n)fk/n vtC(k)v.a(v)=\frac2n\sum_{k=1}^{n-1}\sin^2(\pi k/n)\,v^tC^{(k)}v,\quad b(v)=\frac2n\sum_{k=1}^{n-1}\sin^2(\pi k/n)f_{k/n}\,v^tC^{(k)}v.a(v)=n2​k=1∑n−1​sin2(πk/n)vtC(k)v,b(v)=n2​k=1∑n−1​sin2(πk/n)fk/n​vtC(k)v.

Then for every real vector,

a(v)=12∑j=0n−1(vj+1−vj)2.a(v)=\frac12\sum_{j=0}^{n-1}(v_{j+1}-v_j)^2.a(v)=21​j=0∑n−1​(vj+1​−vj​)2.

For 0≤a<b≤n−10\le a<b\le n-10≤a<b≤n−1 and s∈{−1,1}s\in\{-1,1\}s∈{−1,1} let Ba,b,sB_{a,b,s}Ba,b,s​ equal sss on a<j≤ba<j\le ba<j≤b and zero elsewhere. Every nonzero integer vector has a(v)≥1a(v)\ge1a(v)≥1, with equality exactly for these blocks; moreover,

b(Ba,b,s)=−2log⁡[2nsin⁡(π(b−a)/n)],Ba,b,stC(k)Ba,b,s=sin⁡2(πk(b−a)/n)sin⁡2(πk/n)(1≤k<n).b(B_{a,b,s})=-2\log[2n\sin(\pi(b-a)/n)],\qquad B_{a,b,s}^tC^{(k)}B_{a,b,s}=\frac{\sin^2(\pi k(b-a)/n)}{\sin^2(\pi k/n)}\quad(1\le k<n).b(Ba,b,s​)=−2log[2nsin(π(b−a)/n)],Ba,b,st​C(k)Ba,b,s​=sin2(πk/n)sin2(πk(b−a)/n)​(1≤k<n).

Over v=m+εv=m+\varepsilonv=m+ε, with m∈Zn−1m\in\mathbb Z^{n-1}m∈Zn−1 and nonzero ε∈{0,1/2}n−1\varepsilon\in\{0,1/2\}^{n-1}ε∈{0,1/2}n−1, the minimum is 1/41/41/4. Equality holds exactly when v=Ba,b,s/2v=B_{a,b,s}/2v=Ba,b,s​/2, and b(Ba,b,s/2)=b(Ba,b,s)/4b(B_{a,b,s}/2)=b(B_{a,b,s})/4b(Ba,b,s​/2)=b(Ba,b,s​)/4.

The integer vectors with a(v)=2a(v)=2a(v)=2 are exactly the following patterns, for 0≤a<b<c<d≤n−10\le a<b<c<d\le n-10≤a<b<c<d≤n−1 and s=±1s=\pm1s=±1:

M0=Ba,b,s+Bc,d,s,M1=Ba,b,s−Bc,d,s,M2=Ba,d,s+Bb,c,s.M_0=B_{a,b,s}+B_{c,d,s},\quad M_1=B_{a,b,s}-B_{c,d,s},\quad M_2=B_{a,d,s}+B_{b,c,s}.M0​=Ba,b,s​+Bc,d,s​,M1​=Ba,b,s​−Bc,d,s​,M2​=Ba,d,s​+Bb,c,s​.

Write suv=sin⁡(π(v−u)/n)s_{uv}=\sin(\pi(v-u)/n)suv​=sin(π(v−u)/n) and

Q0=sbdsacsabscdsadsbc,Q1=sadsbcsabscdsbdsac,Q2=sabscdsbdsacsadsbc.Q_0=\frac{s_{bd}s_{ac}}{s_{ab}s_{cd}s_{ad}s_{bc}},\quad Q_1=\frac{s_{ad}s_{bc}}{s_{ab}s_{cd}s_{bd}s_{ac}},\quad Q_2=\frac{s_{ab}s_{cd}}{s_{bd}s_{ac}s_{ad}s_{bc}}.Q0​=sab​scd​sad​sbc​sbd​sac​​,Q1​=sab​scd​sbd​sac​sad​sbc​​,Q2​=sbd​sac​sad​sbc​sab​scd​​.

Their amplitudes are

b(Mr)=log⁡ ⁣[(Qr4n2)2],r=0,1,2.b(M_r)=\log\!\left[\left(\frac{Q_r}{4n^2}\right)^2\right],\qquad r=0,1,2.b(Mr​)=log[(4n2Qr​​)2],r=0,1,2.

These second-sector patterns require n≥4n\ge4n≥4. For n=2n=2n=2 and n=3n=3n=3, the smallest energy strictly above 111 is respectively 444 and 333, and each value is attained. These classifications determine the first theta-lattice contributions independently of any physical moment formula.

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. 14–18, (59)–(66),(75)–(77),(85),(90): Fourier/chain identity,
all integer and half-characteristic minimizers, second-sector patterns and
amplitudes. Both signs and exceptional n=2,3 next energies are retained.
In (90) the logarithm is of the square, not the square of the logarithm. -/
theorem lattice_sectors (n : ℕ) (hn : 2 ≤ n) :
    (∀ v : Fin (n - 1) → ℝ, exponentA n v = chainEnergy n v) ∧
    (∀ m : Fin (n - 1) → ℤ, m ≠ 0 →
      1 ≤ exponentA n (fun i => (m i : ℝ)) ∧
      (exponentA n (fun i => (m i : ℝ)) = 1 ↔
        ∃ a b : ℕ, ∃ s : ℝ, a < b ∧ b ≤ n - 1 ∧ (s = 1 ∨ s = -1) ∧
          (fun i => (m i : ℝ)) = intervalBlock n a b s)) ∧
    (∀ a b : ℕ, ∀ s : ℝ, a < b → b ≤ n - 1 → (s = 1 ∨ s = -1) →
      exponentA n (intervalBlock n a b s) = 1 ∧
      exponentB n (intervalBlock n a b s) = -2 * Real.log (2 * n * sheetSine n a b)) ∧
    (∀ a b k : ℕ, ∀ s : ℝ, a < b → b ≤ n - 1 →
      1 ≤ k → k < n → (s = 1 ∨ s = -1) →
      cosineQuadratic n k (intervalBlock n a b s) =
        (Real.sin (Real.pi * (k : ℝ) / n * ((b : ℝ) - a)) /
          Real.sin (Real.pi * (k : ℝ) / n)) ^ 2) ∧
    (∀ e : Fin (n - 1) → Bool, ∀ m : Fin (n - 1) → ℤ,
      e ≠ (fun _ => false) →
      1 / 4 ≤ exponentA n (halfShift n e m) ∧
      (exponentA n (halfShift n e m) = 1 / 4 ↔
        ∃ a b : ℕ, ∃ s : ℝ, a < b ∧ b ≤ n - 1 ∧ (s = 1 ∨ s = -1) ∧
          halfShift n e m = intervalBlock n a b (s / 2))) ∧
    (∀ a b : ℕ, ∀ s : ℝ, a < b → b ≤ n - 1 → (s = 1 ∨ s = -1) →
      exponentA n (intervalBlock n a b (s / 2)) = 1 / 4 ∧
      exponentB n (intervalBlock n a b (s / 2)) = exponentB n (intervalBlock n a b s) / 4) ∧
    (∀ m : Fin (n - 1) → ℤ,
      exponentA n (fun i => (m i : ℝ)) = 2 ↔
        ∃ a b c d : ℕ, ∃ s : ℝ, ∃ r : Fin 3,
          a < b ∧ b < c ∧ c < d ∧ d ≤ n - 1 ∧ (s = 1 ∨ s = -1) ∧
          (fun i => (m i : ℝ)) = secondPattern n a b c d s r) ∧
    (∀ a b c d : ℕ, ∀ s : ℝ, ∀ r : Fin 3,
      a < b → b < c → c < d → d ≤ n - 1 → (s = 1 ∨ s = -1) →
      exponentB n (secondPattern n a b c d s r) =
        Real.log ((qFactor n a b c d r / (4 * (n : ℝ) ^ 2)) ^ 2)) ∧
    (n = 2 →
      (∀ m : Fin (n - 1) → ℤ, 1 < exponentA n (fun i => (m i : ℝ)) →
        4 ≤ exponentA n (fun i => (m i : ℝ))) ∧
      ∃ m : Fin (n - 1) → ℤ, exponentA n (fun i => (m i : ℝ)) = 4) ∧
    (n = 3 →
      (∀ m : Fin (n - 1) → ℤ, 1 < exponentA n (fun i => (m i : ℝ)) →
        3 ≤ exponentA n (fun i => (m i : ℝ))) ∧
      ∃ m : Fin (n - 1) → ℤ, exponentA n (fun i => (m i : ℝ)) = 3) := 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. 14, §5.1, §5.3, §5.4, equations (59)–(66), (75)–(77), (85), (90)
Read-back

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

For every natural number nnn satisfying n≥2n\ge2n≥2, let I={0,…,n−2}I=\{0,\ldots,n-2\}I={0,…,n−2}. For real vectors vvv on III, use the following explicit abbreviations:

Qk(v)=∑i∈I∑j∈Ivicos⁡ ⁣(2πkn(i−j))vj,D(y)=2γ+Re⁡ψ(y)+Re⁡ψ(1−y),A(v)=2n∑k=1n−1sin⁡2 ⁣(πkn)Qk(v),B(v)=2n∑k=1n−1sin⁡2 ⁣(πkn)D(k/n)Qk(v),xj(v)={vj−1,1≤j<n,0,otherwise,E(v)=12∑j=0n−1(xj+1(v)−xj(v))2,(Xabh)i={h,a<i+1≤b,0,otherwise,H(e,m)i={mi+12,ei=true,mi,ei=false,Pabcds,r={Xabs+Xcds,r=0,Xabs−Xcds,r=1,Xads+Xbcs,r=2,Suv=sin⁡ ⁣(π(v−u)n),qabcdr={SbdSacSabScdSadSbc,r=0,SadSbcSabScdSbdSac,r=1,SabScdSbdSacSadSbc,r=2.\begin{gathered} Q_k(v)=\sum_{i\in I}\sum_{j\in I} v_i\cos\!\left(\frac{2\pi k}{n}(i-j)\right)v_j,\qquad D(y)=2\gamma+\operatorname{Re}\psi(y)+\operatorname{Re}\psi(1-y),\\ A(v)=\frac2n\sum_{k=1}^{n-1}\sin^2\!\left(\frac{\pi k}{n}\right)Q_k(v),\qquad B(v)=\frac2n\sum_{k=1}^{n-1}\sin^2\!\left(\frac{\pi k}{n}\right)D(k/n)Q_k(v),\\ x_j(v)= \begin{cases}v_{j-1},&1\le j<n,\\0,&\text{otherwise},\end{cases} \qquad E(v)=\frac12\sum_{j=0}^{n-1}\bigl(x_{j+1}(v)-x_j(v)\bigr)^2,\\ (X_{ab}^{h})_i= \begin{cases}h,&a<i+1\le b,\\0,&\text{otherwise},\end{cases} \qquad H(e,m)_i= \begin{cases}m_i+\frac12,&e_i=\mathrm{true},\\m_i,&e_i=\mathrm{false},\end{cases}\\ P_{abcd}^{s,r}= \begin{cases} X_{ab}^{s}+X_{cd}^{s},&r=0,\\ X_{ab}^{s}-X_{cd}^{s},&r=1,\\ X_{ad}^{s}+X_{bc}^{s},&r=2, \end{cases} \qquad S_{uv}=\sin\!\left(\frac{\pi(v-u)}n\right),\\ q_{abcd}^{r}= \begin{cases} \dfrac{S_{bd}S_{ac}}{S_{ab}S_{cd}S_{ad}S_{bc}},&r=0,\\[5pt] \dfrac{S_{ad}S_{bc}}{S_{ab}S_{cd}S_{bd}S_{ac}},&r=1,\\[5pt] \dfrac{S_{ab}S_{cd}}{S_{bd}S_{ac}S_{ad}S_{bc}},&r=2. \end{cases} \end{gathered}Qk​(v)=i∈I∑​j∈I∑​vi​cos(n2πk​(i−j))vj​,D(y)=2γ+Reψ(y)+Reψ(1−y),A(v)=n2​k=1∑n−1​sin2(nπk​)Qk​(v),B(v)=n2​k=1∑n−1​sin2(nπk​)D(k/n)Qk​(v),xj​(v)={vj−1​,0,​1≤j<n,otherwise,​E(v)=21​j=0∑n−1​(xj+1​(v)−xj​(v))2,(Xabh​)i​={h,0,​a<i+1≤b,otherwise,​H(e,m)i​={mi​+21​,mi​,​ei​=true,ei​=false,​Pabcds,r​=⎩⎨⎧​Xabs​+Xcds​,Xabs​−Xcds​,Xads​+Xbcs​,​r=0,r=1,r=2,​Suv​=sin(nπ(v−u)​),qabcdr​=⎩⎨⎧​Sab​Scd​Sad​Sbc​Sbd​Sac​​,Sab​Scd​Sbd​Sac​Sad​Sbc​​,Sbd​Sac​Sad​Sbc​Sab​Scd​​,​r=0,r=1,r=2.​​

Here γ\gammaγ is the Euler–Mascheroni constant, ψ\psiψ is the complex digamma function evaluated at complex embeddings of real arguments, e:I→{false,true}e:I\to\{\mathrm{false},\mathrm{true}\}e:I→{false,true}, m:I→Zm:I\to\mathbb Zm:I→Z, r∈{0,1,2}r\in\{0,1,2\}r∈{0,1,2}, and integer vector coordinates are embedded in R\mathbb RR wherever needed. Differences in trigonometric arguments are real differences. The theorem asserts the conjunction of all the following statements. Every real vector vvv on III satisfies A(v)=E(v)A(v)=E(v)A(v)=E(v). Every integer vector mmm on III that is not the zero vector satisfies A(m)≥1A(m)\ge1A(m)≥1, and for each such vector,

A(m)=1  ⟺  ∃a,b∈N ∃s∈R:a<b,b≤n−1,s∈{1,−1},m=Xabs.A(m)=1 \iff \exists a,b\in\mathbb N\ \exists s\in\mathbb R: \quad a<b,\quad b\le n-1,\quad s\in\{1,-1\},\quad m=X_{ab}^{s}.A(m)=1⟺∃a,b∈N ∃s∈R:a<b,b≤n−1,s∈{1,−1},m=Xabs​.

For every a,b∈Na,b\in\mathbb Na,b∈N and s∈Rs\in\mathbb Rs∈R satisfying a<ba<ba<b, b≤n−1b\le n-1b≤n−1, and s∈{1,−1}s\in\{1,-1\}s∈{1,−1}, both

A(Xabs)=1,B(Xabs)=−2log⁡(2nSab)A(X_{ab}^{s})=1,\qquad B(X_{ab}^{s})=-2\log(2nS_{ab})A(Xabs​)=1,B(Xabs​)=−2log(2nSab​)

hold. For every a,b,k∈Na,b,k\in\mathbb Na,b,k∈N and s∈Rs\in\mathbb Rs∈R satisfying a<ba<ba<b, b≤n−1b\le n-1b≤n−1, 1≤k<n1\le k<n1≤k<n, and s∈{1,−1}s\in\{1,-1\}s∈{1,−1},

Qk(Xabs)=(sin⁡ ⁣(πkn(b−a))sin⁡(πk/n))2.Q_k(X_{ab}^{s}) = \left( \frac{\sin\!\left(\frac{\pi k}{n}(b-a)\right)} {\sin(\pi k/n)} \right)^2.Qk​(Xabs​)=(sin(πk/n)sin(nπk​(b−a))​)2.

For every Boolean vector eee on III and integer vector mmm on III, if eee is not identically false, then A(H(e,m))≥14A(H(e,m))\ge\frac14A(H(e,m))≥41​, and

A(H(e,m))=14  ⟺  ∃a,b∈N ∃s∈R:a<b,b≤n−1,s∈{1,−1},H(e,m)=Xabs/2.A(H(e,m))=\frac14 \iff \exists a,b\in\mathbb N\ \exists s\in\mathbb R: \quad a<b,\quad b\le n-1,\quad s\in\{1,-1\},\quad H(e,m)=X_{ab}^{s/2}.A(H(e,m))=41​⟺∃a,b∈N ∃s∈R:a<b,b≤n−1,s∈{1,−1},H(e,m)=Xabs/2​.

For every a,b∈Na,b\in\mathbb Na,b∈N and s∈Rs\in\mathbb Rs∈R satisfying a<ba<ba<b, b≤n−1b\le n-1b≤n−1, and s∈{1,−1}s\in\{1,-1\}s∈{1,−1},

A(Xabs/2)=14,B(Xabs/2)=B(Xabs)4.A(X_{ab}^{s/2})=\frac14,\qquad B(X_{ab}^{s/2})=\frac{B(X_{ab}^{s})}{4}.A(Xabs/2​)=41​,B(Xabs/2​)=4B(Xabs​)​.

For every integer vector mmm on III, including the zero vector,

A(m)=2  ⟺  ∃a,b,c,d∈N ∃s∈R ∃r∈{0,1,2}:a<b<c<d≤n−1,s∈{1,−1},m=Pabcds,r.A(m)=2 \iff \exists a,b,c,d\in\mathbb N\ \exists s\in\mathbb R\ \exists r\in\{0,1,2\}: \quad a<b<c<d\le n-1,\quad s\in\{1,-1\},\quad m=P_{abcd}^{s,r}.A(m)=2⟺∃a,b,c,d∈N ∃s∈R ∃r∈{0,1,2}:a<b<c<d≤n−1,s∈{1,−1},m=Pabcds,r​.

For every a,b,c,d∈Na,b,c,d\in\mathbb Na,b,c,d∈N, s∈Rs\in\mathbb Rs∈R, and r∈{0,1,2}r\in\{0,1,2\}r∈{0,1,2}, if a<b<c<d≤n−1a<b<c<d\le n-1a<b<c<d≤n−1 and s∈{1,−1}s\in\{1,-1\}s∈{1,−1}, then

B(Pabcds,r)=log⁡ ⁣((qabcdr4n2)2).B(P_{abcd}^{s,r}) = \log\!\left(\left(\frac{q_{abcd}^{r}}{4n^2}\right)^2\right).B(Pabcds,r​)=log((4n2qabcdr​​)2).

When n=2n=2n=2, every integer vector mmm with A(m)>1A(m)>1A(m)>1 satisfies A(m)≥4A(m)\ge4A(m)≥4, and there exists an integer vector mmm with A(m)=4A(m)=4A(m)=4. When n=3n=3n=3, every integer vector mmm with A(m)>1A(m)>1A(m)>1 satisfies A(m)≥3A(m)\ge3A(m)≥3, and there exists an integer vector mmm with A(m)=3A(m)=3A(m)=3. The endpoints in all existential statements need not be unique. For n=2n=2n=2 or n=3n=3n=3, no natural endpoints satisfy a<b<c<d≤n−1a<b<c<d\le n-1a<b<c<d≤n−1, so that existential condition is false and the universally quantified formula under those endpoint hypotheses is vacuous.

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