Arbitrary-width block induction step #
This module pads arbitrary input widths to equal-block multiples, transports
the finite-step Shannon bound back across that padding, and exposes the
rate-raising theorem massProducesAt_step.
Padding arbitrary widths to equal blocks #
Smallest equal-block width whose complete input covers inputWidth.
Equations
- Algebraic.MassProduction.BlockInduction.blockCeil level inputWidth = inputWidth ⌈/⌉ (level + 1)
Instances For
Least multiple of level + 1 represented by the equal-block layout.
Equations
- One or more equations did not get rendered due to their size.
Instances For
theorem
Algebraic.MassProduction.BlockInduction.inputWidth_le_nextEqualBlockWidth
(level inputWidth : ℕ)
:
theorem
Algebraic.MassProduction.BlockInduction.shannonScale_nextEqualBlockWidth_le
(level inputWidth : ℕ)
(inputPositive : 0 < inputWidth)
:
theorem
Algebraic.MassProduction.BlockInduction.massProducesAt_step
(level numerator denominator : ℕ)
(levelAtLeastTwo : 2 ≤ level)
(denominatorPositive : 0 < denominator)
(rateBelowLevel : (level + 1) * numerator < level * denominator)
(previous : MassProducesAt (groupRateNumerator level denominator) (groupRateDenominator denominator * level))
:
MassProducesAt numerator denominator
The manuscript's equal-block induction step on arbitrary sufficiently large input widths.