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.

Crystallographic scalings: scaled simple roots, coroots and the root, coroot and weight lattices

Definition

Let S be a finite set, let m be a Coxeter matrix on S, let W be the presented Coxeter group with its universal property (Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups), let V=RS be the real vector space with its basis (es)s∈S, let B be the Coxeter form and let ρ:W→GL(V) be the canonical reflection homomorphism with its reflections ra and root system Φ (The real Coxeter form, its radical, reflections, and form-preserving maps, Reflections: involutivity, form invariance, fixed hyperplane, and exact rank-two order, The canonical reflection homomorphism, roots, reflections, and the positive cone). No definiteness or nondegeneracy of B is assumed.

A scaling of this geometry is a family c=(cs)s∈S of positive real numbers; with as:=cses define as∨:=2asB(as,as)=2escs,ast:=B(as,at∨)=2B(as,at)B(at,at)(s,t∈S).

Since cs>0 and (es)s∈S is a basis, the as form a basis of V and B(as,as)=cs2B(es,es)=cs2≠0 (The real Coxeter form, its radical, reflections, and form-preserving maps, Basis of a vector space: a linearly independent spanning subset; and ordered basis: an injective finite list whose image is a basis); hence each as∨ is defined, and as∨=2csescs2=2escs. The reflection ras of The real Coxeter form, its radical, reflections, and form-preserving maps is the generator reflection res of the geometry, because the reflection formula depends only on the line spanned by the normal: for λ≠0 and B(a,a)≠0 substitution gives rλa(v)=v−2B(v,λa)B(λa,λa)λa=v−2B(v,a)B(a,a)a=ra(v), so rλa=ra, and as=cses with cs>0. The number ast∈R is the Cartan number of the ordered pair (s,t), and ass=B(as,as∨)=B(as,2asB(as,as))=2.

The scaling c is crystallographic when ast∈Z for all s,t∈S, equivalently when B(at,as∨)∈Z for all s,t∈S. In that case define the root lattice, coroot lattice and weight lattice of the scaling by Q:=∑s∈SZas,Q∨:=∑s∈SZas∨,P:={λ∈V:B(λ,q∨)∈Z for all q∨∈Q∨}, the scaled root set Φc:={ρ(w)as:w∈W, s∈S}, and the scaled Cartan matrix A:=(ast)s,t∈S of c.

Well-definedness, lattice provisos, and the interface with the published lattices

as=cses and as∨=2es/cs are nonzero scalar multiples of the basis vectors es, so both (as)s∈S and (as∨)s∈S are bases of V. Thus Q and Q∨ are free abelian subgroups of rank ∣S∣. The set P is an additive subgroup, since each condition B(λ,q∨)∈Z is preserved by addition and negation. If q=∑s∈Smsas∈Q and q∨=∑t∈Sntat∨∈Q∨ with ms,nt∈Z, then B(q,q∨)=∑s,t∈SmsntB(as,at∨)=∑s,t∈Smsntast∈Z in the crystallographic case, so Q⊆P.

Here a lattice in V means a discrete subgroup whose real span is V; this convention includes the rank-zero lattice {0} when V=0. The map φ:V⟶RS,φ(λ):=(B(λ,as∨))s∈S, is linear. Because (as∨)s∈S is a basis and B is symmetric, ker⁡φ=rad⁡(B): vanishing against each as∨ is equivalent by linearity to vanishing against every vector of V. Hence φ is injective exactly when B is nondegenerate; both its domain and codomain have dimension ∣S∣, so the rank-nullity theorem (Rank-nullity: dim⁡FV=nullity⁡T+rank⁡T) makes this equivalent to φ being an isomorphism. If φ is an isomorphism then P=φ−1(ZS) is the Z-span of the real basis (ωs)s∈S characterized by B(ωs,at∨)=δst, so it is a lattice. If B is degenerate then rad⁡(B)⊆P, so P contains a nonzero linear subspace and is not discrete. For instance for S={s,t}, m(s,t)=∞, cs=ct=1 one has B(es,et)=−1 and P={λ:λs−λt∈12Z}, a union of parallel lines. In particular P is a lattice in the positive definite setting of (2) of Cartan-number products, allowed edge labels, tree scalings and reflection stability and of Crystallographic finite type: the Weyl types, reduced realizations and lattice stability ↗; in the degenerate range the term "weight lattice" names P without a discreteness claim.

When B is positive definite and Φc has been proved to be a reduced crystallographic Euclidean root system with base {as:s∈S} (Crystallographic finite type: the Weyl types, reduced realizations and lattice stability ↗ (2)), the sets Q, Q∨ and P are exactly the root lattice, coroot lattice and weight lattice of that root system in the sense of Root, coroot, weight, and coweight lattices, and the elements as∨=2asB(as,as) are its simple coroots in the sense of Coroot and dual root system. The definition is deliberately stated before that identification is available: it is a property declaration for the pair (geometry, scaling), and the paragraphs above justify only its own well-definedness.

This item asserts no existence of a crystallographic scaling, and in particular makes no claim about the non-crystallographic finite types H3, H4, or I2(m) with m∉{2,3,4,6}. It also does not assert that Φc is a root system, that Q=ZΦc, or that any pairing B(β,γ∨) of non-simple elements of Φc is an integer: for a crystallographic scaling these facts are proved in Cartan-number products, allowed edge labels, tree scalings and reflection stability and Crystallographic finite type: the Weyl types, reduced realizations and lattice stability ↗. No choice principle is used: S is finite and every object above is defined from the given finite data.

Depends on

Used by

Dependency tree · two levels

69 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