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

All topics

423 results

Clear filters
Project-declaredLean 4.31.0

Root Multiplicity le of coeff ne zero

GuruswamiSudan.rootMultiplicity_le_of_coeff_ne_zero

Plain-language statement

If the (s, t)-coefficient of shift Q x y is non-zero, then the root multiplicity of Q at (x, y) is at most s + t.

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record
Project-declaredLean 4.31.0

Roots le degree of deg lt roots

GuruswamiSudan.roots_le_degree_of_deg_lt_roots

Plain-language statement

If a polynomial R has roots at points indexed by A with multiplicity at least m, and its degree is strictly less than m * |A|, then R must be the zero polynomial.

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record
Project-declaredLean 4.31.0

Sufficient multiplicity bound

GuruswamiSudan.sufficient_multiplicity_bound

Plain-language statement

The degree bound is strictly less than m times the number of agreement points, provided the distance is within the Johnson radius.

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record
Project-declaredLean 4.31.0

To Polynomial degree le

GuruswamiSudan.toPolynomial_degree_le

Plain-language statement

The polynomial corresponding to a codeword has degree at most k-1.

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record
Project-declaredLean 4.31.0

Principal is maximal iff irred

Ideal.principal_is_maximal_iff_irred

Project documentation

A principal ideal is an ideal generated by a single element. -/ def principalIdeal {F : Type} [Semiring F] (f : F) : Ideal F := Ideal.span {f} /- A principal ideal in a polynomial ring is maximal if and only if its generator is an irreducble polynomial.

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record
Project-declaredLean 4.31.0

Interleaved affine gaps imply tensor gaps

interleaved_affine_gaps_imply_tensor_gaps

Project documentation

inductively to each such matrix, we conclude that, for each r_{ϑ-1} ∈ R*, d^{2^{ϑ-1}}((1-r_{ϑ-1}) · U₀ + r_{ϑ-1} · U₁, C^{2^{ϑ-1}}) ≤ e -/ lemma correlatedAgreement_of_mem_R_star_tensor {ϑ_pred : ℕ} (ih : δ_ε_multilinearCorrelatedAgreement_Nat (F := F) (A := A) (ι := ι) (C := MC) (ϑ := ϑ_pred) (e := e) (ε := ε)) (u : Fin (2 ^ (ϑ_pred + 1)) → (Word A ι...

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record