Skip to main content

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 2,569 curated research declarations and 119,070 complete package declarations. Search 10,000 more complete Mathlib declarations.

All topics

Showing 1,123 to 1,128 of 2,569 results.

Project-declaredLean 4.31.0

Card filter prod self eq

Finset.card_filter_prod_self_eq

Mathematical 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

Mathematical 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

Mathematical 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.33.0-rc1

Finset Shatters to Set Shatters

Finset.Shatters.toSetShatters

Mathematical statement

If a finite set family 𝒜 shatters a finite set s in the sense of Mathlib's Finset.Shatters, then the concept class of characteristic functions of sets in 𝒜 shatters ↑s in the sense of SetShatters. This bridges Mathlib's finset-based shattering to the predicate used by the PAC learning lower bounds.

computer sciencecomputabilityprogram semantics

Source project: Lean Computer Science Library

Person-level attribution pending.

View proof record
Project-declaredLean 4.32.0

Almost Complete

Fischlin.almostComplete

Mathematical statement

Almost completeness of the Fischlin transform: if the underlying Σ-protocol is perfectly complete, then the signature scheme verifies with probability at least 1 - completenessError ρ b S t where t = FinEnum.card Chal is the challenge space size. Unlike the Fiat-Shamir transform (which is perfectly complete), the Fischlin transform has a non-zero comp...

program verificationseparation logiccryptography

Source project: VCVio

Person-level attribution pending.

View proof record