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 199 research declarations. Search 10,000 more complete Mathlib declarations.
199 results
Clear filtersCslib.ω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.
det_muller_lang_concat
Plain-language statement
The concatenation of a regular language and a deterministic Muller language is a deterministic Muller language.
Source project: Automata Theory
Person-level attribution pending.
det_muller_lang_imp_omega_reg_lang
Plain-language statement
Every deterministic Muller language is an ω-regular language.
Source project: Automata Theory
Person-level attribution pending.
det_muller_lang_inter
Plain-language statement
Deterministic Muller languages are closed under intersection.
Source project: Automata Theory
Person-level attribution pending.
det_muller_lang_union
Plain-language statement
Deterministic Muller languages are closed under union.
Source project: Automata Theory
Person-level attribution pending.