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 Root Lattices and Weyl Group Interfaces — Examples
1 · Prerequisites
- Absolute and Conditional Convergence; Rearrangement; Products
- Algebraic Closure, Embeddings, and Separability
- Algebraic Extensions, Extension Degree, and Finite Fields
- Binary Operations, Monoids, Groups and Subgroups
- Canonical Roots, Signs, and Faithful Reflections
- Cartan Subalgebras and Root Space Decompositions
- Compactness in Metric Spaces
- Completeness, Completion, and Uniform Continuity
- Congruences, the Integers Modulo n and the Chinese Remainder Theorem
- Conjugacy in Sₙ, Generation, and the Simplicity of Aₙ
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Continuity, IVT, EVT, and Uniform Continuity
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Coxeter Presentations, Exchange, and Reduced Word Theorems
- Crystallographic Root Lattices and Weyl Group Interfaces
- Cyclic Groups and Direct Products
- Determinants of Matrices over a Commutative Ring
- Diagonalisation and the Minimal Polynomial
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Divisibility, Greatest Common Divisors and Bézout's Identity
- Dual Spaces, Bilinear and Quadratic Forms, and Sylvester's Law of Inertia
- Eigenvalues, Eigenvectors and the Characteristic Polynomial
- Filters and Ultrafilters
- Finite Counting, Factorials and Binomial Coefficients
- Finite Coxeter Diagrams and Complete Classification
- Finite Fields and Cyclotomic Extensions
- Foundations of the Real Numbers for Analysis
- Free Groups and Presentations
- Fundamental Trigonometric Identities
- Graphs, Walks and Connectivity
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Group Homomorphisms and the Isomorphism Theorems
- Hilbert Space Geometry and Riesz Representation
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Inner Product Spaces, Gram-Schmidt, Projections and Adjoints
- Lie Algebra Representations, Enveloping Algebras, and PBW
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Matrices, the Matrix of a Linear Map, and Change of Basis
- Metric Spaces
- Monotone Functions, Discontinuities, and Continuity Sets
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Normal Subgroups and Quotient Groups
- Normed and Banach Spaces
- Order, Zorn's Lemma, and the Axiom of Choice
- Partitions of Unity and Paracompactness
- pi: the Equivalent Characterizations
- Polynomial Rings, the Division Algorithm and Roots
- Power Series and Real-Analytic Functions
- Primes, Euclid's Lemma and the Fundamental Theorem of Arithmetic
- Properties of the Integral and the Working FTC
- Real Forms and Reflection Geometry
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Rⁿ as a Normed Space; Vector-Valued Functions
- Root Systems, Dynkin Diagrams, and the Cartan-Killing Classification
- Roots, Rational Powers, and Classical Inequalities
- Separation Axioms: the Hierarchy
- Sequences and Limits
- Sequences and Series of Functions; Uniform Convergence
- Series: Convergence and the Nonnegative Tests
- Simple Field Extensions and the Construction of the Complex Numbers
- Sine, Cosine, and the Definition of Pi
- Solvable and Nilpotent Lie Algebras
- Splitting Fields
- Subspaces, Products, and Quotients
- Suprema and Infima
- Symmetric Groups, Cycle Decomposition and the Sign Homomorphism
- The Cantor Set, Baire Category, and Measure Zero in ℝ
- The Derivative and the Mean Value Theorems
- The Determinant of a Linear Operator, Cofactors and Cramer's Rule
- The Fundamental Theorem of Finite Abelian Groups
- The Riemann Integral: Definition and Integrability
- The Spectral Theorem, Positive Operators and Singular Value Decomposition
- The ZFC Axioms and the Basic Set Constructions
- Tits Cones, Chambers, and Parabolic Stabilizers
- Topological Spaces and Continuity
- Topology of ℝ
- Trees, Forests and Spanning Trees
- Triangularisation, Generalised Eigenspaces and Jordan Canonical Form
- Vector Spaces, Linear Subspaces, Span and Direct Sums
2 · Summary
This companion is a dependency leaf. Its examples use the theory of crystallographic-root-lattices-and-weyl-group-interfaces and that page’s established prerequisite closure; no other theory page depends on an item homed here.
The A2 example computes the root and weight lattices and their index. The B2/C2 example compares their dual realizations and lattices. The G2 example constructs the twelve-root system from I2(6), while the I2(5) counterexample proves that no crystallographic scaling gives its simple-root pairing.
Each item gives its hypotheses and verifies the calculations locally. The counterexample isolates the label-5 obstruction; no diagram or symbolic output substitutes for the proof.
3 · Logical flowchart
4 · Definitions, theorems and proofs
None yet.
5 · Examples, counterexamples and false statements
The root and weight lattices: has order three
Statement
Let , , and choose the scaling . A label- edge forces for every crystallographic scaling, so this is the unique scaling up to a common positive factor. Its scaled simple roots have and and its scaled root and coroot lattices are The weight lattice is
(1) Standard coordinates. The isometry sending identifies with times the standard root system. It carries to and to , where The fundamental weights form a basis of dual to the simple coroots.
(2) Indices and comparison. One has For comparison, direct calculation in the standard coordinates gives so . For one has so . These are the two standard root-system realizations of the Coxeter diagram .
Facts & Assumptions
Given: the two-generator Coxeter system with label , the scaling , its Coxeter form , and the standard coordinate root systems , , and .
For a scaling, , , and (Crystallographic scalings: scaled simple roots, coroots and the root, coroot and weight lattices).
A scaling is crystallographic exactly when its Cartan numbers are all integers; in that case, and are the integer spans of the simple roots and simple coroots, is their coroot-pairing dual, and is the scaled root set (Crystallographic scalings: scaled simple roots, coroots and the root, coroot and weight lattices).
If is positive definite, a crystallographic scaling on a connected diagram with no edge of label has equal -values on all vertices (Cartan-number products, allowed edge labels, tree scalings and reflection stability).
The Coxeter form has and for finite (The real Coxeter form, its radical, reflections, and form-preserving maps).
For a nonisotropic normal , its reflection is (The real Coxeter form, its radical, reflections, and form-preserving maps).
The canonical homomorphism satisfies for every generator, where (The canonical reflection homomorphism, roots, reflections, and the positive cone).
Every element of the presented Coxeter group is represented by a finite word in (Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups).
The standard coordinate root set is in the sum-zero hyperplane (Classical root systems in coordinates).
The standard coordinate root set is (Classical root systems in coordinates).
The standard coordinate root set is (Classical root systems in coordinates).
For a regular vector , the positive roots are those with , and a positive root is simple when it is not a sum of two positive roots (Positive systems and simple roots).
The root and coroot lattices are the integer spans of roots and coroots, and the weight lattice is the lattice dual to the coroot lattice (Root, coroot, weight, and coweight lattices).
For a root , its coroot is (Coroot and dual root system).
The fundamental weights for a base of simple roots are the vectors dual to the simple coroots (Fundamental weights).
For every real , and ; cosine strictly decreases on , and (Double-angle and quadratic power-reduction identities, Cofunction, supplementary, quarter-turn, and reflection identities for the six trigonometric functions, Signs, monotonicity intervals, and ranges of sine and cosine, Quarter-turn values and shifts by pi/2 and pi, Pi as twice the smallest positive zero of cosine).
Proof
Put by [F15]. The double-angle and supplementary identities give , hence and . Since , [F4] gives the Gram matrix in . With and , one has , , , , and the displayed Cartan matrix. The form is positive definite because its quadratic form is . Thus the chosen scaling is crystallographic, and [F3] shows every crystallographic scaling has , so this is unique up to a common positive multiple.
By bilinearity, the reflection formula [F5] defines linear maps and gives , , , , , and ; by linearity the set is stable under both reflections. By [F6], and , since the reflection formula is unchanged by scaling its normal; by [F7], every is a word in , so . Conversely, belong to , while , , , and . Thus .
For , set the roots and from the coordinate model [F9]. Their coroots are , . The full coordinate root set in [F9] contains , so . Its coroot set consists of and ; these span exactly , since both displayed generators are coroots and every listed coroot lies in their span. Thus [F12] gives . The nontrivial coset is generated by , of order two, so .
For , set the roots and from the coordinate model [F10]. Their coroots are and . The full root set in [F10] yields : the two generators are roots and each other root is an integer combination of them. Its coroot set contains and and is contained in , so . Thus [F12] gives . The quotient is generated by , which has order two because and ; hence .
In each coordinate model, the reflection formula [F5] gives the maps and for the displayed and root pairs; the second map is unchanged when its normal is instead of . Both maps are involutions. Their product sends ; its square is and its fourth power is , so its order is four. Thus both standard systems realize the Coxeter diagram , giving the stated diagram coincidence.
Put and . The linear map sending and is an isometry: the images have squared lengths and inner product , matching their Gram matrix from [F4]. By step 1.2 it sends to , the standard coordinate root system of [F8]. For , its positive roots are ; thus [F11] makes its simple roots.
The two simple roots have squared length , so [F13] gives their simple coroots ; hence and . Since every root in the standard coordinate set has squared length , its coroot lattice is by [F8,F11,F12,F13]. The isometry of step 2.1 sends to and to , where . By [F12], the image of is the lattice dual to , namely , where .
For , the pairings defining are and . Thus membership is equivalent to having integral coordinate differences. If those differences are integers, write and with ; the sum-zero condition gives , so all coordinates lie in . Conversely the displayed conditions make both pairings integral. Hence .
The vectors and satisfy , since by [F13]. They are the fundamental weights by [F14] and form a basis of : any has integer pairings with the basis and therefore is the corresponding integer linear combination of . In this basis and ; hence and in . The quotient is nontrivial because , so it is cyclic of order three. Therefore , , and .
The lattices satisfy and , whereas both standard and coordinate systems have weight/root index two. No Choice is used: every step is a finite coordinate calculation on the displayed bases and finite root sets.
The two realizations of : and with their lattices and duality
Statement
Let with , and Coxeter form , . Then is finite and is positive definite. Consider the two crystallographic scalings
(1) Both scalings and their Cartan matrices. For the scaled Cartan matrix is ; for it is .
(2) Root systems and duality. Under the isometry with the scaled root sets are and , where Both are reduced crystallographic Euclidean root systems. Moreover , so the two length assignments realize the dual systems of the same Coxeter diagram .
(3) Root and coroot lattices. In the standard coordinates, Thus duality exchanges the root and coroot lattices.
(4) Weight lattices. The weight lattices dual to the coroot lattices are Consequently , while a direct coordinate calculation gives .
Facts & Assumptions
Given: the rank-two Coxeter system with , its Coxeter form , the two positive scalings in the Statement, and the standard coordinate root sets , , and .
For a scaling, , , and (Crystallographic scalings: scaled simple roots, coroots and the root, coroot and weight lattices).
In the crystallographic case, and are the spans of the scaled simple roots and coroots, is dual to , and (Crystallographic scalings: scaled simple roots, coroots and the root, coroot and weight lattices).
For a forest with labels in , rooting each component and setting along root-oriented edges gives a positive crystallographic scaling (Cartan-number products, allowed edge labels, tree scalings and reflection stability).
For a crystallographic scaling, and (Cartan-number products, allowed edge labels, tree scalings and reflection stability).
and for finite labels (The real Coxeter form, its radical, reflections, and form-preserving maps).
For a nonisotropic normal , (The real Coxeter form, its radical, reflections, and form-preserving maps).
The canonical reflection homomorphism satisfies with (The canonical reflection homomorphism, roots, reflections, and the positive cone).
The presented Coxeter group is the quotient by the relators and for finite labels (Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups).
Every element of the presented Coxeter group is the value of a finite word in (Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups).
The standard coordinate root set is in the sum-zero hyperplane (Classical root systems in coordinates).
The standard coordinate root set is (Classical root systems in coordinates).
The standard coordinate root set is (Classical root systems in coordinates).
Each displayed coordinate set is a reduced crystallographic Euclidean root system with standard simple roots (Classical root systems in coordinates).
For a reduced crystallographic root system, and are the integer spans of roots and coroots and is the lattice dual to (Root, coroot, weight, and coweight lattices).
A root has coroot (Coroot and dual root system).
For a regular vector , the positive roots are those with , and a positive root is simple when it is not a sum of two positive roots (Positive systems and simple roots).
The Cartan matrix of a based root system uses rows indexed by coroots: (Cartan matrix of a based root system). Thus it is the transpose of the scaled matrix of [F1].
Proof
Put . The relators in [F8] give and ; also . Replacing by and moving each to the right with , every word reduces to or , with . Every -element is such a word by [F9], so has at most eight elements and is finite. In coordinates , the form is , so it is positive definite.
The single edge is a tree with label . Rooting first at and then at , [F3] gives and ; both are crystallographic. Their scaled simple roots and coroots are , , , and , , , . Using [F1] and [F5] gives and .
For , [F4] gives , , , and . By linearity of the reflections, , , , and , so is stable under . By [F6], these maps are linear and invariant under nonzero rescaling of their normals; since and , and . Then [F7] identifies them with , and [F9] gives . For one has , , , and , hence on the basis . The four positive listed vectors are , , and ; applying supplies their negatives. Therefore .
Put , , and . In , choose , which pairs nontrivially with every root in [F11]. Its positive roots are , , and ; the latter two are and , while are not sums of two listed positive roots. Thus they are simple by [F16]. In , the same pairs nontrivially with every root in [F12] and gives positive roots , , and ; the latter two are and , while are not sums of two listed positive roots. Thus are simple by [F16]. The reflections in the first roots swap the coordinates and those in the second roots negate the second coordinate by [F6]; the second reflection is the same for normals and . Their product is a quarter-turn of order four. Therefore both coordinate root systems have Coxeter diagram .
In , put and . The vector pairs nontrivially with every root in [F10], and its positive roots are , so [F16] makes simple. All roots have squared length , so their coroots equal the roots by [F15], and . By [F14] the dual weight lattice is . If and , then and , where and ; these vectors are in , and every has the same pairings with as , so equality follows because span . Thus they form a basis. In this basis and , so is generated by , with and because . Thus .
For , [F4] gives , , , and . The further images are , , , and , so is stable under both generators. The normal-scaling identity from step 1.3 applies to this scaling as well. For , , , and , hence . The positive listed vectors are generator roots or their images: are generator roots, , and . Applying supplies their negatives. As in 1.3, .
In , the roots generate . The coroots of are ; the mixed roots are their own coroots. These coroots span exactly : both displayed generators occur, and every other coroot is an integer combination of them. In , the roots and generate , and the remaining roots lie in that span. Its coroot set contains and is contained in , so . Hence and .
By [F14], the dual of is ; writing , gives . Since , the quotient is generated by the nontrivial class of ; it is not in and its double lies in , so it has order two. For , , so ; the quotient by is generated by , which is nonzero because and has order two because . With the simple systems of step 1.4, [F15] gives coroots , , , . In the row-coroot convention [F17], , , and , yielding Cartan matrices and , both with determinant .
The map in the Statement is an isometry: the images of have squared lengths and inner product , which matches [F5]. It sends to , , , ; it sends to , , , . By [F11,F12], these are exactly and ; [F13] states that these coordinate root sets are reduced crystallographic systems. Positive scaling preserves those axioms: finiteness, spanning and reducedness are preserved, reflection normal lines are unchanged, and Cartan integers are unchanged by a common scalar. Thus both and are reduced crystallographic root systems. The coroots of in are , while mixed roots have squared length and are their own coroots; hence . Since for by [F15], and .
All calculations use the fixed two-generator data and explicit finite coordinate root sets. No Choice is used.
G2 from I2(6): the scaled realization and its twelve roots
Example
Let with , let with Coxeter form , and let and be the presented Coxeter group and canonical reflection homomorphism. Then is positive definite and has order . The scaling , has Cartan matrix and scaled root set where and . The squared -norms are on and on ; every root-coroot pairing is integral, including , and . This is the irreducible reduced crystallographic root system of type , and its Weyl group is . The other scaling , gives and satisfies , the dual orientation of the same diagram.
Facts & Assumptions
Given: , , , the Coxeter form , the presented Coxeter group , its canonical reflection homomorphism , and the scaling conventions of Crystallographic scalings: scaled simple roots, coroots and the root, coroot and weight lattices.
The presentation has generators and relators and (Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups).
The canonical homomorphism satisfies for each (The canonical reflection homomorphism, roots, reflections, and the positive cone).
For a scaling , , , and (Crystallographic scalings: scaled simple roots, coroots and the root, coroot and weight lattices).
Cosine is strictly decreasing on , , , and (Signs, monotonicity intervals, and ranges of sine and cosine, Quarter-turn values and shifts by pi/2 and pi, Cofunction, supplementary, quarter-turn, and reflection identities for the six trigonometric functions, Double-angle and quadratic power-reduction identities, Pi as twice the smallest positive zero of cosine).
On a one-edge tree labelled , the tree construction with root scale gives the positive crystallographic scaling , (Cartan-number products, allowed edge labels, tree scalings and reflection stability, clause (3)).
If is crystallographic, then for every , where and (Cartan-number products, allowed edge labels, tree scalings and reflection stability, clause (4)).
A reduced crystallographic Euclidean root system is finite, spans its inner-product space, is stable under reflection in every root, has integral Cartan pairings, and has only on each root line (Reduced crystallographic Euclidean root system).
Reducibility is an orthogonal decomposition of the root set into two nonempty parts; irreducibility means no such decomposition (Reducible and irreducible root systems).
For a regular vector , positive roots are those with positive inner product with , and a positive root is simple if it is not a sum of two positive roots (Positive systems and simple roots).
An irreducible reduced crystallographic root system of rank two with six positive roots is of type ; the other irreducible rank-two types have three positive roots () or four () (Rank-two root-system classification, clause (iv)).
The Weyl group is generated by the reflections in all roots of (Weyl group).
Every element of is the value of a finite word in (Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups).
Verification
Given: and .
Proof technique: direct presentation and orbit computations, followed by verification of the root-system axioms.
Since , evaluating functions at and shows that is a basis. Put . Since , [F5] gives . The supplementary and double-angle identities give , so and hence . Applying the double-angle identity at and using positivity again gives . Thus , which is positive for every nonzero , so is positive definite. Set ; then , and . Moving each to the right shows every word is or , with , so .
By [F6] and step 1.1, and give a crystallographic scaling. Hence , , , , and , so . Choosing as the tree root gives the other scaling , ; the same Cartan formula gives .
In coordinates relative to , the reflection formula [F14] gives and ; each matrix squares to the identity. These maps preserve : on the six displayed positive pairs their respective images are and , and the images of their negatives are the negatives of these. Conversely , , and . For every orbit vector , the element sends to , so all twelve pairs lie in the orbit of the simple roots. Substituting positive scalar multiples in the reflection formula gives and ; hence by [F15]. The squared norm of is , whose values on are respectively . The product has matrix , with and ; hence has exact order . The six maps are distinct, as are , and the two lists are disjoint since their determinants are and . Thus ; with step 1.1 this gives and is injective.
For every nonisotropic , expansion of [F14] gives ; applying this to shows the generators of preserve , hence so does every . If by [F15], then , and conjugating the reflection formula by the -isometry gives , so . The set is finite, nonzero and spans ; its root-coroot pairings are integral by [F7] and its reducedness follows from the six distinct root slopes. Therefore is a reduced crystallographic Euclidean root system.
Let ; the Gram matrix from [F2], [F4] and step 1.1 gives . The vectors and form a basis. Thus for each listed pair with , , and the six listed vectors are exactly the positive roots. Neither nor is a sum of two positive roots, since the only positive root with second coordinate zero is and the only one with first coordinate zero is ; the other positive roots decompose as , , and . Hence is a base. Since , these two spanning roots cannot belong to different orthogonal parts in a decomposition, while they already span ; [F9] therefore gives irreducibility. By [F11], the root system is of type .
Every root reflection is as in step 3.1, so [F12] gives ; conversely and generate , so and it has order . For the second scaling, and ; because preserves , , whence by [F7]. This construction uses only the two fixed generators and finitely many roots, so no form of the Axiom of Choice is used.
No form of the Axiom of Choice is used; all choices and computations involve the two fixed generators and finite sets.
admits no crystallographic scaling and no reduced crystallographic root system with that base pairing
Statement refuted
(a) Every finite Coxeter matrix admits a crystallographic scaling (Crystallographic scalings: scaled simple roots, coroots and the root, coroot and weight lattices); in particular the rank-two geometry with and does.
(b) There is a reduced crystallographic Euclidean root system with a base whose simple roots satisfy the normalized pairing of the two basis vectors of the Coxeter form.
Facts & Assumptions
Given: the rank-two Coxeter matrix on with , the space with basis and the Coxeter form , a scaling with scaled simple roots and Cartan numbers , and, in the second refutation, a reduced crystallographic Euclidean root system with a base .
, while for ; in particular is finite (Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups).
is the unique symmetric bilinear form on with , and (The real Coxeter form, its radical, reflections, and form-preserving maps).
For distinct with finite and , the plane has , so is positive definite (Reflections: involutivity, form invariance, fixed hyperplane, and exact rank-two order (3)(i)).
is finite if and only if is positive definite (Finiteness criterion: W is finite exactly when the Coxeter form is positive definite (1)).
with is the diagram of two vertices joined by one edge labelled , , and with admits no crystallographic scaling (Classification of finite Coxeter systems, including the H and dihedral families (1), (4); Crystallographic finite type: the Weyl types, reduced realizations and lattice stability (1)).
The scaling data are , , , and is crystallographic exactly when for all (Crystallographic scalings: scaled simple roots, coroots and the root, coroot and weight lattices).
For every scaling, and for distinct with finite (Cartan-number products, allowed edge labels, tree scalings and reflection stability (1)).
If is positive definite and is crystallographic, then for all distinct one has and (Cartan-number products, allowed edge labels, tree scalings and reflection stability (2)).
A reduced crystallographic Euclidean root system is a finite spanning set closed under its root reflections, with integral Cartan integers and (Reduced crystallographic Euclidean root system).
For nonproportional with angle one has , where and ; if is a base of a rank-two system, then and is one of , , , (Rank-two root-system classification (i), (iv)).
Distinct simple roots of a reduced crystallographic root system satisfy (Distinct simple roots have nonpositive inner product).
and for all real (Double-angle and quadratic power-reduction identities).
Cosine is strictly decreasing on , with and range (Signs, monotonicity intervals, and ranges of sine and cosine, Quarter-turn values and shifts by pi/2 and pi).
A base is the set of simple roots of a positive system, and the simple roots form a basis of the ambient space (Positive systems and simple roots, Simple roots form a signed integral basis).
Counterexample
The geometry: by [F2] the form has and , and since is the plane of [F3] with , [F3] makes positive definite; hence is finite by [F4], and the diagram is , conventionally also named , by the classifier clauses (1), (4) in [F5]. The normalized pairing of the two basis vectors is .
The value : put . By [F13] at one has , while [F12] gives ; hence , that is . Since (as by [F15]) and cosine is strictly decreasing on with by [F14], one has , so forces .
The product is strictly between and : for every scaling , [F7] gives , and [F12] at rewrites this as . Since we have (because and ), and cosine is strictly decreasing on with and by [F13, F14] and step 1.2; therefore , and hence .
No crystallographic scaling exists: if were crystallographic, then and would both be integers by [F6], so their product would be an integer; but step 2.1 places that product strictly between the consecutive integers and . This contradiction refutes (a) for the geometry , : at least one of is non-integral for every scaling. Equivalently, [F8] would force , which contradicts, and [F5] records the resulting exclusion of from the crystallographic finite types.
No root system realizes (b): suppose were a reduced crystallographic Euclidean root system with base and . By [F16], is linearly independent, so the roots are nonproportional and [F10] applies. Unfolding the two Cartan integers, and by step 2.1 this number lies in ; but [F10] states , a contradiction. Hence no reduced crystallographic root system has a base with the normalized pairing . This is consistent with [F10] (iv) read together with [F11]: a rank-two base has nonacute angle among , and each of those angles gives , never the value .
The failure and its range: the dropped hypothesis identified by this counterexample is that a crystallographic scaling requires the cross product to be an integer, hence (for positive definite ) equal to one of , equivalently a label ; the value gives the non-integral number that is strictly between the admissible integer values of that product. Both refutations are independent of each other: (a) is a statement about scalings of one Coxeter geometry, (b) about bases of reduced crystallographic root systems, and their common obstruction is the same interval for ; the full exclusion of from the Weyl types is the criterion (1) of Crystallographic finite type: the Weyl types, reduced realizations and lattice stability. No choice principle is used, and the computations are finite real arithmetic in a two-dimensional space.