From signed vertices to the transported later-edge count

Signed coordinates describe the two alternating rays of a dihedral group. Their group values, reduced lengths and reflection labels are separate pieces of data. In the finite case, admissible vertex indices use one representative of the longest element, while reflection parameters are compared through odd residues modulo \(2m\), where \(m\) is the maximum intrinsic length.

Within the finite-generator ambient realization, the angular-order proof identifies these integer parameters with the actual roots. Inversion cuts give a middle-descent test for consecutive roots; the prefix-root sequences then give the finite and infinite orders. The numerical arrow indicator includes length, parity and order tests, and the rank-fiber sum gives the native count theorem.

For an interval isomorphism, full interval transport identifies all target relative vertices, their actual roots and their relative rank differences. Reindexing the two endpoint sums yields the transported count theorem. Its difference is the plane weight used by the correction factor, so this combinatorial calculation supplies the exponent equality in the local image comparison.

Reading sequence

  1. Signed coordinates for the two alternating rays — Define signed group values.
  2. Admissible signed vertex indices — Choose the finite representatives.
  3. Actual plane edge roots and the two prefix sequences — Define the actual root sequences.
  4. Finite and infinite angular order of actual dihedral roots — Prove their finite and infinite order.
  5. Signed label comparisons and finite later counts — Define the numerical indicators and sums.
  6. The native dihedral later-count difference — Prove the native identity.
  7. Coset root identities and reindexing of actual later counts — Reindex the actual target indicators.
  8. Later-edge counts in transported dihedral intervals — Obtain the transported endpoint difference.

Entries for this keyword