Explain the Lean theorem `exists_sequential_schedule` in module `IndisputableMonolith.Foundation.Atomicity`. Write for an educated reader who knows science and programming but may not know Lean. Cover: (1) what the declaration says in plain English, (2) why it matters in Recognition Science, (3) how to read the formal statement, (4) visible dependencies or certificates in the supplied source, and (5) what this declaration does not prove. Cite only declarations present in the supplied Recognition source.

permalink: https://pith.science/recognition/ask/explain-the-lean-theorem-exists-sequential-schedule-in-modul-b916bfa8 · first asked 2026-05-17 · browse all asks

confidence: high in recognition cached

Explanation of exists_sequential_schedule in IndisputableMonolith.Foundation.Atomicity

(1) In plain English: For any finite set of events H equipped with a well-founded, decidable precedence relation prec (where prec e₁ e₂ means event e₁ must occur before e₂), there exists a schedule: a list of distinct events that contains every element of H exactly once and places earlier events before later ones whenever precedence requires it. This list serves as a one-event-per-tick ordering.

(2) Why it matters in Recognition Science: The declaration supplies a constructive, axiom-free serialization result for finite recognition histories. It tightens T2 (discreteness) by guaranteeing that any finite ledger of recognition events admits a topological ordering into sequential atomic ticks while preserving precedence and conservation properties, without external assumptions.

(3) How to read the formal statement: The theorem takes a precedence relation prec : Precedence E, decidability instances, a WellFounded prec proof wf, and a Finset E history H. It asserts existence of a Schedule E record whose order field is a duplicate-free list whose toFinset equals H and whose indexOf positions strictly increase along any prec pair.

(4) Visible dependencies or certificates in the supplied source: The proof invokes the recursive minimal-element removal defined by topoSort, the permutation property proved in topoSort_perm, and the precedence-respecting index ordering proved in topoSort_respects. It is called by atomic_tick and supports the generic preservation result sequential_preserves_conservation. All proofs are constructive over Finset with no sorry or added axioms.

(5) What this declaration does not prove: It establishes existence only for finite histories (Finset E); the supplied source begins but does not complete a countable serialization construction in the Countable section. It assumes well-foundedness of prec rather than deriving it from Recognition Science primitives and provides no uniqueness or complexity bounds on the resulting schedule.

cited recognition theorems

Atomicity.exists_sequential_schedule Core declaration whose plain-English meaning, RS role, and formal reading are requested.
Atomicity.topoSort Recursive helper used in the proof to construct the ordering by repeated minimal-element removal.
Atomicity.topoSort_perm Lemma establishing that the constructed list is a duplicate-free permutation of the input Finset.
Atomicity.topoSort_respects Lemma proving that the ordering preserves precedence via strictly increasing indexOf positions.
Atomicity.atomic_tick Downstream theorem that directly invokes exists_sequential_schedule to state atomicity for finite histories.
Atomicity.sequential_preserves_conservation Generic preservation lemma that builds on the schedule existence result.

outside recognition

Aspects Recognition does not yet address:

Derivation of well-foundedness of precedence from Recognition Science axioms
Completion of the countable serialization construction begun in the Countable section
Explicit linkage to the T2 theorem in UnifiedForcingChain

recognition modules consulted

The Recognition library is at github.com/jonwashburn/shape-of-logic. The model is restricted to the supplied Lean source and instructed not to invent theorem names. Treat output as a starting point, not a verified proof.