Documentation

LeanPool.ClassificationOfSurfaces.Moise.IntrinsicGraphApproximation

Polygonal approximation of intrinsic finite graphs #

This file ports the source-independent part of Moise Chapter 6, Theorem 2 from plane complexes to canonical barycentric realizations. The target geometry is unchanged: finitely many compact embedded arcs admit uniform disjoint vertex disks and nonincident edge tubes.

Uniform target disks around the images of the used intrinsic vertices.

Instances For

    The finite uniform vertex-disk construction for an intrinsic embedded graph.

    All intrinsic vertex and nonincident-edge separation properties survive shrinking the common target radius.

    Equations
    Instances For

      Intrinsic vertex-disk controls can be chosen below any prescribed positive radius.

      A globally defined version of an intrinsic mapped edge, clamped to the unit interval.

      Equations
      Instances For

        The two ordered circle crossings delimiting the central part of an intrinsic mapped edge.

        Instances For

          Moise's two-sided last-exit construction for an intrinsic edge.

          The compact middle of an intrinsic edge after removing its two vertex-disk ends.

          Equations
          Instances For

            A chosen last-exit trim for each intrinsic edge.

            Equations
            Instances For

              Pairwise-disjoint closed tubes around all trimmed central intrinsic arcs.

              Instances For

                A polygonal replacement for one trimmed central intrinsic arc, kept inside its tube.

                Instances For

                  The centralPolygonalArc declaration.

                  Equations
                  Instances For

                    A simple parameterization of the polygonal replacement, normalized to the unit interval.

                    Instances For

                      The ordered exits of the polygonal middle from the two endpoint disks.

                      Equations
                      Instances For

                        The leftSpoke declaration.

                        Equations
                        Instances For

                          The complete replacement carrier of one intrinsic edge.

                          Equations
                          Instances For

                            The trimmed polygonal middle as a path.

                            Equations
                            Instances For

                              The complete polygonal replacement path for one intrinsic edge.

                              Equations
                              Instances For

                                Every complete intrinsic replacement edge is a simple path.

                                Distinct intrinsic replacement edges have disjoint relative interiors.

                                The image of either abstract endpoint belongs to its replacement edge carrier.

                                theorem LeanEval.Topology.ClassificationOfSurfaces.Moise.IntrinsicTwoComplex.CentralPolygonalArc.exists_shared_vertex_of_mem_completeCarriers {K : IntrinsicTwoComplex} {h : K.realizationPlane} {hcont : Continuous h} {hinj : Function.Injective h} {D : K.VertexDiskControl h} {C : K.CentralTubeControl hcont hinj D} {e d : K.Edge} {A' : K.CentralPolygonalArc hcont hinj D C d} (A : K.CentralPolygonalArc hcont hinj D C e) (hed : e d) {x : Plane} (hx : x A.completeCarrier) (hx' : x A'.completeCarrier) :
                                ∃ (v : K.UsedVertex), v e d x = h (K.vertexPoint v)

                                Distinct replacement edges can meet only at the image of an abstract vertex belonging to both edges. This is the exact face-to-face statement behind the polygonal boundary of every intrinsic triangle.

                                The selected polygonal replacement for an intrinsic edge.

                                Equations
                                Instances For

                                  Consecutive replacement edges around one intrinsic face meet exactly at the image of their shared cyclic vertex.

                                  A point is an active graph vertex when it is a canonical used-vertex point.

                                  Equations
                                  Instances For

                                    The unique unit-interval parameter of a point on an intrinsic edge.

                                    Equations
                                    Instances For

                                      A chosen intrinsic edge through a point of the one-skeleton.

                                      Equations
                                      Instances For

                                        The edgewise replacement map, expressed on the intrinsic edge carrier.

                                        Equations
                                        Instances For

                                          Simultaneous replacement of every intrinsic edge. Vertices are handled first, so the definition is independent of the arbitrary chosen incident edge.

                                          Equations
                                          Instances For

                                            The simultaneous intrinsic edge replacement is continuous on the entire one-skeleton.

                                            The simultaneous intrinsic graph replacement is injective on the one-skeleton.

                                            The topological part of the intrinsic one-skeleton approximation: a continuous embedding assembled from finitely many polygonal edge paths.

                                            theorem LeanEval.Topology.ClassificationOfSurfaces.Moise.IntrinsicTwoComplex.graphReplacementMap_dist_lt_two_mul (K : IntrinsicTwoComplex) {h : K.realizationPlane} (hcont : Continuous h) (hinj : Function.Injective h) (D : K.VertexDiskControl h) (C : K.CentralTubeControl hcont hinj D) {η : } (hsmall : ∀ (e : K.Edge), xK.faceCarrier e, yK.faceCarrier e, dist (h x) (h y) < η) (hD : D.radius < η) (x : K.realization) :
                                            x K.oneSkeletondist (K.graphReplacementMap hcont hinj D C x) (h x) < 2 * η

                                            Quantitative control for simultaneous intrinsic edge replacement. The remaining input is the usual fine-mesh condition: the image of each source edge has diameter below η.