Documentation

LeanPool.NandakumarRamanaRao.NRR.PrimePolyhedron.FoxNeuwirth.EndpointStackAffinePullbackCore

Affine pullback values on one endpoint-subdivision cylinder #

The earlier last-vertex convention is not stable under iteration: its upper values generally do not equal the lower values selected by the next one-step layer. The composable convention is the affine pullback of the same parent PL map.

For a parent simplex with vertex data V, every local cylinder vertex has a spatial barycentric coordinate in that parent simplex. We assign to it the affine value of V at that coordinate. Affine interpolation over a cylinder cell then recovers the parent affine map at the cell's spatial point exactly. Hence origin avoidance is inherited verbatim, and upper-boundary values are the ordinary barycentric-subdivision vertex values needed by the next layer.

This file proves the complete simplex-local statement. Global iteration only needs the standard face-gluing theorem saying that the parent PL values agree on shared refined faces.

Evaluate parent-simplex affine vertex data at the spatial point of one local cylinder vertex.

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

    Interpolating the pulled-back values over a cylinder cell is exactly evaluation of the parent affine map at the spatial barycentric image of the cell point.

    @[simp]

    The affine-pullback convention fixes every coarse lower-boundary vertex literally.

    @[simp]

    On an upper barycentric facet, affine pullback gives the parent affine value at the corresponding prefix barycenter.

    Every affine-pullback one-step endpoint cell avoids the origin because it is an exact restriction of the already zero-free endpoint PL map.