Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Xie–Ma–Xin Lemma 4.12: cyclic partition of product samples

Proved
XMX.cyclic_product_partition

by visuddhi · Oct 8, 2026 · Mathlib 0df444a (Lean v4.33.1)

inventorylearning-theoryprobability

For 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.

Preamble
import Definitions.Def_XMX_NonstationaryInventory
import Definitions.Def_XMX_CyclicPartition

set_option autoImplicit false
open MeasureTheory
Formal statement
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 XMX
Source
Yaqi Xie, Will Ma, Linwei Xin, VC Theory for Inventory Policies, arXiv:2404.11509v3 (2026-02-01), Lemma 4.12, Section 4.5
Read-back

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

For every positive natural number NNN and every natural number ddd, let Z=Z/NZZ=\mathbb Z/N\mathbb ZZ=Z/NZ be the ring of residues modulo NNN. For a∈Za\in Za∈Z and an offset vector δ:{0,…,d−1}→Z\delta:\{0,\ldots,d-1\}\to Zδ:{0,…,d−1}→Z, define the tuple C(a,δ):{0,…,d}→ZC(a,\delta):\{0,\ldots,d\}\to ZC(a,δ):{0,…,d}→Z by C(a,δ)0=aC(a,\delta)_0=aC(a,δ)0​=a and C(a,δ)j+1=a+δjC(a,\delta)_{j+1}=a+\delta_jC(a,δ)j+1​=a+δj​ for 0≤j<d0\le j<d0≤j<d, with addition modulo NNN. The map (a,δ)↦C(a,δ)(a,\delta)\mapsto C(a,\delta)(a,δ)↦C(a,δ) from Z×Z{0,…,d−1}Z\times Z^{\{0,\ldots,d-1\}}Z×Z{0,…,d−1} to Z{0,…,d}Z^{\{0,\ldots,d\}}Z{0,…,d} is bijective: every target tuple is attained by exactly one anchor-offset pair. In addition, for every fixed offset vector δ\deltaδ and every coordinate t∈{0,…,d}t\in\{0,\ldots,d\}t∈{0,…,d}, the map a↦C(a,δ)ta\mapsto C(a,\delta)_ta↦C(a,δ)t​ from ZZZ to ZZZ is bijective. The case N=1N=1N=1 is included, with its single residue, and d=0d=0d=0 is included, with the unique empty offset vector and a one-coordinate tuple; N=0N=0N=0 is excluded by the positivity hypothesis.

Human review
  • Endorsed by Shuze Chen · Oct 15, 2026

    Confirmed by the moderator at approval.

  • Endorsed by visuddhi · Oct 15, 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