Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Vectors as functions on left cosets

Open
QAlgorithms.Papers.Independent.Intakenext100.P94.vector_quotient_bijection

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

prove2quantum

Let n≥1n\ge1n≥1 and let H≤SnH\le S_nH≤Sn​ be the full subgroup fixing the distinguished point nnn. For f∈Rnf\in\mathbb R^nf∈Rn, the representative prescription

f^(μH)=fμ(n)\widehat f(\mu H)=f_{\mu(n)}f​(μH)=fμ(n)​

is independent of the representative and defines a bijection Rn→RSn/H\mathbb R^n\to\mathbb R^{S_n/H}Rn→RSn​/H. Under the first-order inverse permutation action,

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

This identifies the first-order activation space with the left-coset function model. In zero-based indexing the distinguished point is n−1n-1n−1.

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 5, source PDF p.12: vectors and left S_n/S_(n-1) cosets.
The representative identity explicitly includes well-definedness of the formula. -/
theorem vector_quotient_bijection (n : ℕ) (hn : 1 ≤ n) :
    Function.Bijective (vectorValues hn) ∧
    (∀ f (s : Perm n), vectorValues hn f (Quotient.mk _ s) =
      f (s (finalPoints hn 0))) ∧
    (∀ f (s : Perm n) q,
      vectorValues hn (fun i => f (s.symm i)) q =
        vectorValues hn f (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 5 (Appendix A): vector/quotient bijection
Read-back

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

For every natural number nnn satisfying 1≤n1\le n1≤n, let H={s∈Sn:s(n−1)=n−1}H=\{s\in S_n:s(n-1)=n-1\}H={s∈Sn​:s(n−1)=n−1}, let Q=Sn/HQ=S_n/HQ=Sn​/H be its left-coset space, and define Vf(q)=f(rq(n−1))V_f(q)=f(r_q(n-1))Vf​(q)=f(rq​(n−1)) for each function f:{0,…,n−1}→Rf:\{0,\ldots,n-1\}\to\mathbb Rf:{0,…,n−1}→R, using the chosen representative rqr_qrq​ of qqq. The statement asserts the conjunction of three claims: the map f↦Vff\mapsto V_ff↦Vf​ is a bijection from all such functions fff to all functions Q→RQ\to\mathbb RQ→R; for every such fff and every s∈Sns\in S_ns∈Sn​, Vf(sH)=f(s(n−1))V_f(sH)=f(s(n-1))Vf​(sH)=f(s(n−1)); and for every such fff, every s∈Sns\in S_ns∈Sn​, and every q∈Qq\in Qq∈Q, Vf∘s−1(q)=Vf((s−1rq)H)V_{f\circ s^{-1}}(q)=V_f((s^{-1}r_q)H)Vf∘s−1​(q)=Vf​((s−1rq​)H). The case n=1n=1n=1 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