Documentation

LeanPool.Erdos97ConvexOctagon.Radius

Erdős 97 convex-octagon formalization: Radius #

Two centres are mutually selected.

Equations
Instances For

    Two centres lie in the same connected component of mutual selections.

    Equations
    Instances For

      An undirected pair is labelled by the radius of a mutual component when one endpoint in that component selects the other.

      Equations
      Instances For
        theorem Erdos97Octagon.exists_positive_radii {p : VertexPlane} (hp : Function.Injective p) (Q : OctagonIncidence) (hR : Realises p Q) :
        ∃ (radius : Vertex), (∀ (v : Vertex), 0 < radius v) ∀ (v w : Vertex), w Q.targets vdist (p v) (p w) = radius v

        An injective realisation admits a positive radius at every centre.

        theorem Erdos97Octagon.radius_eq_of_mutual {p : VertexPlane} {Q : OctagonIncidence} {radius : Vertex} (hR : ∀ (v w : Vertex), w Q.targets vdist (p v) (p w) = radius v) {a b : Vertex} (hab : Q.Mutual a b) :
        radius a = radius b

        Mutual centres have equal radii in any realisation.

        theorem Erdos97Octagon.radius_eq_of_sameComponent {p : VertexPlane} {Q : OctagonIncidence} {radius : Vertex} (hR : ∀ (v w : Vertex), w Q.targets vdist (p v) (p w) = radius v) {a b : Vertex} (hab : Q.SameComponent a b) :
        radius a = radius b

        Radii are constant along a mutual connected component.

        theorem Erdos97Octagon.dist_eq_radius_of_labelledEdge {p : VertexPlane} {Q : OctagonIncidence} {radius : Vertex} (hR : ∀ (v w : Vertex), w Q.targets vdist (p v) (p w) = radius v) {root a b : Vertex} (hab : Q.LabelledEdge root a b) :
        dist (p a) (p b) = radius root

        A labelled edge has the radius of its mutual component.