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 filtersNat.segment'_eq_segment
Plain-language statement
For a strictly monotonic function f : ℕ → ℕ, segment' f and segment f are actually equal.
Source project: Lean Computer Science Library
Person-level attribution pending.
Relation.LocallyConfluent.Terminating_toConfluent
Project documentation
Newman's lemma: a terminating, locally confluent relation is confluent.
Source project: Lean Computer Science Library
Person-level attribution pending.
Turing.MultiTapeTM.halting_step_unique
Plain-language statement
If a Turing machine halts, the time step is uniquely determined.
Source project: Lean Computer Science Library
Person-level attribution pending.
Turing.MultiTapeTM.relatesInSteps_iff_configs_eq
Project documentation
This lemma translates between the relational notion and the iterated step notion. The latter can be more convenient especially for deterministic machines as we have here.
Source project: Lean Computer Science Library
Person-level attribution pending.