Internal face equality for affine barycentric subdivision #
This file closes the affine part of the internal-face cancellation used in the boundary computation for barycentric subdivision.
The key observation is that an internal face of the subdivided simplex is
obtained by restricting the affine map to the hyperface where the deleted
barycentric-coordinate is zero. On that hyperface, changing the permutation by
swapping the adjacent positions i and i+1 changes only the deleted prefix
barycenter; all remaining prefix barycenters are equal by
prefixBarycenter_internal_swap_eq.
No chain-level boundary statement is asserted here. This is only the affine face identity needed before the sign-cancellation proof.
If two affine subdivision maps have the same prefix barycenters away from a
coordinate i, then they agree on the hyperface where the i-th barycentric
coordinate of the input is zero.
This is the generic linear-algebra lemma behind the internal adjacent-swap face identity.
Internal adjacent-swap affine face identity.
Let τ be the adjacent transposition swapping the i-th and (i+1)-st
positions in Fin (n+2). The two affine subdivision maps associated to π
and τ.trans π agree on the hyperface where the deleted internal coordinate
Fin.castSucc i is zero.
In particular, after precomposition with the ordinary coface map
δ_i : Δ^n → Δ^(n+1) whose image is this hyperface, this gives the usual
identity
a_π ∘ δ_i = a_(τ.trans π) ∘ δ_i.
The coface map itself is intentionally not mentioned in the statement, so the lemma is independent of the library's exact face-map API.