Skip to main content

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

All topics

Showing 1,897 to 1,902 of 2,569 results.

Project-declaredLean 4.32.0

Polynomial tanh bounded

polynomial_tanh_bounded

Mathematical statement

For a polynomial P, show that P (tanh x) is bounded on the real line

physicsquantum field theoryrelativity

Source project: Physlib

Person-level attribution pending.

View proof record
Project-declaredLean 4.31.0

Degree X le degree X sub degree X

Polynomial.Bivariate.degreeX_le_degreeX_sub_degreeX

Project documentation

If a non-zero bivariate polynomial f divides a non-zero bivariate polynomial g, then all the coefficients of the quoetient are non-zero. -/ @[grind .] lemma coeff_ne_zero {f q : F[X][Y]} (hg : q * f ≠ 0) : q.coeff ≠ 0 := (ne_zero_iff_coeffs_ne_zero q).1 (quotient_nezero hg) /- If q * f ≠ 0, then the X-degree of q is bounded above by the differen...

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record
Project-declaredLean 4.31.0

Exists max index total Degree

Polynomial.Bivariate.exists_max_index_totalDegree

Mathematical statement

There exists a maximal Y-index achieving totalDegree. Above it, total-degree contributions are strictly smaller or the coefficient vanishes.

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record
Project-declaredLean 4.31.0

Total Degree mul

Polynomial.Bivariate.totalDegree_mul

Mathematical 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

Mathematical 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

Mathematical 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