Xie–Ma–Xin Lemma 4.12: cyclic partition of product samples
ProvedXMX.cyclic_product_partitionFor positive N and D=d+1, cyclic anchor-offset indexing is a bijection onto all D-coordinate sample-index tuples. For each fixed offset vector, every coordinate is a permutation of the N anchors. Thus the N^D indices partition into N^(D-1) coordinate-disjoint groups of N. Duplicate data values remain separate sample indices.
import Definitions.Def_XMX_NonstationaryInventory import Definitions.Def_XMX_CyclicPartition set_option autoImplicit false open MeasureTheory
namespace XMX
theorem cyclic_product_partition (N d : ℕ) (hN : 0 < N) :
Function.Bijective (fun p : ZMod N × (Fin d → ZMod N) => cyclicTuple N d p.1 p.2) ∧
∀ (offset : Fin d → ZMod N) (t : Fin (d + 1)),
Function.Bijective (fun anchor => cyclicTuple N d anchor offset t) := by sorry
end XMXRead-back
What the Lean code literally says, in plain math · gpt-6
For every positive natural number and every natural number , let be the ring of residues modulo . For and an offset vector , define the tuple by and for , with addition modulo . The map from to is bijective: every target tuple is attained by exactly one anchor-offset pair. In addition, for every fixed offset vector and every coordinate , the map from to is bijective. The case is included, with its single residue, and is included, with the unique empty offset vector and a one-coordinate tuple; is excluded by the positivity hypothesis.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.