Remark 31
ProvedQAlgorithms.Papers.Independent.Gap50repair.P01.positive_eigenvalue_componentLet with . Let be the total algebraic multiplicity of its real positive eigenvalues; repeated roots are counted repeatedly. Then
This identifies the positive component using the spectrum. Counting distinct spectral values instead of algebraic multiplicities would give a different statement.
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)
/-- Remark 31, PDF p.34: real positive eigenvalues counted with multiplicity. -/
theorem positive_eigenvalue_component {n : ℕ} (A : GroupedRealMatrix n)
(hA : IsSymplectic A) (hend : (A-1).det ≠ 0) :
0 < (A-1).det ↔ 4 ∣ ∑ z ∈ (eigenvalues A).filter (fun z => z.im = 0 ∧ 0 < z.re),
algebraicMultiplicity A z := 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 , assume . Let be the set of distinct complex roots of the characteristic polynomial of the entrywise complexification , and let denote the algebraic multiplicity of . Then
The sum counts all positive real characteristic roots with their algebraic multiplicities, and an empty sum is , which is divisible by . The case is included; its determinant is and its sum is .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.