Theorem An injective rank-preserving dihedral map fills its target interval
✓ theorem proved

An injective rank-preserving dihedral map fills its target interval

Let \(D,D'\) be two-generator Coxeter systems with lengths \(\ell,\ell'\). Suppose \(l\le_Dr\), \(\ell(l)+2\le\ell(r)\), and \(f:J=[l,r]_D\to D'\) is injective, preserves upward reflection edges, and sends every source length gap two to a target length gap two.

Then \[ f(x)\le_{D'}f(y)\quad\Longleftrightarrow\quad x\le_Dy \qquad(x,y\in J), \] and \[ \operatorname{range}(f)=[f(l),f(r)]_{D'}. \]

Relation to the OpenAI notes

Explicit coordinates, affine lengths and full target range.

OpenAI notes: The proposition describes the image directly as a full relative interval in a target plane coset. Its proof recovers covers from rank-two intervals and exhausts each internal target rank with two image vertices. dih:transport.

Lean (primary): The construction chooses a least target representative and writes F(z) as the ambient image multiplied on the right by its inverse. Rank-two preservation gives consecutive-rank preservation, then an affine length identity by induction. Injectivity and the two-element internal ranks give the exact full range. The theorem returns all coordinate, order, edge and length properties explicitly. DyerPaths:676, DyerPaths:504, DyerPaths:536, DyerPaths:567, DyerPaths:736.

Role in the proof: The Blueprint uses the intrinsic coordinate map F and retains every ambient endpoint bound. The source and target bottom lengths may differ by the constant prescribed by the affine identity.

Proof

Step 1. Obtain the affine rank identity

The affine-rank theorem applies to the edge and gap-two hypotheses. Put \[ L=\ell(l),\quad R=\ell(r),\quad A=\ell'(f(l)),\quad B=\ell'(f(r)). \] For every \(x\in J\), it gives \[ \ell'(f(x))+L=A+\ell(x), \qquad B+L=A+R. \]

Step 2. Recover order in both directions

In a two-generator Coxeter system, \(p\le q\) means \(\ell(p)<\ell(q)\) or \(p=q\), by the dihedral Bruhat comparison theorem.

The identities in Step 1 show that \[ \ell'(f(x))<\ell'(f(y)) \quad\Longleftrightarrow\quad \ell(x)<\ell(y). \] Equality \(x=y\) gives equality of images, and injectivity gives the converse. Thus both alternatives of the Bruhat criterion agree, proving the order equivalence.

For \(x\in J\), the comparisons \(l\le x\le r\) now give \(f(l)\le f(x)\le f(r)\). This proves that the image is contained in the target interval.

Step 3. Match an interior target rank with a source rank

Take \(z\in[f(l),f(r)]_{D'}\). If \(z=f(l)\) or \(z=f(r)\), the required preimage is an endpoint.

Otherwise strict Bruhat length gives \[ A<\ell'(z)<B. \] Define the natural number \[ n=L+\bigl(\ell'(z)-A\bigr). \] The difference is positive. Using \(B+L=A+R\), the displayed inequalities give \[ L<n<R. \] The relative-rank fiber theorem supplies two distinct vertices \(a,b\in J\) of length \(n\).

Step 4. Exhaust the target rank

Substituting \(\ell(a)=\ell(b)=n\) into the affine identities gives \[ \ell'(f(a))=\ell'(z)=\ell'(f(b)). \] Injectivity makes \(f(a)\ne f(b)\).

This common target length is positive, because it is greater than \(A\ge0\), and strictly smaller than the length \(B\) of \(f(r)\). The internal-rank fiber statement therefore gives exactly two elements of \(D'\) at this length. They are already \(f(a),f(b)\), so \(z\) equals one of them.

Every target interval vertex is consequently in the image. Together with Step 2, this proves the full range equality.

References

The local source declarations below give the construction and proof.

Lean formalization

OAI.KLInvariance.Dihedral.range_eq_interval_of_rank_two: DyerPaths.lean:567.

Used by