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

2569 results

Project-declaredLean 4.31.0

Relative Unique Decoding Radius RS eq

ReedSolomon.relativeUniqueDecodingRadius_RS_eq

Plain-language statement

Relative unique decoding radius for RS code with arbitrary finite index type ι.

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record
Project-declaredLean 4.31.0

To Polynomial mem lt deg

ReedSolomon.toPolynomial_mem_lt_deg

Plain-language statement

The polynomials corresponding to Reed-Solomon codewords are of degree smaller than deg.

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record
Project-declaredLean 4.21.0-rc3

Refined Count Triples Star is Big O B

refinedCountTriplesStar_isBigO_B

Project documentation

The value of d chosen in proposition 2.6 -/ noncomputable def d (ε : ℝ) : ℕ := ⌊10 * ε⁻¹ ^ 4⌋₊ /- Proposition 2.7. Reformulated slightly in terms of the existence of a Finset whose elements have certain properties. As it stands the statement in the blueprint implicitly assumes that this Finset is nonempty. That might be true, but is rather annoying...

number theoryABC conjectureDiophantine equations

Source project: ABC Exceptions

Person-level attribution pending.

View proof record
Project-declaredLean 4.24.0-rc1

Reg lang concat e

reg_lang_concat_e

Project documentation

Helper lemma for reg_lang_concat below.

automata theoryformal languagescomputer science

Source project: Automata Theory

Person-level attribution pending.

View proof record
Project-declaredLean 4.24.0-rc1

Reg lang concat ne

reg_lang_concat_ne

Project documentation

Helper lemma for reg_lang_concat below.

automata theoryformal languagescomputer science

Source project: Automata Theory

Person-level attribution pending.

View proof record
Project-declaredLean 4.24.0-rc1

Reg lang epsilon

reg_lang_epsilon

Plain-language statement

The language {[]} is regular.

automata theoryformal languagescomputer science

Source project: Automata Theory

Person-level attribution pending.

View proof record