Theorem Later-edge counts in transported dihedral intervals
✓ theorem proved

Later-edge counts in transported dihedral intervals

Fix finite-generator real Coxeter systems \(W,W'\), an interval order isomorphism \[ \varphi:[u,b]_W\xrightarrow{\sim}[u',b']_{W'}, \] and the geometric slope on the target positive roots.

In \(W\), choose a root plane with a plane basis, its induced dihedral group \(D\), and a representative \(a_0\) satisfying \(\ell(a_0)\le\ell(da_0)\) for all \(d\in D\). Choose \(x\le_Dc\) with \[ u\le_Wxa_0,\qquad ca_0\le_Wb, \] and an edge \(x\to_Dy\) with \(y\le_Dc\). The least-coset order comparison puts \(za_0\) in \([u,b]_W\) for every \(z\in[x,c]_D\), so all the following values of \(\varphi\) are defined.

Let \(\alpha'\) be the positive target root of the image edge \(\varphi(xa_0)\to\varphi(ya_0)\). Write \(\varepsilon(p,\alpha',q)\) for the target after-indicator: it is one exactly when \(p\to q\) is an upward reflection edge with root slope strictly greater than that of \(\alpha'\), and zero otherwise.

Define \[ h_x=\sum_{z\in[x,c]_D}\varepsilon(\varphi(xa_0),\alpha',\varphi(za_0)), \qquad h_y=\sum_{z\in[x,c]_D}\varepsilon(\varphi(ya_0),\alpha',\varphi(za_0)). \] Then \[ h_x=h_y+\frac{\ell_D(y)-\ell_D(x)-1}{2}. \] The intrinsic edge has a positive odd length gap, so the correction is a nonnegative integer.

Relation to the OpenAI notes

A full-interval reindexing followed by the signed count.

OpenAI notes: The proof treats relative rank one separately, then transports the full relative interval to a target dihedral coset and applies the target angular count while preserving the relative length gap. dih:count.

Lean (primary): The transport theorem returns coordinate equality, injectivity, full interval range, edge/order correspondence and relative length identities. These identify the actual target root and both finite sums. The small-rank branch proves there are exactly two vertices and checks each indicator is zero. DihedralIntervals:2064, DihedralIntervals:2145, DihedralIntervals:2200.

Role in the proof: The full-interval construction, actual root and indicator identities, finite bijection, native angular count and relative length substitution are developed in linked proofs. The final formula treats the two-vertex case by checking every summand.

Proof

Step 1. Transport a relative interval of rank at least two

First suppose \(\ell_D(c)\ge\ell_D(x)+2\). The full relative-interval transport theorem applies with the displayed ambient lower and upper bounds.

It supplies a target plane subgroup \(D'\), a least representative \(a'_0\), and a bijection \(F\) onto the full relative interval \([F(x),F(c)]_{D'}\). It preserves and reflects relative order and reflection edges, preserves length differences, and satisfies \[ F(z)a'_0=\varphi(za_0) \qquad(z\in[x,c]_D). \]

The coordinate identity identifies the current target root with the intrinsic root of \(F(x)\to F(y)\): their left reflections are both \[ \varphi(ya_0)\varphi(xa_0)^{-1} =(F(y)a'_0)(F(x)a'_0)^{-1} =F(y)F(x)^{-1}. \] The same identity identifies every root used in the two after-indicators.

Step 2. Identify every indicator and reindex the sums

For each \(p,z\in[x,c]_D\), the target coordinate identity gives \[ \varphi(pa_0)=F(p)a'_0,\qquad \varphi(za_0)=F(z)a'_0. \] The coset-count transport theorem therefore identifies the ambient summand with the intrinsic one: \[ \varepsilon(\varphi(pa_0),\alpha',\varphi(za_0)) =\varepsilon_{D'}(F(p),\alpha',F(z)). \] The root identification in Step 1 makes \(\alpha'\) the actual current edge root for this intrinsic count.

The full range and injectivity of \(F\) are exactly the finite-reindexing hypotheses of the same theorem. For \(p=x\) and \(p=y\), respectively, it gives \[ h_x=h_{D'}(F(x),\alpha';F(c)),\qquad h_y=h_{D'}(F(y),\alpha';F(c)). \] The theorem explicitly builds the bijection onto \([F(x),F(c)]_{D'}\). It then adds only zero terms to sum over the full lower ideal of \(F(c)\): a removed vertex is not above \(F(x)\), while an edge from either \(F(x)\) or \(F(y)\) would put it above \(F(x)\).

Step 3. Apply the native dihedral count

The transported edge is \(F(x)\to_{D'}F(y)\), and order preservation gives \(F(y)\le_{D'}F(c)\). These are exactly the hypotheses of the native count-difference theorem, applied in the target plane with its actual geometric slope and current root \(\alpha'\).

That theorem proves the two count translations term by term: admissible signed representatives give the correct intrinsic lengths; actual angular-root comparison gives the signed arrow indicators, using odd residues in the maximum-length case; the rank-fiber sum has a single top and zero identity terms. The signed-count difference theorem then yields \[ h_x=h_y+\frac{\ell_{D'}(F(y))-\ell_{D'}(F(x))-1}{2}. \]

Step 4. Substitute the transported length gap

The relative length identity supplied by the full interval transport is \[ \ell_{D'}(F(y))-\ell_{D'}(F(x)) =\ell_D(y)-\ell_D(x). \] Replacing the numerator in Step 3 gives the required correction. This proves the formula for relative rank at least two.

Step 5. Treat the smaller relative interval

Suppose \(\ell_D(c)<\ell_D(x)+2\). The edge and \(y\le_Dc\) force \[ \ell_D(y)=\ell_D(c)=\ell_D(x)+1. \] Equal length under Bruhat comparison gives \(y=c\). Every vertex strictly between \(x\) and \(c\) would have an integer length strictly between these consecutive lengths, so the interval has exactly the two vertices \(x,y\).

For the lower count, the term at \(x\) is zero because it is not an upward edge, and the term at \(y\) is zero because the current edge has the threshold root itself. For the upper count, the term at \(y\) is again zero and the term at \(x\) cannot be upward. Thus both counts are zero.

The length correction is \((1-1)/2=0\), proving the identity in this final case.

References

The local source declarations below give the construction and proof.

Lean formalization

OAI.KLInvariance.TitsSpace.PlaneBasis.edgeRoot_same_table: DihedralIntervals.lean:1814.

OAI.KLInvariance.TitsSpace.PlaneBasis.edgeRoot_next_table: DihedralIntervals.lean:1833.

OAI.KLInvariance.TitsSpace.PlaneBasis.laterCount_difference: DihedralIntervals.lean:1974.

OAI.KLInvariance.TitsSpace.PlaneBasis.interval_laterCount: DihedralIntervals.lean:2030.

OAI.KLInvariance.TitsSpace.PlaneBasis.interval_map_count: DihedralIntervals.lean:2064.

OAI.KLInvariance.TitsSpace.PlaneBasis.transported_count_difference: DihedralIntervals.lean:2145.

OAI.KLInvariance.TitsSpace.PlaneBasis.transported_count_difference_all: DihedralIntervals.lean:2200.

Used by