Definitions for The general theory of permutation equivarant neural networks and higher order graph variational encoders
DefinitionQAlgorithms_Papers_Independent_Intakenext100_P94The objects the formalized statements of The general theory of permutation equivarant neural networks and higher order graph variational encoders (arXiv:2004.03990) are stated in. Each was checked against the paper by a blind read-back and a moderator.
PermTensorpermutationTensorAction: Simultaneous inverse reindexing, source PDF p.2, Eq.(2).equivariantLinearMaps: Linear intertwiners, source PDF pp.3–4; no bias or nonlinearity is counted.supportedSpace: Tensors supported on a specified equality pattern (PDF pp.3,15).DistinctSpacedistinctAction: The distinct-index space is preserved under the source's action.pointwise: Shared pointwise nonlinearity; this is applied after the linear map (PDF p.3).tensorRowSum: Row, column, total and trace contractions (PDF pp.4–5).colSumtotalSumactivationTraceSumsevenFormula: Theorem 2's seven terms, evaluated only off the diagonal (PDF p.4).fifteenFormula: Corollary 4's fifteen terms, including the trace overbars (PDF p.5).IsRealIrreducible: A real irreducible model means a nonzero representation with no proper, nonzero invariant real linear subspace (PDF p.4).ModelsInequivalent: Models are inequivalent if no invertible intertwiner exists (PDF p.4).FourierBlocksfourierColumnAction: Each column is acted on by the same irreducible model (PDF p.4).FourierWeightsapplyBlocks: Fourier-space right multiplication; source PDF p.4, Theorem 3.finalPoints: The subgroup fixing the final k points individually, PDF p.12. The embedding is typed and the natural subtraction is protected by k≤n.pointStabilizerCosetsquotientValues: Representative formula with well-definedness asserted by Propositions 5–7; choosing out does not assume the desired bijection or intertwining conclusion.cosetTranslatevectorValuesrealYoung: Real Young symmetrizer: same concrete row/column permutation sets as the accepted Specht construction, with real scalars as required by PDF p.4.realSpechtHasTensorType: An actual equivariant isomorphism to copies of concrete real Specht ideals. The group acts by left translation inside each ideal. No Fourier coordinates or multiplicities are assumed as an input field (PDF p.4).secondShapes: Printed partition order, source PDF p.4.thirdShapespairPattern: The three exactly-two-equal patterns are indexed by their singleton position.IsRecipe: A contraction partitions the three input slots into equality blocks; each block is named by its least slot. A selected subset of blocks is retained, and the others are summed. This is precisely the four contraction lists on pp.15–16.RecipeRetainedPlacedRecipe: Every injection of the retained slots into the available output slots is used.contractionKernel: Coefficient kernel for one contraction: equal input indices within a block, retained blocks fixed to the selected output entries; other blocks summed freely. Distinct blocks are not required to receive distinct vertex labels.ThirdIndex: 77 generic terms, three sets of 37 pair-supported corrections, and 15 all-diagonal corrections (PDF p.16, Table 4).thirdKernel: Equality-supported corrections are added to the generic formula. The pair index names the singleton output slot; Fin 3 addition is cyclic.thirdFormula: Concrete weighted contraction construction, source PDF pp.15–16.promote: Zero-extension promotion along an injective correspondence, PDF p.6, Eq.(6). Off-image values are explicitly zero; overlapping children add their contributions.relabelEmbedding: The correspondence itself is relabelled, not held fixed (PDF pp.5–6).tensorOuterProduct: Outer product permits higher tensor order; no contraction or bias is implicit.
import Mathlib
import Definitions.Def_QAlgorithms_Defs_SpechtModules
/-!
The accepted-library basename matches reported by the previous check describe
different concepts: Dependency50.P09.tensorAction is a quantum superoperator
tensor product; Gap48.P28.intertwinerSpace is a complex three-representation
Clebsch–Gordan matrix space; Renew46.P15.rowSum is a GT-pattern row sum;
Information100.P53.traceSum is a pairwise discrimination trace-norm bound;
Information100.P26.Blocks is a positive coordinate-block decomposition;
Claimed50.P13.blockAction is a tensor power of a quantum channel;
Information100.P07.Weights is a probability predicate; and the outer products
in Information100.P19/P26 conjugate a complex vector. None is the real tensor,
two-action linear-map space, Fourier multiplicity data or order-raising product
of this paper. Their exact bodies were compared before retaining these local
constructions under distinct descriptive names. No frozen body is duplicated.
-/
noncomputable section
namespace QAlgorithms.Papers.Independent.Intakenext100.P94
open scoped BigOperators
attribute [local instance] Classical.propDecidable
abbrev Perm (n : ℕ) := Equiv.Perm (Fin n)
abbrev Tensor (n k : ℕ) := (Fin k → Fin n) → ℝ
/-- Simultaneous inverse reindexing, source PDF p.2, Eq.(2). -/
def permutationTensorAction {n k : ℕ} (s : Perm n) : Tensor n k →ₗ[ℝ] Tensor n k where
toFun F := fun t => F (fun a => s.symm (t a))
map_add' _ _ := rfl
map_smul' _ _ := rfl
example {n k : ℕ} (F : Tensor n k) : permutationTensorAction (1 : Perm n) F = F := rfl
/-- Linear intertwiners, source PDF pp.3–4; no bias or nonlinearity is counted. -/
def equivariantLinearMaps {G E H : Type*} [AddCommGroup E] [Module ℝ E]
[AddCommGroup H] [Module ℝ H] (A : G → E →ₗ[ℝ] E)
(B : G → H →ₗ[ℝ] H) : Submodule ℝ (E →ₗ[ℝ] H) where
carrier := {L | ∀ s x, L (A s x) = B s (L x)}
zero_mem' := by simp
add_mem' := by
intro L M hL hM s x
simp only [LinearMap.add_apply, map_add, hL s x, hM s x]
smul_mem' := by
intro c L hL s x
simp only [LinearMap.smul_apply, map_smul, hL s x]
/-- Tensors supported on a specified equality pattern (PDF pp.3,15). -/
def supportedSpace {n k : ℕ} (P : (Fin k → Fin n) → Prop) :
Submodule ℝ (Tensor n k) where
carrier := {F | ∀ t, ¬ P t → F t = 0}
zero_mem' := by simp
add_mem' := by intro F G hF hG t ht; simp [hF t ht, hG t ht]
smul_mem' := by intro c F hF t ht; simp [hF t ht]
abbrev DistinctSpace (n k : ℕ) := supportedSpace (n := n) (k := k) Function.Injective
/-- The distinct-index space is preserved under the source's action. -/
def distinctAction {n k : ℕ} (s : Perm n) : DistinctSpace n k →ₗ[ℝ] DistinctSpace n k where
toFun F := ⟨permutationTensorAction s F.val, by
intro t ht
apply F.property
intro hi
apply ht
intro a b hab
exact hi (congrArg s.symm hab)⟩
map_add' _ _ := by rfl
map_smul' _ _ := by rfl
/-- Shared pointwise nonlinearity; this is applied after the linear map (PDF p.3). -/
def pointwise {n k : ℕ} (xi : ℝ → ℝ) (F : Tensor n k) : Tensor n k := fun t => xi (F t)
/-- Row, column, total and trace contractions (PDF pp.4–5). -/
def tensorRowSum {n : ℕ} (F : Tensor n 2) (i : Fin n) : ℝ := ∑ j, F ![i,j]
def colSum {n : ℕ} (F : Tensor n 2) (i : Fin n) : ℝ := ∑ j, F ![j,i]
def totalSum {n : ℕ} (F : Tensor n 2) : ℝ := ∑ i, ∑ j, F ![i,j]
def activationTraceSum {n : ℕ} (F : Tensor n 2) : ℝ := ∑ i, F ![i,i]
/-- Theorem 2's seven terms, evaluated only off the diagonal (PDF p.4). -/
def sevenFormula {n : ℕ} (w : Fin 7 → ℝ) (F : Tensor n 2) (i j : Fin n) : ℝ :=
w 0 * F ![i,j] + w 1 * F ![j,i] + w 2 * tensorRowSum F i + w 3 * colSum F i +
w 4 * colSum F j + w 5 * tensorRowSum F j + w 6 * totalSum F
/-- Corollary 4's fifteen terms, including the trace overbars (PDF p.5). -/
def fifteenFormula {n : ℕ} (w : Fin 15 → ℝ) (F : Tensor n 2) (i j : Fin n) : ℝ :=
w 0 * F ![i,j] + w 1 * F ![j,i] + w 2 * tensorRowSum F i + w 3 * colSum F i +
w 4 * colSum F j + w 5 * tensorRowSum F j + w 6 * totalSum F + w 7 * activationTraceSum F +
w 8 * F ![i,i] + w 9 * F ![j,j] +
if i = j then w 10 * F ![i,i] + w 11 * activationTraceSum F + w 12 * totalSum F +
w 13 * tensorRowSum F i + w 14 * colSum F i else 0
example {n : ℕ} (F : Tensor n 2) (i : Fin n) : tensorRowSum F i = ∑ j, F ![i,j] := rfl
/-- A real irreducible model means a nonzero representation with no proper,
nonzero invariant real linear subspace (PDF p.4). -/
def IsRealIrreducible {n d : ℕ}
(rho : Perm n →* Module.End ℝ (Fin d → ℝ)) : Prop :=
0 < d ∧ ∀ S : Submodule ℝ (Fin d → ℝ),
(∀ s x, x ∈ S → rho s x ∈ S) → S = ⊥ ∨ S = ⊤
/-- Models are inequivalent if no invertible intertwiner exists (PDF p.4). -/
def ModelsInequivalent {n d e : ℕ}
(rho : Perm n →* Module.End ℝ (Fin d → ℝ))
(eta : Perm n →* Module.End ℝ (Fin e → ℝ)) : Prop :=
¬ ∃ U : (Fin d → ℝ) ≃ₗ[ℝ] (Fin e → ℝ), ∀ s x, U (rho s x) = eta s (U x)
abbrev FourierBlocks {I : Type*} (d tau : I → ℕ) :=
(a : I) → Matrix (Fin (d a)) (Fin (tau a)) ℝ
/-- Each column is acted on by the same irreducible model (PDF p.4). -/
def fourierColumnAction {n : ℕ} {I : Type*} {d tau : I → ℕ}
(rho : (a : I) → Perm n →* Module.End ℝ (Fin (d a) → ℝ))
(s : Perm n) (F : FourierBlocks d tau) : FourierBlocks d tau :=
fun a r c => rho a s (fun b => F a b c) r
abbrev FourierWeights {I : Type*} (tau upsilon : I → ℕ) :=
(a : I) → Matrix (Fin (tau a)) (Fin (upsilon a)) ℝ
/-- Fourier-space right multiplication; source PDF p.4, Theorem 3. -/
def applyBlocks {I : Type*} {d tau upsilon : I → ℕ}
(w : FourierWeights tau upsilon) (F : FourierBlocks d tau) : FourierBlocks d upsilon :=
fun a => F a * w a
example {I : Type*} {d tau upsilon : I → ℕ} (F : FourierBlocks d tau)
(w : FourierWeights tau upsilon) (a : I) : applyBlocks w F a = F a * w a := rfl
/-- The subgroup fixing the final k points individually, PDF p.12.
The embedding is typed and the natural subtraction is protected by k≤n. -/
def finalPoints {n k : ℕ} (hkn : k ≤ n) : Fin k ↪ Fin n where
toFun a := ⟨n - 1 - a.val, by omega⟩
inj' := by intro a b h; apply Fin.ext; have := congrArg Fin.val h; dsimp at this; omega
def pointStabilizer {n k : ℕ} (e : Fin k ↪ Fin n) : Subgroup (Perm n) where
carrier := {s | ∀ a, s (e a) = e a}
one_mem' := by intro a; rfl
mul_mem' := by intro s t hs ht a; change s (t (e a)) = e a; rw [ht, hs]
inv_mem' := by
intro s hs a
apply s.injective
simpa using (hs a).symm
abbrev Cosets {n k : ℕ} (e : Fin k ↪ Fin n) :=
Quotient (QuotientGroup.leftRel (pointStabilizer e))
/-- Representative formula with well-definedness asserted by Propositions 5–7;
choosing out does not assume the desired bijection or intertwining conclusion. -/
def quotientValues {n k : ℕ} (e : Fin k ↪ Fin n) (F : Tensor n k) : Cosets e → ℝ :=
fun q => F (fun a => q.out (e a))
def cosetTranslate {n k : ℕ} (e : Fin k ↪ Fin n) (s : Perm n) (q : Cosets e) : Cosets e :=
Quotient.mk _ (s * q.out)
def vectorValues {n : ℕ} (hn : 1 ≤ n) (f : Fin n → ℝ) :
Cosets (finalPoints hn) → ℝ :=
quotientValues (finalPoints hn) (fun t => f (t 0))
example {n k : ℕ} (e : Fin k ↪ Fin n) : (1 : Perm n) ∈ pointStabilizer e :=
(pointStabilizer e).one_mem
/-- Real Young symmetrizer: same concrete row/column permutation sets as the
accepted Specht construction, with real scalars as required by PDF p.4. -/
def realYoung {n : ℕ} (lambda : QAlgorithms.Schur.Partition n n) :
Matrix (Perm n) (Perm n) ℝ := fun g h =>
∑ a ∈ QAlgorithms.Schur.rowPermutations lambda,
∑ b ∈ QAlgorithms.Schur.columnPermutations lambda,
if g = h * a * b then (((Equiv.Perm.sign b : ℤˣ) : ℤ) : ℝ) else 0
def realSpecht {n : ℕ} (lambda : QAlgorithms.Schur.Partition n n) :
Submodule ℝ (Perm n → ℝ) := LinearMap.range (Matrix.toLin' (realYoung lambda))
/-- An actual equivariant isomorphism to copies of concrete real Specht ideals.
The group acts by left translation inside each ideal. No Fourier coordinates
or multiplicities are assumed as an input field (PDF p.4). -/
def HasTensorType {n k r : ℕ} (S : Submodule ℝ (Tensor n k))
(lambda : Fin r → QAlgorithms.Schur.Partition n n) (tau : Fin r → ℕ) : Prop :=
∃ U : S ≃ₗ[ℝ] ((a : Fin r) → Fin (tau a) → realSpecht (lambda a)),
∀ (s : Perm n) (F : S), ∃ G : S,
G.val = permutationTensorAction s F.val ∧
∀ a c g, (U G a c).val g = (U F a c).val (s.symm * g)
/-- Printed partition order, source PDF p.4. -/
def secondShapes (n : ℕ) : Fin 4 → List ℕ := ![[n], [n-1,1], [n-2,2], [n-2,1,1]]
def thirdShapes (n : ℕ) : Fin 7 → List ℕ :=
![[n], [n-1,1], [n-2,2], [n-2,1,1], [n-3,3], [n-3,2,1], [n-3,1,1,1]]
example {n : ℕ} (lambda : QAlgorithms.Schur.Partition n n) :
realSpecht lambda = LinearMap.range (Matrix.toLin' (realYoung lambda)) := rfl
/-- The three exactly-two-equal patterns are indexed by their singleton position. -/
def pairPattern {n : ℕ} (a : Fin 3) (t : Fin 3 → Fin n) : Prop :=
t (a+1) = t (a+2) ∧ t a ≠ t (a+1)
/-- A contraction partitions the three input slots into equality blocks; each
block is named by its least slot. A selected subset of blocks is retained, and
the others are summed. This is precisely the four contraction lists on pp.15–16. -/
def IsRecipe (p : (Fin 3 → Fin 3) × Finset (Fin 3)) : Prop :=
(∀ a, p.1 a ≤ a ∧ p.1 (p.1 a) = p.1 a) ∧ ∀ a ∈ p.2, p.1 a = a
example : IsRecipe ((id : Fin 3 → Fin 3), Finset.univ) := by simp [IsRecipe]
abbrev Recipe := {p : (Fin 3 → Fin 3) × Finset (Fin 3) // IsRecipe p}
abbrev Retained (p : Recipe) := {a : Fin 3 // a ∈ p.val.2}
/-- Every injection of the retained slots into the available output slots is used. -/
abbrev PlacedRecipe (r : ℕ) := Σ p : Recipe, (Retained p ↪ Fin r)
/-- Coefficient kernel for one contraction: equal input indices within a block,
retained blocks fixed to the selected output entries; other blocks summed freely.
Distinct blocks are not required to receive distinct vertex labels. -/
def contractionKernel {n r : ℕ} (p : PlacedRecipe r)
(t : Fin r → Fin n) (u : Fin 3 → Fin n) : ℝ :=
if (∀ a b, p.1.val.1 a = p.1.val.1 b → u a = u b) ∧
(∀ a : Retained p.1, u a.val = t (p.2 a)) then 1 else 0
/-- 77 generic terms, three sets of 37 pair-supported corrections, and 15
all-diagonal corrections (PDF p.16, Table 4). -/
abbrev ThirdIndex := PlacedRecipe 3 ⊕ ((Fin 3 × PlacedRecipe 2) ⊕ PlacedRecipe 1)
/-- Equality-supported corrections are added to the generic formula. The pair
index names the singleton output slot; Fin 3 addition is cyclic. -/
def thirdKernel {n : ℕ} (p : ThirdIndex) (t u : Fin 3 → Fin n) : ℝ :=
match p with
| .inl q => contractionKernel q t u
| .inr (.inl (a,q)) =>
if t (a+1) = t (a+2) then contractionKernel q ![t (a+1),t a] u else 0
| .inr (.inr q) =>
if ∀ a b, t a = t b then contractionKernel q ![t 0] u else 0
/-- Concrete weighted contraction construction, source PDF pp.15–16. -/
def thirdFormula {n : ℕ} (w : ThirdIndex → ℝ) (F : Tensor n 3) : Tensor n 3 :=
fun t => ∑ p : ThirdIndex, w p * ∑ u : Fin 3 → Fin n, thirdKernel p t u * F u
example {n : ℕ} (F : Tensor n 3) : thirdFormula (fun _ => 0) F = 0 := by
ext t
simp [thirdFormula]
/-- Zero-extension promotion along an injective correspondence, PDF p.6, Eq.(6).
Off-image values are explicitly zero; overlapping children add their contributions. -/
def promote {m n k : ℕ} (chi : Fin m ↪ Fin n) (F : Tensor m k) : Tensor n k :=
fun t => ∑ u : Fin k → Fin m, if (fun a => chi (u a)) = t then F u else 0
/-- The correspondence itself is relabelled, not held fixed (PDF pp.5–6). -/
def relabelEmbedding {m n : ℕ} (chi : Fin m ↪ Fin n) (s : Perm n) (p : Perm m) :
Fin m ↪ Fin n where
toFun i := s (chi (p.symm i))
inj' := s.injective.comp (chi.injective.comp p.symm.injective)
/-- Outer product permits higher tensor order; no contraction or bias is implicit. -/
def tensorOuterProduct {n k l : ℕ} (F : Tensor n k) (G : Tensor n l) :
((Fin k ⊕ Fin l) → Fin n) → ℝ :=
fun t => F (fun a => t (.inl a)) * G (fun b => t (.inr b))
example {m n : ℕ} (chi : Fin m ↪ Fin n) (s : Perm n) (p : Perm m) (i : Fin m) :
relabelEmbedding chi s p i = s (chi (p.symm i)) := rfl
end QAlgorithms.Papers.Independent.Intakenext100.P94
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
QAlgorithms.Papers.Independent.Intakenext100.P94.Cosets
For all natural numbers and every injection , this denotes the quotient of the permutation group by the equivalence relation if and only if , where . Its elements are therefore the left cosets . If , then and the quotient has one element, including when .
QAlgorithms.Papers.Independent.Intakenext100.P94.DistinctSpace
For all natural numbers , is the real subspace of real-valued functions on tuples , where , that vanish whenever is not injective, meaning whenever two distinct tuple positions have the same index. Values on injective tuples are unrestricted. When , every tuple is noninjective or there are no tuples, so this is the zero vector space. When , the empty tuple is injective and the space is naturally identified with , including when .
QAlgorithms.Papers.Independent.Intakenext100.P94.FourierBlocks
For any index type and functions , this abbreviation denotes the space of families in which each is a real matrix with rows and columns, indexed respectively by and . No finiteness assumption is imposed on , and either matrix dimension may be zero. If is empty, there is exactly one such family.
QAlgorithms.Papers.Independent.Intakenext100.P94.FourierWeights
For any index type and functions , this abbreviation denotes the space of families of real matrices, where has rows and columns, indexed respectively by and . The type need not be finite, and zero matrix dimensions are allowed. If is empty, there is exactly one such family.
QAlgorithms.Papers.Independent.Intakenext100.P94.HasTensorType
For all natural numbers , every real vector subspace of the functions on tuples , every family of Young diagrams each having exactly cells and first-column length at most , and every family of natural numbers , this defines the following proposition. For each , use the cell-numbering bijection supplied by the finite-cardinality construction to define the permutations preserving each numbered cell's row and the permutations preserving each numbered cell's column; let be the image of the matrix . There exists a real linear isomorphism such that, for every permutation and every , there exists satisfying for every tuple , and satisfying for every , , and . There are no positivity assumptions on or the ; empty index sets are included, and if or every , the target of the required isomorphism is the zero vector space.
QAlgorithms.Papers.Independent.Intakenext100.P94.IsRealIrreducible
For natural numbers and a representation of the permutation group of on , meaning a map into real-linear endomorphisms that preserves identity and multiplication, this predicate means that and that every real-linear subspace satisfying
is either or all of . The parameter may be zero; dimension makes the predicate false.
QAlgorithms.Papers.Independent.Intakenext100.P94.IsRecipe
For a pair , where is a function and is a finite set, this predicate requires that and for every , and that for every . The order is the usual order . The set may be empty and need not contain every fixed point of .
QAlgorithms.Papers.Independent.Intakenext100.P94.ModelsInequivalent
For natural numbers and representations and of the permutation group of on and , respectively, each preserving identity and multiplication as a map into real-linear endomorphisms, this predicate means that there is no real-linear isomorphism satisfying
No irreducibility or positivity assumptions are imposed on the dimensions; may be zero. In particular, when , the unique linear isomorphism satisfies the displayed condition, so this predicate is false.
QAlgorithms.Papers.Independent.Intakenext100.P94.Perm
For every natural number , denotes the permutations of the set , meaning its bijections to itself. This includes , when is empty and has exactly one permutation.
QAlgorithms.Papers.Independent.Intakenext100.P94.PlacedRecipe
For every natural number , this is the type of data , where satisfies and for every , is a finite set satisfying for every , and is injective. The set may be empty. When , it must be empty; in general, injectivity requires .
QAlgorithms.Papers.Independent.Intakenext100.P94.Recipe
This is the type of pairs , where and is a finite set, satisfying and for every , and for every . Thus the data include a function with these order and idempotence conditions and a possibly empty chosen subset of its fixed points.
QAlgorithms.Papers.Independent.Intakenext100.P94.Retained
For a pair with , , for every , and a finite subset of the fixed points of , this is the type whose elements are precisely the indices . It is empty when is empty.
QAlgorithms.Papers.Independent.Intakenext100.P94.Tensor
For all natural numbers and , is the real vector space of all real-valued functions on the set of functions , where . Thus a tensor assigns a real number to every ordered -tuple of indices in , with repetitions allowed. When , there is one empty tuple, so this space is naturally identified with , including when . When and , there are no such tuples, so the space consists only of the zero function.
QAlgorithms.Papers.Independent.Intakenext100.P94.ThirdIndex
For , let be the type of triples , where satisfies and for every , is a finite subset of the fixed points of , and is injective. This defines the disjoint union
Its elements therefore carry a tag specifying either data from , a chosen index together with data from , or data from . In each case may be empty; the tags distinguish elements from different summands even when their other data agree.
QAlgorithms.Papers.Independent.Intakenext100.P94.activationTraceSum
For every natural number and every real-valued function on ordered pairs from , this defines the real number , the sum of its values on tuples with equal coordinates. When , the sum is empty and equals zero.
QAlgorithms.Papers.Independent.Intakenext100.P94.applyBlocks
For any index type , functions , a family of real matrices, and a family of real matrices, this definition returns the family of real matrices given by right multiplication in each block:
No finiteness assumption is imposed on , and all dimensions may be zero. When , the displayed sum is empty and every output entry in that block is zero.
QAlgorithms.Papers.Independent.Intakenext100.P94.colSum
For every natural number , every real-valued function on ordered pairs from , and every , this defines the real number , where denotes evaluation at the tuple whose first coordinate is and second coordinate is . For , there is no index to supply.
QAlgorithms.Papers.Independent.Intakenext100.P94.contractionKernel
For any natural numbers , let , where satisfies and for every , is a finite subset of its fixed points, and is injective. For tuples and , this defines the real number exactly when both conditions hold:
otherwise it defines . There is no requirement that different values of give different entries of . If is empty, the second condition is vacuous; if , must be empty and is the empty tuple. If , there is no possible triple .
QAlgorithms.Papers.Independent.Intakenext100.P94.cosetTranslate
For all natural numbers , every injection , every permutation , and every left coset of , this defines a coset by taking the equivalence class of , where is the chosen representative of and permutation multiplication is composition. Thus the resulting coset is . If , the quotient has one element and this operation returns that element.
QAlgorithms.Papers.Independent.Intakenext100.P94.distinctAction
For all natural numbers and every permutation of , this defines a real-linear map on the space of real-valued functions on tuples that vanish on noninjective tuples. Its value is the function
which also vanishes on noninjective tuples. When , this map fixes every function on the single empty tuple; when , it acts on the zero vector space.
QAlgorithms.Papers.Independent.Intakenext100.P94.equivariantLinearMaps
For any types , where and are additive commutative groups equipped with real module structures, and any families of real-linear endomorphisms and indexed by , this defines the real subspace of real-linear maps satisfying
No group structure on or action laws for either family are assumed. If is empty, the condition is vacuous and the subspace contains every real-linear map .
QAlgorithms.Papers.Independent.Intakenext100.P94.fifteenFormula
For any natural number , fifteen real weights , a real tensor indexed by functions , and indices , write for its value on the function with values in that order. The definition assigns
Every summation index ranges over . No condition is imposed on or on whether . The case is allowed, but supplies no indices .
QAlgorithms.Papers.Independent.Intakenext100.P94.finalPoints
For all natural numbers and a hypothesis , this defines an injection by , where subtraction is natural-number subtraction, truncated at zero. Thus the indices are sent, in order, to . When , including when , this is the empty injection.
QAlgorithms.Papers.Independent.Intakenext100.P94.fourierColumnAction
For any natural number , any index type , any functions , a family of representations of the permutation group of on , a permutation of that set, and a family of real matrices, this definition returns the family of matrices whose entries are
Thus is applied separately to each column of . Each representation preserves identity and multiplication as a map into real-linear endomorphisms; no irreducibility assumption is made. The type need not be finite, may be zero, and zero row or column dimensions are allowed, with no entries to specify in those blocks.
QAlgorithms.Papers.Independent.Intakenext100.P94.pairPattern
For any natural number , any index , and any triple , this predicate says that
where the index additions are taken modulo . Thus the two positions other than have equal entries, and position has a different entry. For there are no such triples, and for no triple satisfies the predicate.
QAlgorithms.Papers.Independent.Intakenext100.P94.permutationTensorAction
For all natural numbers and every permutation of , this defines the real-linear map on real-valued functions on the tuples given by
When , this map fixes every function on the single empty tuple. When and , its domain and codomain are the zero vector space.
QAlgorithms.Papers.Independent.Intakenext100.P94.pointStabilizer
For all natural numbers and every injection , this defines the subgroup of the permutation group consisting exactly of those permutations satisfying for every . These permutations fix each point in the image of individually. If , the condition is vacuous and , also when .
QAlgorithms.Papers.Independent.Intakenext100.P94.pointwise
For all natural numbers , any function , and any real-valued function on tuples , where , this defines the function . No linearity or other condition is imposed on . When , it applies to the value at the single empty tuple; when and , the result is the unique function on the empty tuple set.
QAlgorithms.Papers.Independent.Intakenext100.P94.promote
For arbitrary natural numbers , an injection , and any real tensor , where , the definition produces a tensor on by
Because is injective, this is for the unique matching tuple , if one exists, and if none exists. All three parameters may be zero, subject to the existence of ; when , there is exactly one empty tuple in each tuple space and its scalar value is preserved, while any sum over an empty tuple space is .
QAlgorithms.Papers.Independent.Intakenext100.P94.quotientValues
For all natural numbers , every injection , and every real-valued function on the set of tuples , this defines a real-valued function on the left cosets of by assigning to a coset the value , where is the chosen representative of supplied by the quotient representative operation. No support or invariance hypothesis on is required. If , the result is the constant value of at the unique empty tuple.
QAlgorithms.Papers.Independent.Intakenext100.P94.realSpecht
For every natural number and every Young diagram with exactly cells and first-column length at most , this defines a real vector subspace of the functions . Using the cell-numbering bijection supplied by the finite-cardinality construction, let and be the permutations preserving, respectively, the row and column coordinates of every numbered cell, and set . The defined subspace consists exactly of the functions for which there exists a function satisfying for every . The definition also applies when .
QAlgorithms.Papers.Independent.Intakenext100.P94.realYoung
For every natural number and every Young diagram with exactly cells and first-column length at most , this defines a real matrix with rows and columns indexed by . Choose the cell-numbering bijection supplied by the finite-cardinality construction; let consist of permutations for which and have the same row coordinate for every , and let consist of permutations for which those cells have the same column coordinate for every . For every , the entry is , with the sign interpreted as a real number. The definition includes , when is empty and the row and column preservation conditions are vacuous.
QAlgorithms.Papers.Independent.Intakenext100.P94.relabelEmbedding
For any natural numbers , any injection , any permutation of , and any permutation of , where , the definition returns the injection
Thus it composes , then , then . Zero values of or are included whenever the given injection exists; for , the resulting injection has empty domain.
QAlgorithms.Papers.Independent.Intakenext100.P94.secondShapes
For every natural number , this defines a function on the four indices , whose respective values are the lists , , , and . Subtraction is natural-number subtraction, truncated at zero. The definition includes and all other small values of ; it imposes no requirement that these lists be row lengths of Young diagrams.
QAlgorithms.Papers.Independent.Intakenext100.P94.sevenFormula
For any natural number , seven real weights , a real tensor indexed by functions , and indices , write for the value on the function taking to and to . The definition assigns the real number
There is no requirement that or that vanish on the diagonal. The parameter is allowed, but then there are no indices at which to evaluate this definition.
QAlgorithms.Papers.Independent.Intakenext100.P94.supportedSpace
For all natural numbers and every predicate on the tuples , where , this defines the real subspace of real-valued functions on those tuples satisfying . Values at tuples satisfying are unrestricted. When , the condition concerns the single empty tuple, whose value must be zero exactly when that tuple fails . When and , the tuple set is empty and the space consists only of the zero function.
QAlgorithms.Papers.Independent.Intakenext100.P94.tensorOuterProduct
For arbitrary natural numbers , a real tensor , and a real tensor , where , the definition returns a real function on tuples indexed by the disjoint union , given by
All parameters may be zero: an order-zero tensor is a scalar evaluated at the unique empty tuple, and if while , there are no tuples at which to evaluate the output.
QAlgorithms.Papers.Independent.Intakenext100.P94.tensorRowSum
For every natural number , every real-valued function on ordered pairs from , and every , this defines the real number , where denotes evaluation at the tuple whose first coordinate is and second coordinate is . For , there is no index to supply.
QAlgorithms.Papers.Independent.Intakenext100.P94.thirdFormula
For any natural number , let ; a tensor of order three is an arbitrary function . A recipe is a pair , where satisfies and for every , and consists only of fixed points of . A placed recipe with positions is such a recipe together with an injection . For a placed recipe , a tuple , and , define to be if both for every and for every , and otherwise; distinct values of impose no inequality requirement on . Let be the disjoint union of the placed recipes with three positions, pairs consisting of and a placed recipe with two positions, and placed recipes with one position. For , define in the first component; if , and otherwise, in the second component; and if all three coordinates of are equal, and otherwise, in the third component, where addition in the indices is modulo . For arbitrary weights , the definition returns the tensor
The parameter is included; in that case there are no triples or , and the output is the unique function on the empty set.
QAlgorithms.Papers.Independent.Intakenext100.P94.thirdKernel
For any natural number , take triples and a tagged index of one of three forms: , , or , where consists of data with , , for every , a finite subset of the fixed points of , and injective. For an -tuple , define to be if implies for every , and for every , and to be otherwise. The defined real-valued kernel is
Index additions in the middle summand are modulo , and has entries in that stated order. The middle summand requires no inequality involving , so it also applies when all entries of are equal. Empty sets impose no matching conditions, and for there are no possible input triples .
QAlgorithms.Papers.Independent.Intakenext100.P94.thirdShapes
For every natural number , this defines a function on the seven indices , whose respective values are the lists , , , , , , and . Every subtraction is natural-number subtraction, truncated at zero. All natural numbers , including zero, are allowed, and the definition imposes no condition that the resulting lists describe Young diagrams.
QAlgorithms.Papers.Independent.Intakenext100.P94.totalSum
For every natural number and every real-valued function on ordered pairs from , this defines the real number , summing over all ordered pairs, including those with equal coordinates. When , the sum is empty and equals zero.
QAlgorithms.Papers.Independent.Intakenext100.P94.vectorValues
For every natural number , a hypothesis , and every function , this defines a real-valued function on the left cosets of by , where is the chosen representative of . The hypothesis excludes ; for , both the underlying index set and the coset space have one element.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.