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

Two reduced expressions of one element whose subword descriptions agree

Example

In W=S4 with one-line notation and ℓ the inversion number (Support, intrinsic parabolic presentations, minimal coset representatives and length additivity, with the type-A identification (4)), the element v=2431 has the two reduced expressions v=s1s2s3s2=s1s3s2s3, both of length 4=ℓ(2431).

(i) The element u=s2=1324 satisfies u≤v, and the subword criterion certifies this in each expression, but at different positions: position 2 of s1s2s3s2 and position 3 of s1s3s2s3 (in the second word s2 occurs only at position 3). Thus the two descriptions of u inside the two expressions of v differ in position but must agree in value.

(ii) The 24=16 subwords of either word realize the same set of 12 elements, namely the interval [1,v]={1234,1243,1324,1342,1423,1432,2134,2143,2314,2341,2413,2431}. The two expressions of v therefore produce identical subword descriptions of the interval below v; if they could disagree, some element would be comparable with v according to one reduced expression of v and incomparable according to the other (The subword characterization of Bruhat order and its independence of the reduced expression (2)).

Facts & Assumptions

Given: W=S4 with generators s1,s2,s3, the element v=2431 with its two reduced expressions, the element u=s2, and the subword enumerations of the statement.

[F1]

For type An−1 with S={s1,…,sn−1}, the assignment si↦(i i+1) extends to an isomorphism W→Sn and ℓ(w)=inv⁡(φ(w)); in particular a word in the si is reduced if and only if its length equals the inversion number of its value. (Support, intrinsic parabolic presentations, minimal coset representatives and length additivity, with the type-A identification (4))

[F2]

One-line notation lists the values of a permutation in order of the arguments, and the composition convention is (στ)(i)=σ(τ(i)); hence right multiplication by si=(i i+1) swaps the entries in positions i and i+1 of the one-line form. (The finite symmetric group Sn, one-line notation, and cycle notation)

[F3]

The inversion number of σ is inv⁡(σ)=∣{(i,j):i<j, σ(i)>σ(j)}∣. (Inversions, inversion number, the sign sgn⁡(σ)=(−1)inv⁡(σ), and even and odd permutations)

[F4]

Subword criterion: for a reduced expression v=r1⋯rq and x∈W, one has x≤v if and only if there are 1≤i1<⋯<ik≤q with x=ri1⋯rik, and the indices may be chosen with k=ℓ(x). (The subword characterization of Bruhat order and its independence of the reduced expression (1))

[F5]

Expression independence: for all x,v∈W the following are equivalent: (a) x≤v; (b) every reduced expression of v has a subword that is a reduced expression of x; (c) some reduced expression of v has a subword that is a reduced expression of x. (The subword characterization of Bruhat order and its independence of the reduced expression (2))

[F6]

The interval of the statement is the Bruhat interval [1,v]={x∈W:1≤x≤v}, and 1≤x holds for every x∈W. (Finiteness of Bruhat intervals, the chain refinement property, and grading by length (1), The Bruhat graph by length-increasing reflection chains, the Bruhat order, inversion symmetry, and reflection parity (2))

Verification

1.1F1F2F3F4

For (i): v=2431=s1s2s3s2=s1s3s2s3, because the two words differ only in their last three letters, which are the two words s2s3s2 and s3s2s3 of the same element of the rank-two parabolic ⟨s2,s3⟩ (the braid relation), and v has inversion number 4 by [F3], so both words have length 4=ℓ(v) and are reduced expressions of v by [F1]; the product s1s2s3s2=2431 is computed by applying [F2] letter by letter. The element u=s2 has one-line form 1324 and ℓ(u)=1; it occurs in s1s2s3s2 at positions 2 and 4 and in s1s3s2s3 at position 3 only, so the subword criterion [F4] gives u≤v from either occurrence, at different positions in the two expressions of v.

1.2F2F4F5F6

For (ii): fix either reduced expression of v. Every subword value x is the product of a subword of that reduced word, hence x≤v by the right-to-left direction of [F4], and 1≤x by [F6], so the set of subword values of either expression is contained in the interval [1,v]; conversely, by [F5] every x∈[1,v] has a reduced subword expression inside every reduced expression of v, hence is a value of a subword of either of the two words. Therefore the sets of subword values of the two expressions are both equal to [1,v], so they coincide. Enumerating the 16 subwords of s1s2s3s2 by multiplying out the indicated letters with [F2] gives exactly the 12 displayed permutations 1234, 1243, 1324, 1342, 1423, 1432, 2134, 2143, 2314, 2341, 2413, 2431 (the empty subword gives 1234), and enumerating the 16 subwords of s1s3s2s3 gives the same 12 values; hence [1,v] is exactly the displayed set.

2.1F5step 1.1step 1.2∎

Collecting: the two reduced expressions of v describe the same interval below v, both by the general equivalence of [F5] and by the explicit enumeration of step 1.2 of the 16 subwords of each expression; the element u=s2 is described at position 2 in the first expression and position 3 in the second, so the positions may differ while the value is the same, as (i) says. If the two descriptions could disagree, then some element would have a subword expression in one reduced expression of v and none in the other, contradicting [F5]; all computations are finite and use no choice principle.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

43 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