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

1 topic

3 results

Clear filters
Project-declaredLean 4.31.0

Card filter eval subtype eq pi Finset

card_filter_eval_subtype_eq_piFinset

Plain-language statement

The number of elements in āˆ€ i, ↄ(S i) satisfying eval (↑·) f = 0 equals the number of elements in Fintype.piFinset (fun i => (S i).toFinset) satisfying eval Ā· f = 0.

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record
Project-declaredLean 4.31.0

Prob eval zero le div

prob_eval_zero_le_div

Plain-language statement

Probability of a nonzero polynomial evaluating to zero over a uniform product distribution is at most d / m, where d bounds the total degree and m bounds below the cardinality of each factor. This bridges schwartz_zippel_counting with the probability formulation.

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record
Project-declaredLean 4.31.0

Schwartz zippel counting

schwartz_zippel_counting

Plain-language statement

For a nonzero multivariate polynomial f of total degree at most d, evaluated over a product of finite subsets of a field F, each of cardinality at least m, the number of roots is at most d / m multiplied by the side of the product set.

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record