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.

Dominant projection and strict parabolic weight decrease

Statement

Use the cones and inner product of Weight temperedness and positive Langlands data. Every λ∈E has a unique orthogonal decomposition λ=ν+η with ν∈C, P={β∈B:β(ν)=0} and η∈KP. The vector ν=p(λ) is the nearest point of C to λ. Let r(λ)=∥p(λ)∥. If ν∈CP++ and η∈KP, then p(ν+η)=ν. For WP={w∈W:w(P)⊂RL+}, where RL=Φ∨, one has

r(w(ν+η))<∥ν∥(w∈WP∖{1}).

For any η′∈EP, one has r(ν+η′)≥∥ν∥, with equality exactly when η′∈KP.

Facts & Assumptions

Given: The finite reduced root system RL on the dual root-datum convention, the W-invariant inner product, and C,EP,EP,KP above.

[F1]

Simple roots form a basis of the root span, all positive roots have nonnegative simple-root coordinates, W acts simply transitively on chambers, and length equals positive-root inversion number (Combinatorics of a reduced root datum).

[F2]

The displayed cones and orthogonal spaces are those of Weight temperedness and positive Langlands data.

[F3]

A nonempty closed convex subset of a positive-dimensional Euclidean space has a unique nearest point to any point (Every point has a unique nearest point in a nonempty closed Euclidean convex set).

[F4]

Cauchy–Schwarz holds in real inner product spaces with equality exactly for linearly dependent vectors (Cauchy–Schwarz: ∣⟨u,v⟩∣≤∥u∥∥v∥, with equality exactly for linearly dependent vectors).

Proof

Given: These data; write ( , ) for the inner product.

1.1givenF2F3algebra

The cone C is nonempty because it contains zero, closed because it is a finite intersection of closed linear half-spaces, and convex because every defining inequality is linear. For dim⁡E>0, identify the inner product space isometrically with Rdim⁡E using a finite orthonormal basis and apply [F3] to obtain a unique nearest point ν∈C. If E=0, the unique nearest point is zero. The derivative of squared distance along every segment from ν to v∈C gives (λ−ν,v−ν)≤0. Taking v=0,2ν gives (λ−ν,ν)=0, and therefore (λ−ν,v)≤0 for all v∈C. Conversely these two conditions imply ∥λ−v∥2≥∥λ−ν∥2 for every v∈C.

2.1F1F2step 1.1algebra

The polar cone of C is KB: decompose E into the span of the simple coroots and its orthogonal central space, test both signs of every central vector, and test the fundamental vectors dual to the simple coroots to see that the coroot coefficients of a polar vector are nonpositive. Each (ν,β∨) is a positive multiple of β(ν), since sβ is orthogonal reflection with normal β∨. Thus a polar vector η=−∑cββ∨, cβ≥0, is orthogonal to ν∈C exactly when cβ=0 whenever β(ν)>0. step 1.1 proves precisely λ=ν+η, η∈KP for the zero set P of ν; it also proves the stated converse and uniqueness.

3.1F1step 2.1algebra

The stabilizer of ν∈C in W is WP for its zero set P. Indeed a positive root vanishes at ν exactly when its simple-root support lies in P. A sufficiently small ball about ν avoids every root hyperplane not containing ν; the hyperplanes through ν are exactly the subsystem hyperplanes for P. Its local chambers are permuted simply transitively by WP by [F1] applied to that subsystem. If wν=ν, then wC and C meet that ball in local chambers, so some v∈WP sends the local chamber of wC to that of C. These are also chambers of the full arrangement inside the ball, so vwC=C; full chamber simple transitivity gives vw=1. Conversely every generator of WP fixes ν. Finally WP∩WP={1}: an element of WP preserving positivity of P preserves its positive roots and hence its positive chamber, and is the identity by [F1].

4.1F1F4step 1.1step 3.1algebra

For any reduced expression w=s1⋯sk, the roots s1⋯sj−1(βj) are positive by the inversion-number description of length, and telescoping gives ν−wν=∑jβj(ν)s1⋯sj−1(βj∨), a nonnegative combination of positive coroots. Consequently if wν also belongs to C, then (wν,ν−wν)≥0 and Cauchy–Schwarz forces wν=ν. Now let w∈WP∖{1}, η∈KP, and u=p(w(ν+η)). Since w(P) consists of positive roots, wη is a nonpositive combination of positive coroots, so (u,wη)≤0. By step 1.1 and Cauchy–Schwarz, ∥u∥2=(u,wν+wη)≤(u,wν)≤∥u∥∥ν∥. Hence ∥u∥≤∥ν∥. If equality held with nonzero norm, equality in Cauchy–Schwarz would give u=wν∈C, hence wν=ν by the telescoping argument, contradicting step 3.1. If ν=0, its zero set is B, and WB={1} so there is no such w. The same stabilizer argument applies if ν is purely central. This proves strict decrease.

5.1F2step 1.1step 2.1algebra∎

For any x∈E, step 1.1 also gives ∥p(x)∥2=max⁡v∈C(2(x,v)−∥v∥2), whose unique maximizer is p(x). If x=ν+η′ with η′∈EP, then (ν,η′)=0 and evaluation at v=ν yields r(x)2≥∥ν∥2. Equality forces the unique maximizer to be ν, so step 2.1 forces η′∈KP. Conversely η′∈KP gives p(x)=ν by step 2.1. This proves the last assertion.

Depends on

Used by

Dependency tree · two levels

24 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