Proposition 25 — exact composition under independent concatenation
ProvedSpaceReset.Hardness.proposition_25coding-theoryp2o-batch-stoc27ap2o-gran-per-chapterp2o-plan-paperp2o-v1trellis
Let , , be ordered sources of full row rank with invariants . Their direct-sum code, in that block order, satisfies
Appending an independent coordinate to a source therefore leaves unchanged and raises only up to the total rank; Theorem 2's yes case uses this.
Differences from the source:
- encoding: maxima over an index set of blocks → Finset.sup over Fin m (value 0 for m = 0); reason: the empty family has c = Π = 0, which the formula gives
Preamble
import Mathlib import Definitions.Def_SpaceReset_Hardness_Trellis set_option autoImplicit false
Formal statement
namespace SpaceReset.Hardness
/-- Proposition 25 (Exact composition under independent concatenation), App. B.1, p. 38. -/
theorem proposition_25 {m : ℕ} {k n : Fin m → ℕ}
(G : (i : Fin m) → Matrix (Fin (k i)) (Fin (n i)) F2) (hG : ∀ i, FullRowRank (G i)) :
cInv (directSum G) = Finset.univ.sup (fun i => cInv (G i)) ∧
PiInv (directSum G) = max (∑ i, k i) (Finset.univ.sup (fun i => PiInv (G i))) := by sorry
end SpaceReset.Hardness
Source
Rinka Miura, STOC 2027 submission #1715 (October 2026), Proposition 25, App. B.1, p. 38
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.