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 136 research declarations. Search 10,000 more complete Mathlib declarations.
136 results
Clear filtersCslib.ωLanguage.IsRegular.sup
Plain-language statement
The union of two ω-regular languages is ω-regular.
Source project: Lean Computer Science Library
Person-level attribution pending.
Cslib.ωLanguage.omegaPow_seq_prop
Plain-language statement
An alternative characterization of l^ω.
Source project: Lean Computer Science Library
Person-level attribution pending.
Cslib.ωSequence.cons_flatten
Plain-language statement
ls.flatten equals the concatenation of ls.head and ls.tail.flatten.
Source project: Lean Computer Science Library
Person-level attribution pending.
Cslib.ωSequence.frequently_in_finite_type
Plain-language statement
In a finite type, the elements of a set occurs infinitely often iff some element in the set occurs infinitely often.
Source project: Lean Computer Science Library
Person-level attribution pending.
Cslib.ωSequence.frequently_in_strictMono
Plain-language statement
If p is true infinitely often, then p is true in infinitely many segments of any strictly monotonic function f.
Source project: Lean Computer Science Library
Person-level attribution pending.
Finset.Shatters.toSetShatters
Plain-language 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.
Source project: Lean Computer Science Library
Person-level attribution pending.