Parameters for Uhlig mass production #
This module chooses the logarithmic prefix width used by the sharp theorem and proves an explicit polynomial bound for the overhead of one recursive Uhlig layer.
We spend twice the binary logarithm of the ambient input length per
two-copy layer. This makes the ordinary resource population at least the
ambient input length while still costing only O(log n) variables per
layer.
Equations
- Algebraic.MassProduction.UhligTheorem.uhligPrefixWidth inputs = 2 * Nat.log 2 inputs
Instances For
Inputs left for the terminal one-copy synthesis.
Equations
- Algebraic.MassProduction.UhligTheorem.uhligBaseWidth depth inputs = inputs - depth * Algebraic.MassProduction.UhligTheorem.uhligPrefixWidth inputs
Instances For
theorem
Algebraic.MassProduction.UhligTheorem.two_pow_uhligPrefixWidth_le_square
(inputs : ℕ)
(inputsPositive : 0 < inputs)
:
theorem
Algebraic.MassProduction.UhligTheorem.input_le_two_pow_uhligPrefixWidth
(inputs : ℕ)
(inputsLarge : 2 ≤ inputs)
:
theorem
Algebraic.MassProduction.UhligTheorem.layerOverheadEnvelope_eq
(prefixWidth suffixWidth : ℕ)
:
Expanded polynomial for the cost of one pair-factored Uhlig layer.
theorem
Algebraic.MassProduction.UhligTheorem.layerOverheadEnvelope_uhligPrefixWidth_le
(inputs : ℕ)
(inputsLarge : 2 ≤ inputs)
:
With the chosen logarithmic prefix, the entire pair-factored layer overhead is bounded by a fixed degree-eight monomial.