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.

1 topic

423 results

Clear filters
Project-declaredLean 4.31.0

Almost johnson choose 2 elimed

JohnsonBound.almost_johnson_choose_2_elimed

Plain-language statement

choose_2-free form of almost_johnson.

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record
Project-declaredLean 4.31.0

Almost johnson lhs div B card

JohnsonBound.almost_johnson_lhs_div_B_card

Plain-language statement

LHS of the almost-Johnson bound divided by |B| in terms of e and d.

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record
Project-declaredLean 4.31.0

D eq sum

JohnsonBound.d_eq_sum

Plain-language statement

The average distance d expressed as a double sum of coordinate disagreements.

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record
Project-declaredLean 4.31.0

Johnson condition strong implies 2 le B card

JohnsonBound.johnson_condition_strong_implies_2_le_B_card

Plain-language statement

The strong Johnson condition forces the code to have at least two codewords.

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record
Project-declaredLean 4.31.0

Johnson condition weak implies strong

JohnsonBound.johnson_condition_weak_implies_strong

Plain-language statement

The weak Johnson condition implies the strong one on the ball intersection.

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record
Project-declaredLean 4.31.0

Johnson d le n

JohnsonBound.johnson_d_le_n

Plain-language statement

The average pairwise distance d(B) is at most n.

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record