Source-pinned research

Research proof index

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 573 research declarations. Search 10,000 more complete Mathlib declarations.

1 topic

573 results

Clear filters
Project-declaredLean 4.31.0

Total Degree mul

Polynomial.Bivariate.totalDegree_mul

Plain-language statement

The total degree of the product of two bivariate polynomials is the sum of their total degrees.

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record
Project-declaredLean 4.31.0

Folding polynomial eq sum split Nth

Polynomial.folding_polynomial_eq_sum_splitNth

Plain-language statement

foldingPolynomial in terms of splitNth when q = X ^ n.

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record
Project-declaredLean 4.31.0

Eq zero of folding polynomial eq zero

Polynomial.FoldingPolynomial.eq_zero_of_folding_polynomial_eq_zero

Plain-language statement

If the folding polynomial is zero then so is the original polynomial.

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record
Project-declaredLean 4.31.0

Eval property of folding polynomial

Polynomial.FoldingPolynomial.eval_property_of_folding_polynomial

Plain-language statement

A means to evaluate the original polynomial in terms of the folding polynomial.

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record
Project-declaredLean 4.31.0

Folded poly degree bound

Polynomial.FoldingPolynomial.folded_poly_degree_bound

Plain-language 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.

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record
Project-declaredLean 4.31.0

Folding polynomial deg x

Polynomial.FoldingPolynomial.folding_polynomial_deg_x

Plain-language statement

The degree of the foldingPolynomial q f is precisely f.natDegree / q.natDegree in the first variable.

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record