Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Ordered off-diagonal matrices as coset functions

Open
QAlgorithms.Papers.Independent.Intakenext100.P94.matrix_quotient_bijection

by Gohan · Oct 31, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

Let n≥2n\ge2n≥2, and let H≤SnH\le S_nH≤Sn​ be the subgroup fixing nnn and n−1n-1n−1 individually. For every real zero-diagonal matrix FFF, without a symmetry restriction, the prescription

F^(μH)=Fμ(n),μ(n−1)\widehat F(\mu H)=F_{\mu(n),\mu(n-1)}F(μH)=Fμ(n),μ(n−1)​

is independent of the representative and gives a bijection to real functions on Sn/HS_n/HSn​/H. Simultaneous inverse permutation of the matrix indices corresponds to left inverse translation of the quotient function:

σF^(q)=F^(σ−1q).\widehat{\sigma F}(q)=\widehat F(\sigma^{-1}q).σF(q)=F(σ−1q).

This identifies the ordered distinct-pair action with Sn/Sn−2S_n/S_{n-2}Sn​/Sn−2​.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P94
Formal statement
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
Source
The general theory of permutation equivarant neural networks and higher order graph variational encoders, arXiv:2004.03990v1, PDF p. 12, Proposition 6 (Appendix A): off-diagonal matrix/quotient bijection
Read-back

What the Lean code literally says, in plain math · gpt-6.1-sol

For every natural number nnn satisfying 2≤n2\le n2≤n, let H={s∈Sn:s(n−1)=n−1 and s(n−2)=n−2}H=\{s\in S_n:s(n-1)=n-1\ \text{and}\ s(n-2)=n-2\}H={s∈Sn​:s(n−1)=n−1 and s(n−2)=n−2}, let Q=Sn/HQ=S_n/HQ=Sn​/H be its left-coset space, and let DDD be the real vector space of functions F:{0,…,n−1}2→RF:\{0,\ldots,n-1\}^2\to\mathbb RF:{0,…,n−1}2→R satisfying F(i,i)=0F(i,i)=0F(i,i)=0 for every iii. For F∈DF\in DF∈D, define VF(q)=F(rq(n−1),rq(n−2))V_F(q)=F(r_q(n-1),r_q(n-2))VF​(q)=F(rq​(n−1),rq​(n−2)), using the chosen representative rqr_qrq​ of qqq. The statement asserts the conjunction of three claims: F↦VFF\mapsto V_FF↦VF​ is a bijection from DDD to all functions Q→RQ\to\mathbb RQ→R; for every F∈DF\in DF∈D and s∈Sns\in S_ns∈Sn​, VF(sH)=F(s(n−1),s(n−2))V_F(sH)=F(s(n-1),s(n-2))VF​(sH)=F(s(n−1),s(n−2)); and for every F∈DF\in DF∈D, s∈Sns\in S_ns∈Sn​, and q∈Qq\in Qq∈Q, Vs⋅F(q)=VF((s−1rq)H)V_{s\cdot F}(q)=V_F((s^{-1}r_q)H)Vs⋅F​(q)=VF​((s−1rq​)H), where (s⋅F)(i,j)=F(s−1(i),s−1(j))(s\cdot F)(i,j)=F(s^{-1}(i),s^{-1}(j))(s⋅F)(i,j)=F(s−1(i),s−1(j)). The case n=2n=2n=2 is included.

Human review
  • Endorsed by Shuze Chen · Oct 31, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Oct 31, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me