Distinct-index tensors as coset functions
OpenQAlgorithms.Papers.Independent.Intakenext100.P94.tensor_quotient_bijectionLet . Consider real order- tensors that vanish unless all indices are pairwise distinct. Let fix the final distinguished points individually. Then
is well defined and is a bijection from these tensors to real functions on . Under simultaneous inverse permutation of all tensor indices,
This is the homogeneous-space realization of the ordered distinct-index action. At the stabilizer is trivial. The zero-order case is outside this statement.
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 7, source PDF p.12, including k=n and excluding the unstated k=0. -/
theorem tensor_quotient_bijection (n k : ℕ) (hk : 1 ≤ k) (hkn : k ≤ n) :
Function.Bijective (fun F : DistinctSpace n k => quotientValues (finalPoints hkn) F.val) ∧
(∀ (F : DistinctSpace n k) (s : Perm n),
quotientValues (finalPoints hkn) F.val (Quotient.mk _ s) =
F.val (fun a => s (finalPoints hkn a))) ∧
(∀ (F : DistinctSpace n k) (s : Perm n) q,
quotientValues (finalPoints hkn) (distinctAction s F).val q =
quotientValues (finalPoints hkn) F.val (cosetTranslate (finalPoints hkn) 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 all natural numbers satisfying , put for , let , and let be its left-coset space. Let be the real vector space of functions on tuples such that whenever is not injective, and 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 . These hypotheses exclude and , but include .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.