Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generatedjudge 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 real Coxeter form, its radical, reflections, and form-preserving maps

Definition

Let S be a finite set and let m be a Coxeter matrix on S, so that m(s,s)=1 and m(s,t)=m(t,s)∈{2,3,… }∪{∞} for s≠t (Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups).

(1) The space and its distinguished functions. Let V:=RS be the real vector space of all functions S→R, with pointwise operations (The vector space FX of all functions X→F with pointwise operations, and Fn as the case X=n={0,1,…,n−1}); it is a vector space over the ordered field R (The reals form a totally ordered field). Write u(s) for the value of u at s and put es(s):=1, es(t):=0 for t≠s.

(2) The Coxeter form. For finite m(s,t) put c(s,t):=cos⁡(π/m(s,t)) (Sine and cosine defined by their real power series, Pi as twice the smallest positive zero of cosine) and for m(s,t)=∞ put c(s,t):=1; then c(s,t)=c(t,s) and c(s,s)=cos⁡π=−1. The Coxeter form B is the unique symmetric bilinear form on V with B(es,et)=−c(s,t) for all s,t∈S; in particular B(es,es)=1 and B(es,et)=−cos⁡(π/m(s,t)) for finite m(s,t), while B(es,et)=−1 when m(s,t)=∞ (Bilinear forms, and symmetric, skew-symmetric, and alternating bilinear forms, Bilinear forms on V correspond linearly and bijectively to linear maps V→V∗). No positive definiteness, definiteness or nondegeneracy of B is presumed: rad⁡(B):={u:B(u,v)=0 for all v∈V} may be nonzero (The matrix, left and right radicals, rank, and nondegeneracy of a bilinear form on a finite-dimensional space), and the form may be indefinite (Positive and negative definiteness, the inertia (p,q,r), rank p+q, and signature p−q of a real symmetric bilinear or quadratic form). A linear map g:V→V is B-preserving when B(gu,gw)=B(u,w) for all u,w∈V.

(3) Reflections. For a∈V with B(a,a)≠0 define the reflection with normal a by ra(v):=v−2B(v,a)B(a,a)a. The definition asserts neither that ra is linear or an involution nor that ker⁡B(−,a)={v:B(v,a)=0} is a hyperplane; these are proved in Reflections: involutivity, form invariance, fixed hyperplane, and exact rank-two order ↗. When B(a,a)=0 the symbol ra is not defined.

Depends on

Used by

…and 75 more results.

Dependency tree · two levels

52 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