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 6 research declarations. Search 10,000 more complete Mathlib declarations.
6 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.
frequently_in_finite_set
Plain-language statement
Note that only the → direction needs the finiteness assumption.
Source project: Automata Theory
Person-level attribution pending.
inf_occ_eventually
Plain-language statement
Over a finite type, xs k is in InfOcc xs for all sufficiently large k.
Source project: Automata Theory
Person-level attribution pending.
inf_occ_pair
Plain-language statement
Same as inf_acc_proj, but for pair types. This result does follow from inf_occ_proj, but that proof (see below) turns out to be longer.
Source project: Automata Theory
Person-level attribution pending.
inf_occ_proj
Plain-language statement
Note that only the ⊇ direction needs the finiteness assumptions.
Source project: Automata Theory
Person-level attribution pending.