Unnumbered: symplectic graphs and complements
ProvedQAlgorithms.Papers.Independent.Gap50repair.P01.symplectic_graphs_and_complementsEquip with . For every real linear map its graph has dimension , and
In particular the diagonal is Lagrangian. If is symplectic, is Lagrangian and complementary to . For arbitrary linear maps , their graphs are complementary if and only if is invertible. These assertions supply all graph and complement clauses introducing the generalized index.
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)
/-- Unnumbered graph/complement results, PDF p.47, for arbitrary linear maps. -/
theorem symplectic_graphs_and_complements {n : ℕ} :
(∀ A : GroupedRealMatrix n, Module.finrank ℝ (graphSpace A) = 2*n ∧
(IsGraphLagrangian (graphSpace A) ↔ IsSymplectic A)) ∧
IsGraphLagrangian (graphSpace (1 : GroupedRealMatrix n)) ∧
(∀ A : GroupedRealMatrix n, IsSymplectic A → IsGraphLagrangian (graphSpace (-A)) ∧
IsCompl (graphSpace A) (graphSpace (-A))) ∧
(∀ A B : GroupedRealMatrix n, IsCompl (graphSpace A) (graphSpace B) ↔ (A-B).det ≠ 0) := 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 , including zero, put , define , and write for any real matrix . Call a subspace Lagrangian here precisely when it has real dimension and for every . The theorem asserts all four claims: every has , and is Lagrangian if and only if ; the identity graph is Lagrangian; for every satisfying , the graph is Lagrangian and are complementary subspaces; and for every pair of real matrices , with no symplectic hypotheses on this pair, are complementary if and only if . Complementary means their intersection is and their sum is the entire product space. For , the matrix determinant is the empty determinant , and the product space and all its graphs are zero-dimensional.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.