Documentation

LeanPool.ClassificationOfSurfaces.Moise.LocallyFinitePLApproximation

Quantitative locally finite PL approximation #

This file records the facewise metric control used in Moise Chapter 6, Theorem 3. It is deliberately pointwise: on a noncompact open complex no uniform positive tolerance exists, but a strongly positive tolerance has a positive lower bound on every compact face.

The original face map and the achievable side-control hypotheses #

A global vertex lies in a maximal face carrier exactly when it labels that face.

The original plane embedding, written in the standard coordinates of one face. Values outside the standard closed triangle are irrelevant.

Equations
  • One or more equations did not get rendered due to their size.
Instances For

    The replacement graph is close to the original embedding on each face boundary, with a radius allowed to depend on the face. This is the quantitative hypothesis actually used in Moise's side-preservation argument.

    Equations
    • One or more equations did not get rendered due to their size.
    Instances For

      A face-indexed radius separates every nonincident vertex from the original embedded face. The closed-ball/closed-thickening formulation is exactly what the bounded Tietze extension argument consumes.

      Equations
      • One or more equations did not get rendered due to their size.
      Instances For

        The relatively locally finite set of all vertex images not belonging to one face, made ambiently closed by adjoining the complement of the perturbation region.

        Equations
        Instances For

          Every face admits one positive radius separating its compact image from all nonincident vertices at once. Local finiteness replaces the finite minimum used in the compact theorem.

          The edgewise target for Moise's fine graph subdivision #

          The finite family of coarse faces meeting an edge. It contains, in particular, every face having that edge as one of its sides.

          Equations
          Instances For

            The minimum side-separation radius among the finitely many coarse faces meeting an edge. This is the exact mesh target in Moise Chapter 6, Theorem 2: subdividing the edge until its polygonal replacement is closer than this number preserves the side of every incident face.

            Equations
            • One or more equations did not get rendered due to their size.
            Instances For

              Edgewise diameter control below the incident-face minimum implies the facewise boundary closeness consumed by the side-preservation theorem.

              The exact facewise estimate needed to control a Schoenflies filling. Every point of a replacement boundary is compared first with its original boundary point and then with an arbitrary point of the same source face.

              Equations
              • One or more equations did not get rendered due to their size.
              Instances For

                Separate the graph approximation allowance from the oscillation of the original map on one face. This is the form discharged by an adaptive mesh.

                Equations
                • One or more equations did not get rendered due to their size.
                Instances For

                  Edgewise graph control plus within-face oscillation gives the exact boundary estimate used by every Schoenflies filling.

                  Under facewise control, the entire polygonal disk selected by Schoenflies lies in the prescribed ball about every point of its source face.

                  Pointwise control of the global cellwise replacement.

                  A pointwise tolerance separates nonincident vertices from every source face.

                  Equations
                  • One or more equations did not get rendered due to their size.
                  Instances For

                    Any pointwise smaller tolerance inherits vertex-to-face separation.

                    The pointwise vertex-to-face separation control: the smallest per-face separation radius among the finitely many faces through the point. This is the locally finite analogue of the finite exists_uniform_vertex_face_separation: positive at every point, strongly positive on compact sets, and smaller than the distance from any face through the point to any vertex not incident to that face.

                    Equations
                    • One or more equations did not get rendered due to their size.
                    Instances For

                      The canonical control separates every nonincident vertex from every face: each face image is a positive thickening away from the vertex, and the control is below that radius.

                      On every compact set the canonical separation control has a positive lower bound: only finitely many faces meet the compact set, and each contributes a positive radius.

                      The vertex-side compatibility condition used in Moise's side-preservation argument.

                      Equations
                      • One or more equations did not get rendered due to their size.
                      Instances For

                        Facewise metric control and vertex-to-face separation keep every nonincident vertex outside the selected polygonal closed disk.