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

1 topic

8 results

Clear filters
Project-declaredLean 4.31.0

Linsolve always some berlekamp welch

BerlekampWelch.linsolve_always_some_berlekamp_welch

Plain-language statement

If only up to e errors happened linsolve cannot fail to find a solution.

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record
Project-declaredLean 4.31.0

Q' div E' eq p

BerlekampWelch.Q'_div_E'_eq_p

Plain-language statement

If there has happened up to e errors then any other E' and Q' satifying Berlekamp-Welch condition will result in the same quotient Q' \ E' = p.

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record
Project-declaredLean 4.31.0

Ps coprime case constant

ps_coprime_case_constant

Plain-language statement

If A and B are coprime and agree on sufficiently many lines, then A is constant.

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record
Project-declaredLean 4.31.0

Ps exists p

ps_exists_p

Plain-language statement

Main existence: if B/A agrees with low-degree quotients on enough lines, then A ∣ B.

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record
Project-declaredLean 4.31.0

Ps exists p nonzero

ps_exists_p_nonzero

Plain-language statement

Existence of P with B = P * A when both A and B are nonzero.

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record