Alphabeta Math
ExampleConstruction: AI-generatedVerification: AI-generatedPipeline-generatedaudited 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.

B-tilde versus C-tilde: the n=2 coincidence and the duality behind the difference

Example

Compare the standard affine diagrams B~n and C~n (The standard affine diagrams A-tilde, B-tilde, C-tilde, D-tilde, E-tilde, F-tilde and G-tilde (2),(3)) and the crystallographic scalings that produce them:

(i) The coincidence at n=2. B~2=C~2 is the three-vertex path with edge labels (4,4): the n=2 member is defined by the coincidence convention, and both its edges carry label 4. Both arise from the same finite type: B2 and C2 are the same Coxeter system (Crystallographic finite type: the Weyl types, reduced realizations and lattice stability (1) and the finite coincidence B2=C2=I2(4) of Classification of finite Coxeter systems, including the H and dihedral families (4)), and the Bn- and Cn-scalings with n=2 are exchanged by duality (Crystallographic finite type: the Weyl types, reduced realizations and lattice stability (4)).

(ii) The difference for n≥3. B~n has a vertex of degree 3 (the vertex v2 carrying the extra v0) and exactly one edge labelled 4, namely {vn−1,vn}; C~n is a path and has exactly two edges labelled 4, at its two ends. Hence for n≥3 the two diagrams are not isomorphic: any graph isomorphism maps each vertex's neighbor set bijectively to the corresponding neighbor set and therefore preserves degrees, but the degree sequences disagree.

(iii) Both are affine. By Crystallographic alcove diagrams: the affine list realized by Weyl types A–G (3), the cosine matrices of B~n and C~n are positive semidefinite of corank one with positive kernel vectors; concretely, for C~n the vector (1,2,2,…,2,1) (first and last entry 1) lies in the kernel, and for B~n with n≥3 the vector (1,1,2,2,…,2,2) (entries ordered v0,v1,v2,v3,…,vn, i.e. x0=x1=1, x2=⋯=xn−1=2, xn=2) lies in the kernel; in both cases the entries are positive.

(iv) Why the Coxeter diagram alone does not decide the lattice. Bn and Cn have the same finite Coxeter diagram but their two crystallographic scalings are dual (Crystallographic finite type: the Weyl types, reduced realizations and lattice stability (4), Crystallographic scalings: scaled simple roots, coroots and the root, coroot and weight lattices); the fundamental alcoves are bounded n-simplices (triangles when n=2) (Highest-root dominance and the fundamental alcove (2)), but the affine Weyl groups Wa(Bn)=Q∨⋊W and Wa(Cn)=Q∨′⋊W (Affine root hyperplanes, coroot translations, alcoves, and the affine reflection group, Affine reflections: translation form, involutivity, local finiteness, and Wa=Q∨⋊W (4)) realize the two different Coxeter diagrams B~n and C~n for n≥3 (Crystallographic alcove diagrams: the affine list realized by Weyl types A–G (1),(5), Alcove transitivity, the affine Coxeter presentation, and the length function (2)), and for n≥3 they are not isomorphic even as abstract groups: Wa(Bn) has a maximal finite subgroup of order 2n−1n!, whereas Wa(Cn) has none, as proved below. Thus the Coxeter diagram of the finite system does not determine which lattice acts.

(v) Convention warning. The labels 4 here are orders of facet-reflection products, i.e. Coxeter labels (cos⁡(π/4)=2/2) (Crystallographic alcove diagrams: the affine list realized by Weyl types A–G (1)), not Lie-theoretic bond multiplicities; the extended affine Weyl group P∨⋊W is a further, different object (Alcove transitivity, the affine Coxeter presentation, and the length function (4)).

Facts & Assumptions

Given: The two affine families and their finite Bn,Cn root-system scalings.

[F1]

The n=2 coincidence is a definition, and for n≥3 the B recipe has one branch and one 4-edge, while the C recipe is a path with two 4-edges (The standard affine diagrams A-tilde, B-tilde, C-tilde, D-tilde, E-tilde, F-tilde and G-tilde (2),(3),(7)).

[F2]

The cosine matrices of both standard affine diagrams are positive semidefinite of corank one and have positive kernel vectors (Crystallographic alcove diagrams: the affine list realized by Weyl types A–G (3)).

[F3]

The affine facet-product labels mijΦ=ord⁡(sisj) give the standard affine diagrams of the corresponding Bn,Cn root systems, which occur in the list; their n=2 convention is shared (Crystallographic alcove diagrams: the affine list realized by Weyl types A–G (1),(4)).

[F4]

The finite Bk,Ck systems have the same Coxeter diagram and its label-4 path admits the two dual crystallographic scalings (Crystallographic finite type: the Weyl types, reduced realizations and lattice stability (1),(4)).

[F5]

By the finite-type and crystallographic theorems, the standard finite Coxeter groups of types Bk,Ck, and Dk for k≥4 are isomorphic to Weyl groups of based crystallographic root systems with the standard generators matched to simple-root reflections. The based-root uniqueness theorem identifies these with the coordinate root systems of [F6] when the Cartan matrices agree (Crystallographic finite type: the Weyl types, reduced realizations and lattice stability (2), The Cartan matrix determines a based root system).

[F6]

The coordinate root sets and simple roots for An,Bn,Cn,Dn are those displayed in Classical root systems in coordinates.

[F7]

The coroot is α∨=2α/B(α,α), and the affine Weyl group has the Euclidean decomposition Wa=Q∨⋊W (Affine root hyperplanes, coroot translations, alcoves, and the affine reflection group, Affine reflections: translation form, involutivity, local finiteness, and Wa=Q∨⋊W (4)).

[F8]

The affine-Gram classification theorem supplies the faithful slice model, its affine relation and intersection formula, strict closed fundamental domains, and finiteness of proper standard parabolics (Classification of affine Coxeter diagrams and their Euclidean simplex realization (2)–(4)).

[F9]

The finite Coxeter classification gives A1=B1, B2=C2=I2(4) and D3=A3 (Classification of finite Coxeter systems, including the H and dihedral families (4)).

[F10]

Support determines standard-parabolic membership and the restricted Coxeter presentation (Support, intrinsic parabolic presentations, minimal coset representatives and length additivity, with the type-A identification (1)–(2)).

[F11]

The affine facet reflections generate the affine Weyl group, have the exact Coxeter presentation and act simply transitively on alcoves; the comparison clauses distinguish the extended lattice group (Alcove transitivity, the affine Coxeter presentation, and the length function (1)–(4)).

Proof

technique · direct; all finite coordinate constructions use no choice principle
1.1F1F3F4F9algebra

At n=2, [F1] specifies the common (4,4) path; [F3] realizes it from each dual root-length assignment. The finite systems coincide by [F9], and their two scalings are exchanged by [F4]. For n≥3, the B graph has a degree-three vertex and one 4-edge, whereas the C graph has degrees at most two and two 4-edges. A graph isomorphism would biject each vertex's neighbors and preserve degree, which is impossible for these degree sequences.

1.2F1F2F12

By [F12], if c4:=cos⁡(π/4) and c3:=cos⁡(π/3), then c4=2/2 and c3=1/2: positivity follows from 0<π/4,π/3<π/2 and strict decrease to cos⁡(π/2)=0; for c4 the double-angle identity gives 2c42=1, and for c3 it gives 2c32−1=cos⁡(2π/3)=−c3, so (2c3−1)(c3+1)=0 and c3=1/2. Put c=c4. For C~n, take endpoint coordinates 1 and all n−1 interior coordinates 2. Each endpoint equation is 1−c2=0; at n=2 the central equation is 2−2c=0; for n≥3, a vertex next to an end has equation 2−c−2/2=0, and any other interior vertex has equation 2−(2+2)/2=0. For B~n, n≥3, use x0=x1=1, x2=⋯=xn−1=2, xn=2. At each branch leaf the equation is 1−x2/2=0. At v2, the equation is 2−(1+1)/2−c2=0 when n=3, and 2−(1+1+2)/2=0 when n≥4. Every intervening chain vertex (if any) has equation 2−(2+2)/2=0; the vertex vn−1 for n≥4 has equation 2−1−c2=0, and the final vertex has equation 2−2c=0. Thus the displayed vectors are positive kernel vectors; [F2] independently gives the semidefinite corank-one assertion. At n=2 use the C vector (1,2,1) for both names.

1.3F5F6F9algebra

In the coordinate models [F6], for k≥2 the finite Coxeter groups of type Bk or Ck are identified by [F5] with the Weyl groups on the displayed root sets. Their simple reflections interchange neighboring coordinates or change the last coordinate's sign; conjugating by permutations permits each sign change. Every root reflection is a signed permutation, and these generators give all signed permutations, so the group has order 2kk!. For Dk, k≥4, [F5,F6] identify the finite Coxeter group with the Weyl group of roots ±ei±ej. Its adjacent swaps and the reflection in ek−1+ek generate exactly the permutations with an even number of sign changes: composing that reflection with the swap gives a double sign change, and conjugates give all pairs. Every root reflection has even sign parity, so the group has order 2k−1k!. For k=3, the remaining all-3 path is A3=D3 by [F9]; its coordinate roots ei−ej on the sum-zero subspace of R4 give all transpositions of four coordinates, so its group is S4 of order 24. A one-vertex A1 factor has the sign reflection group of order 2, and the rank-zero group is trivial.

1.4F8F10algebra

Every finite subgroup H of either affine group fixes a point: average the finite orbit Hx for any x; affine linearity makes its barycentre fixed by H. By [F8]'s strict closed fundamental domain, conjugate this point into Aˉ. For p∈Aˉ, let T(p) be the types of facets containing p. The affine relation in [F8] gives T(p)⊊S. The intersection formula in [F8] and support criterion [F10] show Stab⁡(p)=WT(p): if wp=p, then p∈wAˉ∩Aˉ, so every type in S(w) is in T(p), hence w∈WT(p); conversely every generator indexed by T(p) fixes p. This stabilizer is finite by [F8]'s proper-parabolic clause. The face containing p has a vertex v; all its containing facet reflections fix v, so H≤WT(p)≤Stab⁡(v). Applying the same stabilizer identity to v shows Stab⁡(v)=WT(v), a finite proper parabolic. At a vertex v, the n incident facets have a unique intersection, so their normals span the ambient direction space and their reflections have common fixed-point set exactly {v}. If a finite group contained Stab⁡(v), its barycentre would be fixed by this stabilizer, hence would equal v; the group would then be contained in Stab⁡(v). Thus every vertex stabilizer is maximal finite, and every maximal finite subgroup is conjugate to one.

2.1F1F9F10step 1.3step 1.4algebra

Set N=2nn! and let n≥3. Deleting the endpoint vn of the 4-edge from B~n leaves the finite all-3 Dn graph (at n=3, the path A3=D3). Its parabolic is the stabilizer of the opposite vertex, hence maximal finite by Step 1.4, and has order N/2 by Step 1.3. Deleting vertex vi, 0≤i≤n, from C~n leaves two finite terminal-4 paths of ranks i and n−i, interpreted as B1=A1 or rank-zero trivial blocks at the ends. Its vertex stabilizer has order 2ni!(n−i)! by the restricted presentation [F10] and Step 1.3; the two blocks commute and their presented group is the direct product. At i=0,n this is N. For 1≤i≤n−1, (ni)≥n: the ratio (ni+1)/(ni)=(n−i)/(i+1) shows the binomial coefficients increase to the middle and then decrease symmetrically, so their minimum on these indices is (n1)=(nn−1)=n. Hence the order is at most N/n<N/2. By Step 1.4 these are all maximal finite subgroup orders in Wa(Cn). The two groups therefore cannot be abstractly isomorphic, since an isomorphism preserves finiteness, maximality and subgroup order.

3.1F3F6F7F11step 1.1step 1.3step 2.1algebra∎

The different coroot lattices can also be seen directly. For Bn with short roots ±ei, its coroots are ±2ei and ±ei±ej, whose integer span is {z∈Zn:∑izi is even}: the generators have even sum, and subtracting zi(ei−en) for i<n leaves an even multiple of en. For Cn with long roots ±2ei, their coroots include all ±ei, so the lattice is Zn. Both finite Weyl groups are the same signed permutation group by [F6], and [F3] identifies their affine facet diagrams with the standard B~n,C~n diagrams; Step 1.1 shows these differ in degree data. Step 2.1 proves the stronger abstract distinction for n≥3. Their chambers have dimension n; when n=2 the common affine diagram yields isomorphic Coxeter groups by [F3,F11] despite the dual coordinate normalizations. The decomposition [F7] identifies the translation lattices in these semidirect products with the two coroot lattices just computed. Finally, label 4 is the actual product order by [F3], not a bond multiplicity, and the extended weight-lattice group is a distinct comparison object by [F11]. All comparisons use finite coordinates and averaging, without Choice.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

150 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