FormalConjectures/WrittenOnTheWallII/GraphConjecture5.lean

GitHub source file

Explanation legend Lean4 Domain Explanation Language (L4DEL)

L4DEL explanations are a separate layer. They do not change the Lean source. Intuition is explanatory prose; numbered items are a reading path; sources link the wording back to evidence.

L4DEL
Lean4 Domain Explanation Language

Credit: The upstream authors and contributors retain credit for the project and mathematics. lean4-explainer only renders their pinned source and adds the separately disclosed explanation layer.

Project sources: Pinned project documentation, Formal Conjectures paper, arXiv v1

1 declarations, 1 contain sorry, 0 declared as axioms

Written on the Wall II - Conjecture 5

Reference: E. DeLaVina, Written on the Wall II, Conjectures of Graffiti.pc

Imports (1)
  1. theorem WrittenOnTheWallII.GraphConjecture5.conjecture5 WOWII Conjecture 5 For a simple connected graph G, Ls(G) is bounded below by the maximal size of a sphere of radius radius(G) around the centres of G sorry line 45 source

    Source documentation

    WOWII Conjecture 5

    For a simple connected graph G, Ls(G) is bounded below by the maximal size of a sphere of radius radius(G) around the centres of G.

    L4DEL explanation

    WOWII Conjecture 5 For a simple connected graph G, Ls(G) is bounded below by the maximal size of a sphere of radius radius(G) around the centres of G.

    Sources and attribution: Pinned Lean source (1646ca16afd6)

    depends on sorry what this means

    Statement uses: Fintype, DecidableEq, Nontrivial, SimpleGraph, SimpleGraph.Connected, LE.le, Real, SupSet.sSup, Set.image, Finset.card, Finset.filter, Membership.mem, Set, Set.ofPred, Eq, Nat, SimpleGraph.dist, ENat.toNat, SimpleGraph.radius, Finset.univ and 5 more

    Proof uses: sorryAx, Lean.Name, Bool.false, Lean.Name.num, Lean.Name.str, Lean.Name.anonymous, OfNat.ofNat

    15 instances, coercions and auxiliary constants left out.

    Tactic trace: 1 steps

    Open to load the checked before-and-after goal states.

    theorem conjecture5 (G : SimpleGraph V) (h_conn : G.Connected) :
        letI centers := { v : V | G.eccent v = G.radius }
    …