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 rational skew group algebra for type A

Definition

Keep R0, A, and the action of Sn from The type-A weight lattice, Laurent ring, and divided differences. Let K:=Frac⁡(A), the fraction field supplied by Multivariate polynomial and Laurent rings over commutative rings, domains and fraction fields. Each w∈Sn acts on K by the unique extension

w(f/g):=w(f)/w(g)(f,g∈A, g≠0).

The rational skew group algebra K⋊Sn is the K-vector space of finite sums ∑w∈Snaw[w], with multiplication determined by

(a[w])(b[v])=a w(b)[wv](a,b∈K, w,v∈Sn).

Its unit is 1[1] and its K-basis is ([w])w∈Sn. It acts on K by

(a[w])⋅f:=a w(f)(a,f∈K, w∈Sn).

Facts & Assumptions

Given: The domain A, its fraction field K, and the permutation action of Sn on A from the preceding definition.

[F1]

The type-A weight lattice, Laurent ring, and divided differences: A is a commutative integral domain and each w∈Sn permutes its Laurent variables.

[F2]

Multivariate polynomial and Laurent rings over commutative rings, domains and fraction fields: the fraction field of an integral domain is a field containing that domain injectively.

Proof

Given: The data of the Definition.

1.1F1F2algebra

For f/g∈K with g≠0, the denominator w(g) is nonzero because the automorphism w of A is injective. If f/g=f′/g′, then fg′=f′g, so applying w gives w(f)w(g′)=w(f′)w(g); hence w(f)/w(g)=w(f′)/w(g′). Thus the displayed formula is well-defined on K and defines a field automorphism, with inverse the action of w−1.

2.1step 1.1algebra

The finite-support sums form a K-module with basis symbols [w]. Multiplication is closed because wv∈Sn and a w(b)∈K. For a,b,c∈K and w,v,u∈Sn, ((a[w])(b[v]))(c[u])=a w(b) (wv)(c)[wvu], while (a[w])((b[v])(c[u]))=a w(b v(c))[wvu]=a w(b) (wv)(c)[wvu]. These agree because w acts as a field automorphism and the action is a group action; distributivity gives associativity for finite sums.

3.1step 2.1algebra

The symbol 1[1] is a two-sided identity since the identity permutation fixes every coefficient and 1w(b)=b. By construction the symbols [w] are a K-basis, and multiplication also gives [w]b=w(b)[w]. Since every permutation fixes R0, the displayed operations define a unital associative R0-algebra.

4.1F1step 2.1algebra∎

The stated action is an algebra representation: (a[w])⋅((b[v])⋅f)=a w(b v(f))=a w(b)(wv)(f)=((a[w])(b[v]))⋅f, using the multiplication from step 2.1. Additivity extends this identity to finite sums, so multiplication in K⋊Sn agrees with composition of its operators on K.

Depends on

Used by

Dependency tree · two levels

23 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