Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6.1-sol)audited 2026-10-08
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

The Wall form of an orthogonal operator, subspace restriction, and the interval structure of the orthogonal reflection-length order

Statement

Let (V,B) be a finite-dimensional real inner product space (Real and complex inner-product spaces and their induced length); on this page V=RS with the positive definite Coxeter form B of a Coxeter system of finite type (The real Coxeter form, its radical, reflections, and form-preserving maps, Finiteness criterion: W is finite exactly when the Coxeter form is positive definite), and O(V) is the group of B-preserving invertible linear maps (Linear isometries, and orthogonal or unitary operators on finite-dimensional inner product spaces). Let M, F and ≤O be as in Reflection length, the absolute order on a finite Coxeter group, and the moved and fixed spaces of an orthogonal operator. Then:

(1) Basic identities. For every A∈O(V) one has F(A)=F(A−1), M(A)=M(A−1), M(A)=F(A)⊥, V=M(A)⊕F(A), A(M(A))=M(A), A(F(A))=F(A), and (A−id)∣M(A):M(A)→M(A) is a bijection (In finite dimension, W⊥⊥=W and dim⁡W+dim⁡W⊥=dim⁡V, Rank-nullity: dim⁡FV=nullity⁡T+rank⁡T). For all X,Y∈O(V), M(XY)⊆M(X)+X M(Y) and hence dim⁡M(XY)≤dim⁡M(X)+dim⁡M(Y).

(2) The Wall form. For A∈O(V) put

χA(u,v):=B((A−id)∣M(A)−1u, v)(u,v∈M(A)).

Then χA is a bilinear form on M(A) satisfying

χA(u,v)+χA(v,u)=−B(u,v)(u,v∈M(A));

in particular χA is nondegenerate and its symmetric part is −12B∣M(A) (The adjoint T∗:W→V is characterised by ⟨Tv,w⟩W=⟨v,T∗w⟩V, Adjoints satisfy (S+T)∗=S∗+T∗, (λT)∗=λ‾T∗, (ST)∗=T∗S∗, and T∗∗=T).

(3) Subspace restriction. Let A∈O(V), let U⊆M(A) be a subspace and let ΠU:V→U be the orthogonal projection (The orthogonal projection PWv is the W-component in V=W⊕W⊥, For a subspace W of a finite-dimensional inner product space, V=W⊕W⊥). There is a unique HU∈End⁡(U) with B(HUu,v)=χA(u,v) for all u,v∈U, and it satisfies HU+HU∗=−idU, so that HU is invertible. Define AU∈O(V) by AUu=u+HU−1u for u∈U and AU=id on U⊥. Then M(AU)=U and

(AU−id)∣U−1=HU,HUu=ΠU((A−id)∣M(A))−1u  (u∈U).

An element A∈O(V) is a reflection (that is, dim⁡M(A)=1) if and only if A=id−2ΠL for the line L=M(A); in particular every line L⊆V is the moved space of exactly one reflection of O(V) (For an endomorphism in finite dimension, preserving lengths, preserving inner products, carrying orthonormal bases to orthonormal bases, and T∗T=I are equivalent).

(4) The restriction theorem. For every subspace U⊆M(A) one has AU≤OA, that is dim⁡M(A)=dim⁡U+dim⁡M(AU−1A); and for U⊆U′⊆M(A) one has (AU′)U=AU, hence AU≤OAU′. Conversely every B∈O(V) with B≤OA satisfies M(B)⊆M(A), χA∣M(B)=χB and B=AM(B). Consequently the assignment U↦AU is a bijection from the set of subspaces of M(A) onto {B∈O(V):B≤OA}, with inverse B↦M(B), and it is an order isomorphism for inclusion of subspaces and ≤O.

(5) Rank-length equality and prefixes. Let A∈O(V) and let r1,…,rk∈O(V) be reflections with A=r1r2⋯rk. Then k≥dim⁡M(A), and A is a product of exactly dim⁡M(A) reflections. Moreover B≤OA if and only if there are a shortest factorization A=r1⋯rm (so m=dim⁡M(A)) and an index k with B=r1⋯rk.

Facts & Assumptions

Given: A finite-dimensional real inner product space (V,B) with the positive definite Coxeter form of a finite-type Coxeter system, an element A∈O(V), and the moved space M(A)=im⁡(A−id), the fixed space F(A)=ker⁡(A−id) and the relation ≤O of Reflection length, the absolute order on a finite Coxeter group, and the moved and fixed spaces of an orthogonal operator.

[F1]

For a linear map T:V→W with V finite-dimensional, dim⁡V=dim⁡ker⁡T+dim⁡im⁡T; in particular an injective endomorphism of a finite-dimensional vector space is bijective. Rank-nullity: dim⁡FV=nullity⁡T+rank⁡T

[F2]

For a subspace W of a finite-dimensional inner product space, V=W⊕W⊥, W⊥⊥=W and dim⁡W+dim⁡W⊥=dim⁡V. For a subspace W of a finite-dimensional inner product space, V=W⊕W⊥ In finite dimension, W⊥⊥=W and dim⁡W+dim⁡W⊥=dim⁡V

[F3]

The orthogonal projection PW:V→W sends v=w+z with w∈W, z∈W⊥ to PWv=w; equivalently PWv is the unique vector of W with v−PWv∈W⊥, and PWw=w for every w∈W. The projection is linear: combining the unique decompositions of x and y gives PW(ax+by)=aPWx+bPWy. The orthogonal projection PWv is the W-component in V=W⊕W⊥

[F4]

A∈O(V) means that A is invertible and B(Au,Av)=B(u,v) for all u,v∈V; equivalently B(Au,v)=B(u,A−1v) for all u,v∈V. Linear isometries, and orthogonal or unitary operators on finite-dimensional inner product spaces For an endomorphism in finite dimension, preserving lengths, preserving inner products, carrying orthonormal bases to orthonormal bases, and T∗T=I are equivalent

[F5]

B is symmetric and bilinear, and positive definite: B(u,u)≥0 with B(u,u)=0 only for u=0; consequently B is nondegenerate, so B(x,y)=0 for all y∈V implies x=0, and the same holds for the restriction of B to any subspace. Real and complex inner-product spaces and their induced length Finiteness criterion: W is finite exactly when the Coxeter form is positive definite

[F6]

M(A)=im⁡(A−id), F(A)=ker⁡(A−id) and B≤OA holds if and only if dim⁡M(A)=dim⁡M(B)+dim⁡M(B−1A); no order property of ≤O is asserted by the definition. Reflection length, the absolute order on a finite Coxeter group, and the moved and fixed spaces of an orthogonal operator

Proof

technique · direct
1.1F2F4F5algebra

For y∈V one has B((A−id)x,y)=B(x,(A−1−id)y) for all x∈V by [F4], so y∈M(A)⊥ holds exactly when (A−1−id)y=0 and hence exactly when A−1y=y, that is, when y∈F(A−1); thus M(A)⊥=F(A−1). Since A−1y=y holds exactly when Ay=y, one has F(A−1)=F(A), and A−1−id=−A−1(A−id) shows M(A−1)=M(A). Consequently M(A)⊥=F(A), and [F2] gives M(A)=M(A)⊥⊥=F(A)⊥, V=M(A)⊕F(A) and dim⁡M(A)+dim⁡F(A)=dim⁡V. Moreover A(A−id)=(A−id)A, so A(M(A))=M(A); and A(F(A))⊆F(A) with equality because A is injective.

1.2F1F4algebra

For X,Y∈O(V) the identity XY−id=(X−id)+X(Y−id) gives M(XY)⊆M(X)+X M(Y); the invertible X restricts to an injective map M(Y)→X M(Y), whose image therefore has dimension dim⁡M(Y) by [F1]; consequently dim⁡M(XY)≤dim⁡M(X)+dim⁡M(Y).

2.1step 1.1F1

By step 1.1 the direct sum V=M(A)⊕F(A) gives F(A)∩M(A)={0}, so the restriction (A−id)∣M(A):M(A)→M(A), whose image lies in the A-stable space M(A), has trivial kernel and is therefore injective; by [F1] it is bijective, and SA:=((A−id)∣M(A))−1∈GL(M(A)) is defined.

2.2step 1.1F3F4F5algebra

Let A∈O(V) with dim⁡M(A)=1, put L:=M(A) and let ΠL be the orthogonal projection onto L [F3]. By step 1.1 the line L and the space F(A)=L⊥ are A-stable, so A fixes L⊥ pointwise; for 0≠u∈L one has Au=cu with c∈R, and since A preserves B by [F4] and B(u,u)≠0 by [F5], c2B(u,u)=B(Au,Au)=B(u,u) forces c2=1, while c=1 would put u∈L∩F(A)={0}; hence c=−1 and A=id−2ΠL. Conversely if L is a line then A′:=id−2ΠL acts as −1 on L and as the identity on L⊥, so it preserves B and is invertible, and M(A′)=L has dimension one; if A′∈O(V) is a reflection with M(A′)=L, the first part applied to A′ gives A′=id−2ΠL. Hence every line L⊆V is the moved space of exactly one reflection of O(V), namely id−2ΠL.

3.1step 1.1step 2.1F4F5algebra

Applying step 2.1 to the orthogonal element A−1, whose moved space is M(A) by step 1.1, gives the bijection TA:=((A−1−id)∣M(A))−1:M(A)→M(A). For u,v∈M(A) put w:=SAu and z:=TAv, so that (A−id)w=u and (A−1−id)z=v; then B(SAu,v)=B(w,(A−1−id)z)=B(w,A−1z)−B(w,z)=B(Aw,z)−B(w,z)=B((A−id)w,z)=B(u,TAv), using [F4] and symmetry of B. Moreover A−1−id=−A−1(A−id) on the A-stable space M(A), so the inverse there is TA=−SAA and SA+TA=SA(id−A)=−((A−id)∣M(A))−1(A−id)∣M(A)=−idM(A).

4.1step 1.1step 3.1F4F5algebra

The Wall form χA(u,v)=B(SAu,v) is bilinear on M(A), and for u,v∈M(A) the transpose identity of step 3.1 gives B(SAv,u)=B(v,TAu)=B(TAu,v), so χA(u,v)+χA(v,u)=B(SAu,v)+B(TAu,v)=B((SA+TA)u,v)=−B(u,v). If χA(u,v)=0 for all v∈M(A), then B(SAu,⋅) vanishes on M(A) and, since SAu∈M(A)=F(A)⊥, also on F(A), hence on V; by [F5] SAu=0, and SA is injective, so u=0: the form χA is nondegenerate, and its symmetric part is 12(χA(u,v)+χA(v,u))=−12B(u,v) on M(A).

5.1step 3.1step 4.1F1F3F5algebra

Let U⊆M(A) and define HU:=ΠUSA∣U:U→U. For u,v∈U, [F3] gives B(HUu,v)=B(SAu,v)=χA(u,v); if another operator has these pairings, its difference from HU pairs to zero with every v∈U, so it equals HU by [F5]. Define HUt:=ΠUTA∣U, with TA from step 3.1. That step and [F3] give B(HUtu,v)=B(TAu,v)=B(u,SAv)=B(u,HUv), so HUt is the adjoint HU∗ of The adjoint T∗:W→V is characterised by ⟨Tv,w⟩W=⟨v,T∗w⟩V. Since SA+TA=−idM(A), compression to U gives HU+HUt=−idU. If HUu=0, then 0=B(HUu,u)=χA(u,u)=−12B(u,u) by step 4.1, hence u=0; thus HU is injective and invertible by [F1], including when U=0.

6.1step 5.1F1F2F5algebra

Define AU∈End⁡(V) by AUu=u+HU−1u for u∈U and AU=id on U⊥; this is well defined and linear because V=U⊕U⊥ [F2]. Then AU−id=HU−1ΠU has image U, so M(AU)=U and (AU−id)∣U−1=HU. Put T:=HU−1∈GL(U) and Tt:=(HUt)−1; inverting the transpose relation of step 5.1 shows that Tt is the transpose of T, that is, B(Tx,y)=B(x,Tty) for all x,y∈U. Multiplying HU+HUt=−idU on the left by T and on the right by Tt, and also on the left by Tt and on the right by T, gives T+Tt=−TTt=−TtT, hence (id+T)(id+Tt)=idU=(id+Tt)(id+T). Therefore B(AUu,AUv)=B((id+Tt)(id+T)u,v)=B(u,v) for all u,v∈U, the transpose of id+T being id+Tt; on U⊥ the operator AU is the identity, and U⊥U⊥, so AU preserves B on V. If AUx=0, then B(x,y)=B(AUx,AUy)=0 for every y∈V, so x=0 by [F5] and AU is injective, hence invertible by [F1]: thus AU∈O(V).

7.1step 1.1step 5.1step 6.1F1F6algebra

Fix U⊆M(A) and let AU be as in step 6.1. In the direct sum V=M(A)⊕F(A) of step 1.1 write x=m+f; then (A−AU)x=(A−id)m−HU−1ΠUm, so x∈ker⁡(A−AU) exactly when (A−id)m=HU−1ΠUm. With u:=ΠUm∈U this equation reads m=SAHU−1u, and it is consistent because ΠUSAΠU=HU is step 5.1: the solutions are exactly the x=SAHU−1u+f with u∈U and f∈F(A) arbitrary. Hence ker⁡(A−AU)=SAHU−1(U)⊕F(A) has dimension dim⁡U+dim⁡F(A), so rank⁡(A−AU)=dim⁡M(A)−dim⁡U. Since AU−1A−id=AU−1(A−AU), the space M(AU−1A) is the image of A−AU under AU−1 and has the same dimension rank⁡(A−AU); therefore dim⁡M(A)=dim⁡U+dim⁡M(AU−1A), that is, AU≤OA by [F6].

7.2step 1.1step 5.1step 6.1F6algebra

Let B≤OA and put C:=B−1A, so that dim⁡M(A)=dim⁡M(B)+dim⁡M(C) by [F6]. Since A−id=(B−id)C+(C−id), one has M(A)⊆M(B)+M(C), and comparing dimensions gives M(A)=M(B)⊕M(C); in particular M(B)⊆M(A). Fix w∈U:=M(B) and write m:=SAw=mB+mC with mB∈M(B) and mC∈M(C); then w=(A−id)m=(B−id)(Cm)+(C−id)m with (B−id)(Cm)∈M(B) and (C−id)m∈M(C), so comparing the two direct summands gives Cm=m and (B−id)m=w. Hence m−SBw∈F(B)=M(B)⊥=U⊥, where the first equality uses step 1.1 applied to B; therefore for all u,v∈U one has χA(u,v)=B(SAu,v)=B(SBu,v)=χB(u,v), because SAu−SBu∈U⊥. Thus the operator defined by χA on U in step 5.1 is HU=SB, and the construction of step 6.1 for A and U gives AM(B)=id+SB−1 on U and id on U⊥, while B=id+SB−1 on U and B=id on U⊥=F(B) by step 1.1, so B=AM(B).

8.1step 5.1step 6.1step 7.1algebra

Let U⊆U′⊆M(A) and apply step 6.1 to AU′, whose moved space is M(AU′)=U′. Since (AU′−id)∣U′−1=HU′, the Wall form of AU′ on U′ is χAU′(x,y)=B(HU′x,y); for x,y∈U this equals B(ΠU′SAΠU′x,y)=B(SAx,y)=χA(x,y) by step 5.1, because ΠU′x=x and y∈U⊆U′. Hence the operator attached to AU′ and U by step 5.1 is again HU, and the construction of step 6.1 gives (AU′)U=AU; applying step 7.1 with AU′ in place of A and the subspace U⊆M(AU′)=U′ then gives AU≤OAU′.

8.2step 1.2step 2.2step 7.1

Let r1,…,rk∈O(V) be reflections and A=r1r2⋯rk; since dim⁡M(ri)=1 by step 2.2, the subadditivity of step 1.2 gives dim⁡M(A)≤k. Conversely every A∈O(V) is a product of exactly dim⁡M(A) reflections: if M(A)=0 then A=id is the empty product, and otherwise one picks a line L⊆M(A) and applies step 7.1 to U:=L, obtaining dim⁡M(AL−1A)=dim⁡M(A)−1, so by induction on dim⁡M(A) the element AL−1A is a product of dim⁡M(A)−1 reflections and A=AL⋅(AL−1A) is a product of dim⁡M(A) of them.

9.1step 6.1step 7.2step 8.1

The assignment U↦AU from subspaces of M(A) to {X∈O(V):X≤OA} is injective, because AU=AU′ forces U=M(AU)=M(AU′)=U′ by step 6.1, and surjective by step 7.2; with inverse X↦M(X) it is a bijection. It is an order isomorphism: if U⊆U′ then AU≤OAU′ by step 8.1, and conversely AU≤OAU′ gives U=M(AU)⊆M(AU′)=U′ by the inclusion clause of step 7.2.

9.2step 1.2step 2.2step 8.2F6algebra

Suppose A=r1⋯rm with m=dim⁡M(A) and B=r1⋯rk; the ri are involutions by step 2.2, so B−1A=rk+1⋯rm, whence dim⁡M(B)≤k and dim⁡M(B−1A)≤m−k by step 8.2, while dim⁡M(A)≤dim⁡M(B)+dim⁡M(B−1A) by step 1.2; both inequalities are therefore equalities and B≤OA by [F6].

10.1step 8.2F6∎

Conversely, if B≤OA, write B=r1⋯rk with k=dim⁡M(B) and B−1A=s1⋯sl with l=dim⁡M(B−1A), both by the factorization clause of step 8.2; then A=r1⋯rks1⋯sl is a product of k+l=dim⁡M(A) reflections by [F6], that is, a shortest factorization of A by step 8.2, of which B is the prefix of length k.

Depends on

Used by

Dependency tree · two levels

83 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources