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.

The four lifting squares in S4

Example

In W=S4 with simple reflections si=(i i+1), one-line notation and ℓ the inversion number (Support, intrinsic parabolic presentations, minimal coset representatives and length additivity, with the type-A identification (4)), the four cases of the lifting property (The lifting property in all four descent cases, the cover criterion, reflection deletion, and directedness (1)) occur as follows (products are right multiplication, wsi swapping the entries in positions i and i+1).

(a) u=1342 (ℓ=2), v=4132 (ℓ=4), s=s1: us=3142 (ℓ=3) and vs=1432 (ℓ=3); here s is a descent of v and an ascent of u, and indeed us=3142≤v=4132 and u=1342≤vs=1432, while us≤vs fails: the two lifted elements are incomparable.

(b) u=1342, v=4132, s=s2: us=1432 (ℓ=3) and vs=4312 (ℓ=5); here s is an ascent of both, and us=1432≤vs=4312.

(c) u=1342 (ℓ=2), v=1432 (ℓ=3), s=s3: us=1324 (ℓ=1) and vs=1423 (ℓ=2); here s is a descent of both, and us=1324≤vs=1423, while u≤vs fails.

(d) u=1423 (ℓ=2), v=4123 (ℓ=3), s=s2: us=1243 (ℓ=1) and vs=4213 (ℓ=4); here s is a descent of u and an ascent of v, and us=1243≤v=4123, u=1423≤vs=4213.

In each case u,v,us,vs are the four vertices of a Bruhat square whose sides are u≤v together with us≤vs or us≤v or u≤vs according to the case; cases (a) and (c) show that the extra comparisons us≤vs and u≤vs, respectively, cannot be asserted in all four cases: in (a) the comparison us≤vs is false and in (c) the comparison u≤vs is false.

Facts & Assumptions

Given: W=S4 with generators s1,s2,s3, the elements u,v of the four cases, and the products us, vs displayed in 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]

Lifting property in all four cases: if u≤v and s∈S, then (a) ℓ(vs)<ℓ(v), ℓ(us)>ℓ(u) give us≤v and u≤vs; (b) ℓ(vs)>ℓ(v), ℓ(us)>ℓ(u) give us≤vs and u≤vs; (c) ℓ(vs)<ℓ(v), ℓ(us)<ℓ(u) give us≤vs and us≤v; (d) ℓ(vs)>ℓ(v), ℓ(us)<ℓ(u) give us≤v and u≤vs. (The lifting property in all four descent cases, the cover criterion, reflection deletion, and directedness (1))

[F5]

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

[F6]

Distinct elements of equal length are incomparable: if x≤y and ℓ(x)=ℓ(y), then x=y. (The Bruhat graph by length-increasing reflection chains, the Bruhat order, inversion symmetry, and reflection parity (2))

Verification

1.1F1F2F3

The displayed products are computed by [F2]: 1342⋅s1=3142, 1342⋅s2=1432, 1342⋅s3=1324, 1423⋅s2=1243, 4132⋅s1=1432, 4132⋅s2=4312, 1432⋅s3=1423 and 4123⋅s2=4213. Their inversion numbers, computed with [F3] and equal to the lengths by [F1], are: ℓ(1342)=2, ℓ(1423)=2, ℓ(4132)=4, ℓ(1432)=3, ℓ(4123)=3, ℓ(3142)=3, ℓ(1324)=1, ℓ(1243)=1, ℓ(4312)=5 and ℓ(4213)=4.

1.2F1F2F5

First certify u≤v in each case: in (a) and (b), 1342=s2s3 occurs at positions 1,2 of 4132=s2s3s2s1; in (c), it occurs at positions 1,2 of 1432=s2s3s2; and in (d), 1423=s3s2 occurs at positions 1,2 of 4123=s3s2s1. Each ambient word has length equal to the inversion number of its value, so [F1] and [F5] prove these initial comparisons. The comparisons required by the four cases — us≤v and u≤vs in (a), us≤vs and u≤vs in (b), us≤vs and us≤v in (c), and us≤v and u≤vs in (d) — are certified by subword witnesses in the displayed reduced words, each verified by multiplying out the indicated letters: 3142=s2s3s1 is the subword at positions 1,2,4 of 4132=s2s3s2s1; 1342=s2s3 is the subword at positions 1,2 of 1432=s2s3s2 and at positions 1,3 of 4312=s2s1s3s2s1; 1432=s2s3s2 is the subword at positions 1,3,4 of 4312=s2s1s3s2s1; 1324=s2 is the subword at position 1 of 1432=s2s3s2 and at position 2 of 1423=s3s2; 1243=s3 is the subword at position 1 of 4123=s3s2s1; and 1423=s3s2 is the subword at positions 2,3 of 4213=s1s3s2s1. Each listed ambient word is reduced, since its value has inversion number equal to its length by [F1]; hence the subword criterion [F5] applies and gives the stated comparisons.

2.1F1F3F6step 1.1

The two negative comparisons follow from length alone: in case (a) the elements us=3142 and vs=1432 both have length 3 and are distinct, so they are incomparable by [F6], and in particular us≤vs fails; in case (c) the elements u=1342 and vs=1423 both have length 2 and are distinct, so they are incomparable by [F6], and in particular u≤vs fails. The equalities of the displayed lengths with the inversion numbers were computed in step 1.1.

2.2F1step 1.1

The descent and ascent patterns are read off the lengths computed in step 1.1: in (a) ℓ(vs)=3<4=ℓ(v) and ℓ(us)=3>2=ℓ(u); in (b) ℓ(vs)=5>4 and ℓ(us)=3>2; in (c) ℓ(vs)=2<3 and ℓ(us)=1<2; and in (d) ℓ(vs)=4>3 and ℓ(us)=1<2.

3.1F4step 1.2step 2.1step 2.2∎

Each of the four cases of [F4] is therefore instantiated: case (a) by the pair u=1342≤v=4132 with s=s1, where step 1.2 gives us≤v and u≤vs and step 2.1 shows the companion comparison us≤vs fails; case (b) by the same pair with s=s2, where s is an ascent of both and step 1.2 gives us≤vs and u≤vs; case (c) by u=1342≤v=1432 with s=s3, where s is a descent of both, step 1.2 gives us≤vs, us≤v and step 2.1 shows u≤vs fails; and case (d) by u=1423≤v=4123 with s=s2, where step 1.2 gives us≤v and u≤vs. In each case the four elements u,v,us,vs form the lifting square of the theorem with the sides listed in the statement, and cases (a) and (c) show that the two extra comparisons cannot be asserted uniformly. All computations are finite enumerations in S4 and use no choice principle.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

44 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