Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generated
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.

Integral facet displacements with closed-alcove dominant representatives

Statement

Assume the inherited Axiom of Choice. Let R be an irreducible simply-laced root system, normalize roots to squared length two, and write θ=∑aiαi, h=1+∑ai. Let ℓ>h be odd and k=ℓ−h. Put C={x:(x+ρ,αi)>0, (x+ρ,θ)<ℓ}. For every integral μ∈C and every facet F of its closure, there is an integral point λ in the relative interior of F such that the ordinary Weyl-dominant representative γ of μ−λ satisfies γ∈P+ and (γ,θ)≤k+1. Thus γ is in the dominant part of the closed shifted bottom alcove. A finite facet point λ need not be dominant before affine transport.

The assertion transports to every affine alcove. If the transported facet lies inside the strict shifted dominant chamber, the transported integral facet point is dominant. This is a geometric displacement assertion; it does not assert a tensor-summand or translation-functor conclusion.

For the finite coordinate verifications use the E8 roots ±ei±ej and the half sums with an even number of minus signs, and simple vectors α1=(e1−e2−e3−e4−e5−e6−e7+e8)/2, α2=e1+e2, α3=e2−e1, αj=ej−1−ej−2 for 4≤j≤8. The first six or seven give the E6,E7 subsystems.

Facts & Assumptions

Given: The irreducible root system, positive base, full weight lattice and odd ℓ>h.

[F1]

The simply-laced possibilities are An,Dn,E6,E7,E8, finite Weyl groups act on chambers, and roots have one-sign integral simple coordinates (Classification of irreducible root systems, Combinatorics of a reduced root datum).

[F2]

A minuscule weight has pairings in {−1,0,1} with every root, as does each member of its Weyl orbit (Minuscule weights).

[F3]

Affine Weyl isometries transport facets and alcoves, and their linear parts belong to the finite Weyl group (Alcove transitivity, the affine Coxeter presentation, and the length function).

Proof

Given: These data. Write mi=(μ,αi)≥0; then ∑aimi≤k.

1.1F1F2algebra

In types An,Dn,E6,E7 there is a nonzero minuscule fundamental weight ω with (ω,θ)=1. Here is the finite root-data check: the highest-root marks are respectively (1,…,1), (1,2,…,2,1,1), (1,2,2,3,2,1) and (2,2,3,4,3,2,1) in the standard diagram numbering. The A,D vectors follow directly from e1−en+1 and e1+e2 in their coordinate models. For E6,E7 use the first six or seven simple vectors of the E8 realization specified in the Statement: summing with the stated marks gives respectively (1,1,1,1,1,−1,−1,1)/2 and −e7+e8, actual roots in that realization, and pairing with the respective simple vectors is nonnegative. They are therefore the highest roots, since a simply-laced irreducible root system has a single dominant root in its root orbit. Every positive root is at most this highest root in the simple-root order, so a fundamental weight at a mark-one node has all positive-root pairings at most one, proving the minuscule assertion and (ω,θ)=1.

2.1F1F2step 1.1constructalgebra

For a finite facet i form the full-rank finite root subsystem with base {−θ}∪{αj:j≠i}. Independence follows from ai>0 in the highest-root relation; pairwise off-diagonal inner products are nonpositive, and these roots generate a finite reflection subgroup of W. Choose a vector z pairing positively with all these independent roots, and minimize (wω,z) over their finite generated reflection subgroup. Call a minimizer ηi. If it paired positively with one of those roots, reflecting in that root would strictly lower its pairing with z, a contradiction. Thus (ηi,αj)≤0 for j≠i and (ηi,θ)≥0. The remaining pairing (ηi,αi) is positive: if it were nonpositive, all simple pairings and their positive-mark sum would force every pairing zero, hence ηi=0, impossible. By [F2] it is exactly one. Set r=mi+1 and λ=μ−rηi. Its i-th Dynkin coordinate is −1, all other finite coordinates are nonnegative, and its highest-root pairing has not increased. Therefore λ+ρ lies on exactly the i-th finite facet, and λ is in its relative interior. The dominant displacement is rω, whose highest-root pairing is r≤k+1.

2.2F1F2step 1.1algebra

For the upper facet in the same types put r=k+1−(μ,θ)>0 and λ=μ+rω. Every finite Dynkin coordinate stays nonnegative and the highest-root pairing becomes k+1, so λ is in exactly that facet's relative interior. The dominant displacement is the dominant representative of −rω, whose highest-root pairing is again r (the Weyl involution −w0 preserves the highest root). Since r≤k+1, it lies in the required closed alcove.

3.1F1step 2.1constructalgebra

It remains to handle E8, where h=30, k is positive odd, and the marks are (2,3,4,6,5,4,3,2). Use its root model consisting of ±ei±ej and half sums with an even number of minus signs. Fix α1=(e1−e2−e3−e4−e5−e6−e7+e8)/2, α2=e1+e2, α3=e2−e1, and αj=ej−1−ej−2 for 4≤j≤8. Their Cartan pairings give the E8 diagram and the marked sum is θ=e7+e8, whose Dynkin coordinates are (0,0,0,0,0,0,0,1). For finite facets i=1,…,8 take respectively the roots η1=−e7+e8,η2=(e1+e2+e3+e4+e5−e6−e7+e8)/2,η3=(−e1+e2+e3+e4−e5−e6−e7+e8)/2,η4=−e1−e2,η5=e4+e8,η6=e5+e8,η7=e6+e8,η8=e7+e8. Their Dynkin coordinate vectors, obtained by the displayed dot products, are respectively (1,0,0,0,0,0,0,−1), (0,1,0,0,0,0,−1,0), (0,0,1,0,0,−1,0,0), (0,−2,0,1,0,0,0,0), (0,0,0,0,1,−1,0,0), (0,0,0,0,0,1,−1,0), (0,0,0,0,0,0,1,−1) and (0,0,0,0,0,0,0,1). Thus each has pairing one at node i, nonpositive pairings elsewhere, and nonnegative highest-root pairing (respectively 0,0,0,0,1,1,1,2). Set r=mi+1 and λ=μ−rηi. The same coordinate inequalities as step 2.1 place λ in the required finite facet's relative interior. Every root is Weyl conjugate to θ, so the dominant displacement is rθ. Because ai≥2 and k is odd, mi≤(k−1)/2, hence (rθ,θ)=2r≤k+1.

4.1F1step 3.1constructalgebra

For the E8 upper facet let r=k+1−(μ,θ). If r is even, take λ=μ+(r/2)θ. It is dominant, is in that facet's relative interior, and its dominant displacement has highest-root pairing r≤k+1. If r is odd, (μ,θ) is odd since k+1 is even, so mj>0 for some odd-mark node j∈{2,5,7}. Choose respectively β2=−e1+e8, β5=e3+e8, β7=e5+e8. Their Dynkin coordinate vectors are (0,−1,1,0,0,0,0,0), (0,0,0,1,−1,0,0,0) and (0,0,0,0,0,1,−1,0), and each has highest-root pairing one. With u=(r−1)/2 put λ=μ+uθ+βj. Its only potentially negative coordinate is repaired by mj≥1, and its highest-root pairing increases by 2u+1=r, placing it exactly in the upper facet's relative interior. For every root α, ∣(uθ+βj,α)∣≤2u+2=r+1, since all root pairings have absolute value at most two. The highest-root pairing of the dominant displacement is the maximum of its pairings with roots, hence at most r+1. Oddness of r gives r≤k, so this is at most k+1. This proves the upper-facet assertion too.

5.1F3step 2.1step 2.2step 3.1step 4.1algebra∎

For an arbitrary affine alcove write μ=w⋅μ0 with μ0 in the bottom alcove and transport the constructed facet point by the same dot action. The difference of the two transported points is the finite linear Weyl part of w applied to their original difference, so its ordinary dominant representative is unchanged. If the transported facet is inside the strict shifted dominant chamber, each shifted simple pairing at its relative-interior integral point is a positive integer, and subtracting ρ leaves nonnegative Dynkin coordinates. Thus the transported point is dominant exactly as required. No tensor decomposition conclusion has been used or asserted.

Depends on

Used by

Dependency tree · two levels

51 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