Promotion and covariance of sums and outer products
ProvedQAlgorithms.Papers.Independent.Intakenext100.P94.promotion_aggregationLet be the injective child-to-parent correspondence and let be an order- child tensor. Define promotion by embedding each tensor index along and assigning zero off the image. For parent permutation and child permutation , relabel the correspondence as . Then
Finite sums of promoted activations transform covariantly, and the outer product of tensors of orders transforms covariantly as a tensor of order :
These operations provide the source’s sum and product aggregation rules on the parent domain. The correspondence must move with the relabelling. The zero extension fixes how contributions from overlapping child domains are combined.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P94
noncomputable section
namespace QAlgorithms.Papers.Independent.Intakenext100.P94
open scoped BigOperators
attribute [local instance] Classical.propDecidable
/-- Promotion and covariant sums/products, source PDF pp.5–6, Eq.(6).
Parent and child relabellings move chi to s∘chi∘p⁻¹. Empty domains/families
use the same finite-sum zero-extension convention. -/
theorem promotion_aggregation :
(∀ {m n k : ℕ} (chi : Fin m ↪ Fin n) (F : Tensor m k) u,
promote chi F (fun a => chi (u a)) = F u) ∧
(∀ {m n k : ℕ} (chi : Fin m ↪ Fin n) (s : Perm n) (p : Perm m) (F : Tensor m k),
promote (relabelEmbedding chi s p) (permutationTensorAction p F) =
permutationTensorAction s (promote chi F)) ∧
(∀ {n k : ℕ} {C : Type*} [Fintype C] (s : Perm n) (F : C → Tensor n k),
(∑ a, permutationTensorAction s (F a)) = permutationTensorAction s (∑ a, F a)) ∧
(∀ {n k l : ℕ} (s : Perm n) (F : Tensor n k) (G : Tensor n l) t,
tensorOuterProduct (permutationTensorAction s F) (permutationTensorAction s G) t =
tensorOuterProduct F G (fun a => s.symm (t a))) := by sorry
end QAlgorithms.Papers.Independent.Intakenext100.P94
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Writing , a real order- tensor on is an arbitrary function ; a permutation acts by ; and promotion along an injection is defined by , with an empty sum equal to . The theorem asserts the conjunction of four universally quantified identities. First, for all natural numbers , injections , tensors , and tuples , one has . Second, for all such , every permutation of , and every permutation of , one has
Third, for all natural numbers , every type equipped with a finite enumeration, every permutation of , and every family of tensors indexed by , one has . Fourth, for all natural numbers , permutations of , tensors and , and tuples , one has , where . All natural-number parameters may be zero, subject to the existence of the specified injections and tuples; zero-length tuples are unique, and the third identity also includes an empty indexing type , in which case both sides are the zero tensor.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.