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.
Source project: ArkLib
Person-level attribution pending.
Source-pinned research
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.
423 results
Clear filtersFin.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.
Source project: ArkLib
Person-level attribution pending.
Finset.card_filter_prod_self_eq
Plain-language statement
The diagonal of s × s has the same cardinality as s.
Source project: ArkLib
Person-level attribution pending.
Finset.card_pick_subset
Plain-language statement
The cardinality of picked subset is min s.card n.
Source project: ArkLib
Person-level attribution pending.
Finset.card_prod_self_eq
Plain-language statement
The diagonal of s × s (intersection form) has the same cardinality as s.
Source project: ArkLib
Person-level attribution pending.
Groups.simulateQ_randomOracle_sampleNonzeroZMod
Plain-language statement
Simulating the random oracle leaves the nonzero SRS trapdoor sampler unchanged.
Source project: ArkLib
Person-level attribution pending.
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).
Source project: ArkLib
Person-level attribution pending.