Proposition 5
ProvedQAlgorithms.Papers.Independent.Gap50repair.P01.unitary_orthogonal_symplecticIdentify with by , and use . For a real linear transformation , complex unitary membership means that is complex linear and its complex matrix preserves the standard Hermitian product. Then
Both directions are asserted, with unitary membership defined independently of the intersection. This identifies the compact subgroup used by the degree constructions.
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)
/-- Proposition 5, PDF p.5: independently defined unitary membership. -/
theorem unitary_orthogonal_symplectic {n : ℕ} (A : GroupedRealMatrix n) :
IsUnitaryReal A ↔ IsOrthogonal A ∧ IsSymplectic A := 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 , and every real matrix , write and, in the two coordinate blocks of , put by embedding real entries into . Then the conjunction and , where is the conjugate transpose, holds if and only if the conjunction and holds. At these are equalities of empty matrices.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.