Theta lattice minima, domain-wall sectors, and amplitudes
OpenQAlgorithms.Papers.Independent.Intakenext100.P22.lattice_sectorsFix . For set , , and , where is the digamma function. Define
Then for every real vector,
For and let equal on and zero elsewhere. Every nonzero integer vector has , with equality exactly for these blocks; moreover,
Over , with and nonzero , the minimum is . Equality holds exactly when , and .
The integer vectors with are exactly the following patterns, for and :
Write and
Their amplitudes are
These second-sector patterns require . For and , the smallest energy strictly above is respectively and , and each value is attained. These classifications determine the first theta-lattice contributions independently of any physical moment formula.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P22
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
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every natural number satisfying , let . For real vectors on , use the following explicit abbreviations:
Here is the Euler–Mascheroni constant, is the complex digamma function evaluated at complex embeddings of real arguments, , , , and integer vector coordinates are embedded in wherever needed. Differences in trigonometric arguments are real differences. The theorem asserts the conjunction of all the following statements. Every real vector on satisfies . Every integer vector on that is not the zero vector satisfies , and for each such vector,
For every and satisfying , , and , both
hold. For every and satisfying , , , and ,
For every Boolean vector on and integer vector on , if is not identically false, then , and
For every and satisfying , , and ,
For every integer vector on , including the zero vector,
For every , , and , if and , then
When , every integer vector with satisfies , and there exists an integer vector with . When , every integer vector with satisfies , and there exists an integer vector with . The endpoints in all existential statements need not be unique. For or , no natural endpoints satisfy , so that existential condition is false and the universally quantified formula under those endpoint hypotheses is vacuous.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.