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

Take drop add Cases

Fin.take_drop_addCases'

Plain-language statement

The concatenation of the first m elements and the last n - m elements of a tuple is the same as the original tuple.

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record
Project-declaredLean 4.31.0

Card filter prod self eq

Finset.card_filter_prod_self_eq

Plain-language statement

The diagonal of s × s has the same cardinality as s.

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record
Project-declaredLean 4.31.0

Card pick subset

Finset.card_pick_subset

Plain-language statement

The cardinality of picked subset is min s.card n.

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record
Project-declaredLean 4.31.0

Card prod self eq

Finset.card_prod_self_eq

Plain-language statement

The diagonal of s × s (intersection form) has the same cardinality as s.

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record
Project-declaredLean 4.31.0

Gs degree bound div lt

gs_degree_bound_div_lt

Plain-language statement

The GS degree bound with m=1 divided by (k-1) is less than F when |F| ≥ 5 and the RS code is non-degenerate (k+1 ≤ n ≤ F).

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record