Nested safe midpoint stages of an open polyhedron #
For an open subset U of a finite intrinsic complex, retain at level n every midpoint
triangle whose whole carrier is contained in U. These finite stages are nested and exhaust
U. They are the finite layers used in Moise Chapter 8, Theorem 2 before adjacent frontier
subdivisions are reconciled by coning.
The n-fold midpoint subdivision used at one safe stage.
Equations
Instances For
Refined triangles whose complete transported carriers lie in the prescribed open set.
Equations
- K.safeFaces U n = {t ∈ (K.safeSubdivision n).refined.faces | ∀ x ∈ (K.safeSubdivision n).refined.faceCarrier t, (K.safeSubdivision n).homeo x ∈ U}
Instances For
Equations
- K.safeFacesDecidablePred U n t = Finset.decidableMem t (K.safeFaces U n)
The finite intrinsic subcomplex retained at level n.
Equations
- K.safeStage U n = (K.safeSubdivision n).refined.restrictFaces fun (t : Finset (K.safeSubdivision n).refined.Vertex) => t ∈ K.safeFaces U n
Instances For
Include a safe stage into the original finite realization.
Equations
- K.safeStageInclusion U n = ⇑(K.safeSubdivision n).homeo ∘ (K.safeSubdivision n).refined.restrictFacesInclusion fun (t : Finset (K.safeSubdivision n).refined.Vertex) => t ∈ K.safeFaces U n
Instances For
Carrier of one finite safe stage in the original realization.
Equations
- K.safeStageSupport U n = Set.range (K.safeStageInclusion U n)
Instances For
Every point of a retained old triangle is carried by a retained child at the next midpoint level.
Safe-stage supports are monotone in the subdivision level.
A point of an open set is eventually carried by a safe midpoint triangle.
Every point of an open set eventually lies in the ambient interior of a finite safe stage. This is stronger than mere exhaustion and is the compact-control input for the locally finite shell construction.
A compact subset of an open polyhedron is eventually contained in the interior of one finite safe stage.
A later midpoint level whose safe support contains the given safe support in its interior.
The maximum with n + 1 makes the selected levels strictly increase.
Equations
- K.nextSafeStage U hU n = max (Classical.choose ⋯) (n + 1)
Instances For
Cofinal levels selected so that consecutive finite supports are nested through interiors.
Equations
- K.safeExhaustionIndex U hU 0 = 0
- K.safeExhaustionIndex U hU n.succ = K.nextSafeStage U hU (K.safeExhaustionIndex U hU n)
Instances For
The selected compact exhaustion stage.
Equations
- K.safeExhaustion U hU n = K.safeStageSupport U (K.safeExhaustionIndex U hU n)
Instances For
The compact shells of the selected exhaustion, regarded in the open subspace. Shell zero
is the first compact stage; shell n + 1 is the next stage with the interior of stage n
removed.
Equations
- K.safeShell U hU 0 = Subtype.val ⁻¹' K.safeExhaustion U hU 0
- K.safeShell U hU n.succ = Subtype.val ⁻¹' (K.safeExhaustion U hU (n + 1) \ interior (K.safeExhaustion U hU n))
Instances For
The exhaustion shells are locally finite in U. They may accumulate at the frontier in
the original compact realization, which is precisely why the ambient space here is the open
subspace.
The nested finite safe stages cover exactly the prescribed open set.