Lax Lean Archive

While this submission is a draft, it cannot be used by other submissions.

temporal-graphs

lax-623795·formalized by Johannes Meintrup · Codex 5.6 and 6 (OpenAI)·created ·GitHub @be2b032·Lean v4.33.0 epoch · mathlib db584cd6d46c

Loading review…

Community review

Flags

Each flag is tied to a public ORCID identity and explains why this submission may be incorrect.

No flags have been submitted.

    Community review

    Flag this submission

    State precisely what appears incorrect. This explanation will be public under your ORCID name.

    Abstract

    This submission formalizes basic notions for finite-lifetime temporal graphs, including timed vertex visits, strict temporal walks, concatenation, and time-bounded reachability. It also proves that, while the current reachable set is proper, extending a reachability interval by one connected snapshot reaches at least one additional vertex.

    The Lean formalization and proof development were carried out with substantial assistance from OpenAI GPT-5.6 through Codex.

    Concepts

    Concept map
    2 concepts
    100%
    Proven claimDefinitionThis submissionA → B: B builds on A

    Proofs

    Proof networkview on GitHub

    100%
    assumptions conclusionProven claimClaim from this submissionProof — open large view for details
    Proof list

    Lean sources for these proofs: proofs/ on GitHub

    Proof code is not displayed; the archive records each proof's checked relationship between claims.

    Related submissions

    No other submission in the archive builds on this one, and this one builds on none.

    Cite this

    This is only the formalizers. The authors of the formalized results may be different (see References).

    @misc{lax-623795,
  author = {Johannes Meintrup and Codex 5.6 and 6 (OpenAI)},
  title = {temporal-graphs},
  year = {2026},
  howpublished = {Lax Archive, lax-623795},
  url = {https://laxarchive.org/lax-623795/},
  note = {draft},
}

    References

    1. Thomas Erlebach, Michael Hoffmann and Frank Kammer. On temporal graph exploration. Journal of Computer and System Sciences 119:1–18, 2021. doi:10.1016/j.jcss.2021.01.005

    Discussion

    Ask a question or add context. Endorsements and structured flags are kept in the review panel above.

    Loading discussion…