Lax Lean Archive

Draft — mutable and not usable as a dependency; its citation marks the draft state.

Lax68.TriangulationPlanar

Triangulations of planar graphs are planar

concepts/Lax68/TriangulationPlanar.lean · lax-68

proven

Loading review…

Community review

Flags

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

No flags have been submitted.

    Community review

    Flag this concept

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

    No source line selected.

    Concept map

    Proven claimDefinitionThis conceptRelated conceptA → B: B builds on A

    Evidence

    Each proof establishes this claim relative to its assumptions.

    Theorem

    If T is a triangulation of a planar graph G, then T is planar.

    Lean source view on GitHub

    1import Lax68.Triangulations
    2import Lax68.Planar
    3
    4/-!
    5---
    6title: Triangulations of planar graphs are planar
    7type: theorem
    8---
    9If T is a triangulation of a planar graph G, then T is planar.
    10-/
    11
    12set_option autoImplicit false
    13
    14namespace Lax68.TriangulationPlanar
    15
    16axiom triangulationOf_planar {V : Type*}
    17 {G T : SimpleGraph V} :
    18 Lax68.Planar.IsPlanar G →
    19 Lax68.Triangulations.IsTriangulationOf G T →
    20 Lax68.Planar.IsPlanar T
    21
    22end Lax68.TriangulationPlanar
    23
    Show Proof

    Builds on

    Used by

    none

    From Mathlib

    none

    Community review

    Discussion

    Ask a question or add context. Endorsements and structured flags are kept in the review panel above; your ORCID profile must share a public name.

    0 comments

    Loading discussion…