Ordered off-diagonal matrices as coset functions
OpenQAlgorithms.Papers.Independent.Intakenext100.P94.matrix_quotient_bijectionLet , and let be the subgroup fixing and individually. For every real zero-diagonal matrix , without a symmetry restriction, the prescription
is independent of the representative and gives a bijection to real functions on . Simultaneous inverse permutation of the matrix indices corresponds to left inverse translation of the quotient function:
This identifies the ordered distinct-pair action with .
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P94
noncomputable section
namespace QAlgorithms.Papers.Independent.Intakenext100.P94
open scoped BigOperators
attribute [local instance] Classical.propDecidable
/-- Proposition 6, source PDF p.12: ordered off-diagonal pairs, no symmetry.
Corrects the representative-subgroup typo S_(n-1) to S_(n-2), as the proof requires. -/
theorem matrix_quotient_bijection (n : ℕ) (hn : 2 ≤ n) :
Function.Bijective (fun F : DistinctSpace n 2 => quotientValues (finalPoints hn) F.val) ∧
(∀ (F : DistinctSpace n 2) (s : Perm n),
quotientValues (finalPoints hn) F.val (Quotient.mk _ s) =
F.val ![s (finalPoints hn 0), s (finalPoints hn 1)]) ∧
(∀ (F : DistinctSpace n 2) (s : Perm n) q,
quotientValues (finalPoints hn) (distinctAction s F).val q =
quotientValues (finalPoints hn) F.val (cosetTranslate (finalPoints hn) s.symm q)) := by sorry
end QAlgorithms.Papers.Independent.Intakenext100.P94
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every natural number satisfying , let , let be its left-coset space, and let be the real vector space of functions satisfying for every . For , define , using the chosen representative of . The statement asserts the conjunction of three claims: is a bijection from to all functions ; for every and , ; and for every , , and , , where . The case is included.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.