Theorem 16
OpenQAlgorithms.Papers.Independent.Gap50repair.P01.rotation_generalized_spectral_formulaLet and . Let be its full complex generalized eigenspace. For every eigenvalue on the unit circle other than , the real bilinear form
is symmetric and nondegenerate on the underlying real space. Its positive inertia is even. Write ; this integer is also even. The spectral rotation map satisfies
The product ranges over distinct eigenvalues, with their contributions weighted by these multiplicities. All powers have integer exponents. This formula determines the rotation contribution of each spectral component without choosing fractional-power branches.
import Definitions.Def_QAlgorithms_Papers_Independent_Gap50repair_P01
noncomputable section
open scoped BigOperators Matrix Matrix.Norms.Frobenius
namespace QAlgorithms.Papers.Independent.Gap50repair.P01
attribute [local instance] Classical.propDecidable
-- Pinned entrywise complexification and symplecticity. The latter uses -Omega0;
-- preserving -Omega0 is equivalent to preserving Omega0, with identical coordinates.
open QAlgorithms.Papers.Independent.Dependency50.P10 (complexify)
open QAlgorithms.Papers.Independent.Frontier30.P02 (IsSymplectic)
/-- Theorem 16 ([12,3]), PDF pp.14–15: real symmetric nondegenerate Krein
forms on the full generalized eigenspaces and formula (18). The half exponents
are integers; no fractional complex power is used. -/
theorem rotation_generalized_spectral_formula {n : ℕ} (hn : 1 ≤ n)
(A : GroupedRealMatrix n) (hA : IsSymplectic A) :
(∀ z ∈ eigenvalues A, ‖z‖ = 1 → z ≠ 1 → z ≠ -1 →
(∀ v ∈ generalizedSpace A z, ∀ w ∈ generalizedSpace A z,
kreinPairing v w = kreinPairing w v) ∧
(∀ v ∈ generalizedSpace A z,
(∀ w ∈ generalizedSpace A z, kreinPairing v w = 0) → v = 0) ∧
2 ∣ kreinPositive A z) ∧
(2 ∣ ∑ z ∈ (eigenvalues A).filter (fun z => z.im = 0 ∧ z.re < 0),
Module.finrank ℂ (generalizedSpace A z)) ∧
spectralRotation A =
(-1 : ℂ)^((∑ z ∈ (eigenvalues A).filter (fun z => z.im = 0 ∧ z.re < 0),
Module.finrank ℂ (generalizedSpace A z))/2) *
∏ z ∈ (eigenvalues A).filter (fun z => ‖z‖ = 1 ∧ z ≠ 1 ∧ z ≠ -1),
z^(kreinPositive A z/2) := by sorry
end QAlgorithms.Papers.Independent.Gap50repair.P01
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every natural number and every real matrix satisfying , where , let be the finite set of distinct roots of the complex characteristic polynomial of , let denote the root multiplicity, and put . On complex vectors define the real pairing
and let be the maximum for which some real subspace has real dimension and for every nonzero . The theorem asserts that, for every with , , and , the pairing is symmetric on , meaning for all ; it has zero left kernel there, meaning that and for every imply ; and divides . It also asserts that divides , and that the quantity
satisfies
Every sum and product is over distinct roots; empty sums and products are and . Division in all exponents is natural-number division, with the asserted divisibility making the quotients on the right exact.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.