The induced reflection graph and inversion count on a plane-subgroup coset
Let \(P\) be a root plane with its induced system on \(D_P\), and let \(a_0\) have least ambient length in \(D_Pa_0\). The bijection \[ D_P\longrightarrow D_Pa_0,\qquad w\longmapsto wa_0 \] preserves and reflects directed reflection edges and their left reflection labels.
Moreover, \[ L_P(wa_0)=\ell_P(w). \] Intrinsic Bruhat paths therefore map to ambient Bruhat paths, and \(a_0\) is the unique element of least ambient length in its coset.
Relation to the OpenAI notes
The graph and count statements are separated in Lean.
OpenAI notes: One lemma states the unique least ambient-length representative, the coset reflection-graph identification, the relative inversion count, and the implication from relative to ambient order. dih:plane.
Lean (primary): The source first proves existence of a least representative and sign preservation, then exports the graph, count, and path statements under that least-length hypothesis. Tits:2166, Decomposition:1178, Decomposition:1196, Decomposition:1185.
Role in the proof: The proof below uses those exported statements and derives uniqueness explicitly from the plane count and the length-zero characterization of the identity.
Proof
Step 1. Compare plane inversion counts
For every positive root \(r\in P\), the least-coset sign theorem gives \[ (wa_0)^{-1}r\text{ negative} \quad\Longleftrightarrow\quad w^{-1}r\text{ negative}. \] The two finite plane inversion sets are therefore equal. Their counts give \[ L_P(wa_0)=L_P(w)=\ell_P(w), \] using the intrinsic length theorem for the second equality.
Step 2. Recover a subgroup reflection from an ambient coset edge
Suppose \(ga_0\to ha_0\) is an ambient edge with left reflection label \(t\). The relation \(ha_0=tga_0\) gives \(h=tg\) by cancellation, hence \(t=hg^{-1}\in D_P\).
Since \(t^2=1\), it also gives \(tha_0=ga_0\). Thus the edge orientation says exactly that \(t\) lowers \(ha_0\). The least-coset sign theorem transfers this to the assertion that \(t\) lowers \(h\).
The intrinsic and ambient left-inversion conditions agree on \(D_P\), so \(t\) is an intrinsic left inversion of \(h\). Therefore \(g\to h\) is an induced reflection edge with the same label \(t\).
Step 3. Map an induced edge into the coset
Conversely, an induced edge \(g\to h\) has \(h=tg\), where \(t\in D_P\) is an intrinsic reflection lowering \(h\). It is an ambient reflection, and the least-coset sign theorem makes it lower \(ha_0\).
The identity \(tha_0=ga_0\) now gives the ambient directed edge \(ga_0\to ha_0\), with label \(t\). This proves the two edge directions.
Step 4. Transfer paths and relative intervals
A finite path of induced reflection edges maps, edge by edge, to an ambient reflection path. Since strong Bruhat order is the reflexive transitive closure of those edges, \[ g\le_P h\quad\Longrightarrow\quad ga_0\le_W ha_0. \]
Consequently the map \(z\mapsto za_0\) sends the relative interval \([g,h]_P\) into the ambient interval \([ga_0,ha_0]_W\), and preserves order. It is injective because \(za_0=z'a_0\) implies \(z=z'\) by right cancellation.
Step 5. Prove uniqueness of the minimum
Let \(a_1\) be another element of least ambient length in the same coset. Write \(a_1=wa_0\), \(w\in D_P\).
Minimality of \(a_1\) makes \(a_1^{-1}\) preserve every positive root in \(P\), so \(L_P(a_1)=0\). Step 1 gives \[ 0=L_P(a_1)=\ell_P(w). \] A Coxeter element of length zero is the identity. Hence \(w=1\) and \(a_1=a_0\).
This last argument derives uniqueness explicitly from the proved sign and count formulas.
References
The local source declarations below define the objects and prove the stated properties.
Lean formalization
OAI.KLInvariance.TitsSpace.bruhatStep_coset_iff: Tits.lean:2244.
OAI.KLInvariance.TitsSpace.PlaneBasis.coset_step_iff: Decomposition.lean:1178.
OAI.KLInvariance.TitsSpace.PlaneBasis.coset_bruhat: Decomposition.lean:1185.
OAI.KLInvariance.TitsSpace.PlaneBasis.coset_length_eq: Decomposition.lean:1196.
OAI.KLInvariance.TitsSpace.PlaneBasis.intervalToAmbient: ReflectionOrders.lean:410.
OAI.KLInvariance.TitsSpace.PlaneBasis.intervalToAmbient_injective: ReflectionOrders.lean:413.
Used by
- The coset interval embedding into an ambient interval
- Coset root identities and reindexing of actual later counts
- Actual plane edge roots and the two prefix sequences
- Exact two-edge intermediate sets survive interval transport
- An actual ambient edge has coordinates in a least plane coset
- Ambient later-edge selections and their coset pullbacks
- Root and factor reductions in the actual coset edge ring
- The finite relative coset graph inside a Bruhat interval
- Later-edge selections for the coset model comparison
- Finiteness and outgoing lifts of the relative coset graph
- Structure models on the finite relative coset graph
- A plane weight equals the intrinsic dihedral edge degree
- Quotients, generation, and flabbiness on a localized coset
- Counting supported later edges by their target vertices
- Relative length and Bruhat intervals in a plane-subgroup coset
- Full transport of a relative dihedral interval
- Later-edge counts in transported dihedral intervals