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

1 topic

3 results

Clear filters
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

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

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