Polynomial-time substitution of a unary-specified positive power #
Substitute X^(u.length+1) by inserting the requested number of zero coefficients.
The exponent is positive by construction; an empty unary parameter means substitution by X.
Equations
- MIPRE.LowDegree.BinaryPolynomial.substitutePowerBits a u = MIPRE.LowDegree.BinaryPolynomial.normalizeBits (List.flatMap (fun (b : Bool) => b :: List.replicate (List.length u) false) a)
Instances For
theorem
MIPRE.LowDegree.BinaryPolynomial.evalBits_substitutePowerBits
{R : Type u_1}
[CommRing R]
(z : R)
(a : Cost.BitStr)
(u : Cost.Unary)
:
Substitution has the expected Horner semantics in every commutative ring.
theorem
MIPRE.LowDegree.BinaryPolynomial.polyOfBits_substitutePowerBits
(a : Cost.BitStr)
(u : Cost.Unary)
:
The executable substitution agrees with Mathlib polynomial composition.
Equations
- One or more equations did not get rendered due to their size.
Instances For
Equations
- One or more equations did not get rendered due to their size.
Instances For
A fixed ambient program for positive-power substitution on arbitrary coefficient lists.
Equations
- One or more equations did not get rendered due to their size.
Instances For
@[simp]
theorem
MIPRE.LowDegree.BinaryPolynomial.substitutePowerBitsProg_apply
(a : Cost.BitStr)
(u : Cost.Unary)
: