Source-pinned research
Search theorem names, mathematical ideas, modules, topics, projects, and role-labelled researchers. Open a result for its complete indexed Lean declaration and source record.
This index contains 2,569 research declarations. Search 10,000 more complete Mathlib declarations.
Showing 1,909 to 1,914 of 2,569 results.
Polynomial.FoldingPolynomial.polyFold_base
Mathematical statement
Base case of polyFold: when k = 0 or f has degree below k, polyFold f k r = C (f.eval r).
Source project: ArkLib
Person-level attribution pending.
Polynomial.FoldingPolynomial.polyFold_natDegree_le
Mathematical statement
The degree bound of polyFold in terms of the degree of the original polynomial and k.
Source project: ArkLib
Person-level attribution pending.
Polynomial.FoldingPolynomial.polyFold_step
Mathematical statement
Recursive case of polyFold: when 0 < k ≤ f.natDegree, polyFold f k r = C ((f %ₘ X^k).eval r) + X * polyFold (f /ₘ X^k) k r.
Source project: ArkLib
Person-level attribution pending.
Polynomial.indicator_eq_1_of_neg_empty_empty_of_pos_nonempty
Mathematical statement
The indicator polynomial is a constant one polynomial if the set neg is empty while pos is not.
Source project: ArkLib
Person-level attribution pending.
Polynomial.indicator_eq_1_on_pos
Mathematical statement
Indicator evaluated on an element of pos is equal to 1.
Source project: ArkLib
Person-level attribution pending.
Polynomial.indicator_ne_zero_of_pos_nonempty
Mathematical statement
If pos is non-empty then the indicator polynomial is the constant zero polynomial.
Source project: ArkLib
Person-level attribution pending.