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,903 to 1,908 of 2,569 results.
Polynomial.FoldingPolynomial.eval_property_of_folding_polynomial
Mathematical statement
A means to evaluate the original polynomial in terms of the folding polynomial.
Source project: ArkLib
Person-level attribution pending.
Polynomial.FoldingPolynomial.folded_poly_degree_bound
Mathematical statement
If we fold a polynomial using a folding polynomial Q with appropriate degree bounds in each variable we get a univariate polynomial with a degree bound.
Source project: ArkLib
Person-level attribution pending.
Polynomial.FoldingPolynomial.folding_polynomial_deg_x
Mathematical statement
The degree of the foldingPolynomial q f is precisely f.natDegree / q.natDegree in the first variable.
Source project: ArkLib
Person-level attribution pending.
Polynomial.FoldingPolynomial.folding_polynomial_deg_y_bound
Mathematical statement
The degree of foldingPolynomial is less than q.degree in the second variable, when q is not a constant polynomial.
Source project: ArkLib
Person-level attribution pending.
Polynomial.FoldingPolynomial.folding_polynomial_is_unique
Mathematical statement
The uniqueness of the folding polynomial.
Source project: ArkLib
Person-level attribution pending.
Polynomial.FoldingPolynomial.folding_polynomial_is_unique'
Project documentation
Alternative uniqueness theorem for the folding polynomial. The only difference is the h_x condition which in this theorem is only and inequality. Handy in practice since degreeX is defined as a supremum so inequality is much easier to prove for it.
Source project: ArkLib
Person-level attribution pending.