Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6-luna)
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 type-A weight lattice, Laurent ring, and divided differences

Definition

Let n≥2, let R0:=Z[Q,Q−1], and put

Λ:=Zn,A:=R0[X1±1,…,Xn±1].

Write Xλ:=X1λ1⋯Xnλn for λ∈Λ. The symmetric group Sn acts on Λ and A by permuting coordinates and variables; its adjacent transposition si=(i i+1), for 1≤i<n, interchanges Xi and Xi+1. This is the type-An−1 Coxeter identification of Support, intrinsic parabolic presentations, minimal coset representatives and length additivity, with the type-A identification.

For 1≤i<n and f∈A, define

Di(f):=f−si(f)1−Xi/Xi+1.

The quotient is taken in the fraction field of A; the verification below proves it is the unique element of A with this quotient. The operators obey the twisted Leibniz rule

Di(fg)=Di(f)g+si(f)Di(g).

Facts & Assumptions

Given: An integer n≥2, the Laurent polynomial ring A over R0=Z[Q,Q−1], and the type-An−1 identification of its adjacent generators with Sn.

[F1]

Multivariate polynomial and Laurent rings over commutative rings, domains and fraction fields: the Laurent ring over a commutative coefficient ring is free on its Laurent monomials; when the coefficient ring is a domain, the Laurent ring is a domain and has a fraction field in which it embeds.

[F2]

Support, intrinsic parabolic presentations, minimal coset representatives and length additivity, with the type-A identification: for the type-An−1 Coxeter matrix, si↦(i i+1) identifies its group with Sn.

[F3]

The integers have no zero divisors; multiplicative cancellation: the product of two nonzero integers is nonzero.

[F4]

The naturals embed in the integers: the natural numbers embed injectively in Z, so 0≠1 in Z.

[F5]

Zero divisor, and integral domain: a commutative ring with 1≠0 and no zero divisors: a commutative ring with 1≠0 and no zero divisors is an integral domain.

Proof

Given: The data of the Definition.

1.1givenF1F2F3F4F5

By [F3] and [F4], the integers have no zero divisors and 0≠1; thus Z is a domain by [F5]. Applying [F1] to the Laurent variable Q gives that R0=Z[Q,Q−1] is a domain, and applying it again gives that A is a domain with R0-basis (Xλ)λ∈Zn and embeds in its fraction field. By [F2], the adjacent transpositions generate the stated Sn action, which permutes the Laurent monomial basis.

1.2givenF1algebra

Fix i and a Laurent monomial Xλ. Put a=λi, b=λi+1, and z=Xi/Xi+1. Then Xλ−si(Xλ)=Xλ′(za−zb), where λ′ agrees with λ off coordinates i,i+1 and has exponents 0,a+b at coordinates i,i+1, respectively. For integers a,b, the quotient (za−zb)/(1−z) is a Laurent polynomial: it is −∑k=0a−b−1zb+k if a>b, zero if a=b, and ∑k=0b−a−1za+k if a<b. Each formula follows by multiplying the finite geometric sum by 1−z. Thus Xλ−si(Xλ) is divisible in A by 1−z, including when either exponent is negative.

2.1F1step 1.2algebra

Every f∈A is a unique finite R0-linear combination of the monomials by [F1]. Linearity of f↦f−si(f) and the monomial calculation in step 1.2 give a quotient in A for every f. Since 1−z≠0 in the domain A, that quotient is unique. This defines Di:A→A as stated.

3.1step 2.1algebra

For f,g∈A, the identity fg−si(fg)=(f−si(f))g+si(f)(g−si(g)) holds because si is an algebra automorphism. Dividing by the nonzero element 1−z in the fraction field and using the definition of Di gives Di(fg)=Di(f)g+si(f)Di(g).

4.1F1step 1.2step 2.1step 3.1∎

The construction of Di and its Leibniz identity use only the monomial basis, finite geometric sums, and cancellation in the integral domain A; no choice principle is used.

Depends on

Used by

Dependency tree · two levels

48 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