Theorem The angular endpoint reflections generate the plane subgroup
✓ theorem proved

The angular endpoint reflections generate the plane subgroup

Let \((a,b)\) be a plane basis of a root plane \(P\) in a finite-generator Coxeter system. Then \[ D_P=\langle r_a,r_b\rangle. \]

Relation to the OpenAI notes

Same plane subgroup, different construction.

OpenAI notes: The plane lemma invokes the reflection-subgroup theorem to obtain a canonical Coxeter system, then uses positivity in the plane to show that its rank is two. dih:plane.

Lean (primary): Finite ambient inversion sets produce angular endpoints. Their plane-simple sign criterion and the plane inversion count prove generation by two endpoint reflections through a count-decreasing conjugation. A two-involution presentation constructs the Coxeter system; the induced signed relation then identifies its inversions. Decomposition:627, Decomposition:869, Decomposition:906, Decomposition:1010.

Role in the proof: The Blueprint follows the endpoint-existence, generation, presentation, and signed-inversion proofs in that order.

Proof

Step 1. Detect an inverted endpoint

Take a positive root \(r\in P\), and put \(t=r_r\). The plane-basis cone property writes \[ r=ca+db,\qquad c,d\ge0. \] If \(t(a)\) and \(t(b)\) were both positive, their nonnegative combination \(t(r)\) would be nonnegative. But \(t(r)=-r\) is negative and nonzero.

Thus \(t\) inverts at least one endpoint. Both endpoints are plane-simple by the angular-extreme theorem.

Step 2. Establish a second descent for a nonsimple reflection

Let \(u\) be an endpoint inverted by \(t\), and suppose \(r\ne u\). Write \(s=r_u\), and let \[ v=-t(u). \] The root \(v\) is positive and belongs to \(P\).

If \(v=u\), the reflection equation \(t(u)=-u\) gives \[ 2u=B(r,u)r. \] The scalar on the right is positive by heights. Comparing the root norms makes \(r=u\), a contradiction. Thus \(v\ne u\).

Plane simplicity of \(u\) makes \(s(v)\) positive. Therefore \[ (ts)^{-1}u=st(u)=-s(v) \] is negative: \(ts\) also inverts \(u\).

Step 3. Compute the drop under conjugation

Since \(t\) inverts \(u\), the simple-step theorem gives \[ L_P(st)=L_P(t)-1. \] Both \(s,t\) belong to \(D_P\), and \((st)^{-1}=ts\), so inverse symmetry gives \(L_P(ts)=L_P(st)\).

Step 2 and another downward simple step give \[ L_P(sts)=L_P(ts)-1=L_P(t)-2. \] The conjugate reflection is \(sts=r_{s\star r}\). The positive root \(s\star r\) still lies in \(P\).

Step 4. Induct on the finite plane inversion count

Let \(H=\langle r_a,r_b\rangle\). We prove \(r_r\in H\) for every positive \(r\in P\), by strong induction on the nonnegative integer \(L_P(r_r)\).

The value cannot be zero: \(r_r\) inverts \(r\in P\). If \(r=a\) or \(r=b\), the reflection is a generator of \(H\).

Otherwise choose the inverted endpoint \(u\) from Step 1. Step 3 gives a reflection \(t'=r_{r'}\), with \(r'=r_u\star r\in P\), whose nonnegative count is \(L_P(r_r)-2<L_P(r_r)\). The induction hypothesis gives \(t'\in H\).

Since \(r_u\in H\) and \(r_r=r_ut'r_u\), the original reflection belongs to \(H\). This completes the induction.

Step 5. Compare the generated subgroups

Every root in \(P\) is a positive root or the negative of one, and these two signs define the same reflection. Step 4 therefore places every generator of \(D_P\) in \(H\), proving \(D_P\subseteq H\).

Conversely, \(a,b\in P\), so their reflections belong to \(D_P\). Thus \(H\subseteq D_P\), and the groups are equal.

References

The local source declarations below define the objects and prove the stated properties.

Lean formalization

OAI.KLInvariance.TitsSpace.PlaneBasis.positive_cone: Decomposition.lean:653.

OAI.KLInvariance.TitsSpace.PlaneBasis.reflection_inverts_endpoint: Decomposition.lean:784.

OAI.KLInvariance.TitsSpace.PlaneSimple.inverted_after_mul: Decomposition.lean:796.

OAI.KLInvariance.TitsSpace.PlaneSimple.planeLength_conj_drop: Decomposition.lean:807.

OAI.KLInvariance.TitsSpace.PlaneBasis.rootRef_mem_pairClosure: Decomposition.lean:833.

OAI.KLInvariance.TitsSpace.PlaneBasis.pairClosure_eq_planeSubgroup: Decomposition.lean:869.

Used by