Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6.1-sol)
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 local ring A0 of rational functions regular at q=0

Definition

Let q be transcendental over Q (Symmetrizable Cartan data for quantum groups) and let A0:=Q[q](q)={fg : f,g∈Q[q], g(0)≠0}⊆Q(q) be the localisation of the polynomial ring Q[q] at the prime ideal (q) (Localisation at a prime ideal: Rp=(R∖p)−1R). By F[x](x) is the ring of rational functions defined at 0, with maximal ideal generated by x and residue field F with F=Q, the ring A0 is exactly the ring of rational functions regular at q=0, it is a local ring (A local ring is a nonzero commutative ring with a unique maximal ideal) with unique maximal ideal qA0, and evaluation at 0 induces an isomorphism A0/qA0≅Q. Since Q[q] is a principal ideal domain (For every field F, F[x] is a principal ideal domain) with nonzero prime ideal (q), the ring A0 is a local principal ideal domain with nonzero maximal ideal; by the discrete valuation ring characterisations it is a discrete valuation ring with uniformiser q/1 (Equivalent characterizations of a DVR, Discrete valuation rings), and in particular a principal ideal domain (Every DVR is a PID, Principal ideal domain), with field of fractions Q(q) (For a field F, F(t)=Frac⁡(F[t]) is its rational function field; in particular R(t)=Frac⁡(R[t])).

By Discrete valuation rings a discrete valuation ring is the valuation ring Vv={x:v(x)≥0} of a discrete valuation v on its fraction field. The discrete valuation of Q(q) with Vv=A0 and v(q)=1 is the q-adic valuation; write it ord⁡q, so that ord⁡q:Q(q)⟶Z∪{∞},A0={h∈Q(q):ord⁡q(h)≥0},ord⁡q(q)=1. Equivalently, ord⁡q is the vanishing order at q=0. The units of A0 are exactly the fractions f/g with f(0)≠0 and g(0)≠0, and qA0 is the maximal ideal, so q is a uniformiser of A0 (Rp is local with unique maximal ideal pRp).

This ring A0 is the crystal limiting ring of the crystal development below, and it is different from the Laurent ring A=Z[q,q−1] of The Laurent polynomial ring as the principal localisation of Z[t] at t: q−1∈A∖A0, while (1+q)−1∈A0∖A; neither ring contains the other, and both are subrings of Q(q). For every free A0-module L the canonical map Q⊗A0L⟶L/qL,c⊗ℓ↦c ℓ+qL, is an isomorphism, and for every λ∈Q(q)× one has λL/qλL≅L/qL; passing from L to L/qL is the crystal limit. No freeness of any further module, no lattice and no choice principle is asserted here.

Facts & Assumptions

Given: The transcendental element q over Q and the ring A0=Q[q](q).

[F1]

The polynomial ring Q[q] is a principal ideal domain, and evaluation at 0, ev0:Q[q]→Q, f↦f(0), has kernel (q) and induces Q[q]/(q)≅Q; hence (q) is a maximal, nonzero ideal and A0 is realised as the fractions f/g with g(0)≠0 (For every field F, F[x] is a principal ideal domain, F[x](x) is the ring of rational functions defined at 0, with maximal ideal generated by x and residue field F).

[F2]

Localising at a prime p yields a local ring whose maximal ideal is pRp, whose units are the fractions r/s with r∉p (Rp is local with unique maximal ideal pRp, Localisation at a prime ideal: Rp=(R∖p)−1R).

[L1]

A nonfield domain R is a discrete valuation ring exactly when it is a local principal ideal domain with nonzero maximal ideal (Equivalent characterizations of a DVR).

[L2]

Every discrete valuation ring is a principal ideal domain, and every discrete valuation ring is the valuation ring Vv of a discrete valuation v (Every DVR is a PID, Discrete valuation rings).

[L3]

For a field F, the rational function field F(t) equals Frac⁡(F[t]) (For a field F, F(t)=Frac⁡(F[t]) is its rational function field; in particular R(t)=Frac⁡(R[t])).

[L4]

The Laurent ring A=Z[q,q−1] is the principal localisation Z[q]S with S={qk:k≥0}: every element has a unique finite expansion ∑k∈Zakqk, and for every unital ring R and unit u∈R there is a unique unital homomorphism A→R with q↦u (The Laurent polynomial ring as the principal localisation of Z[t] at t).

Verification

technique · direct
1.1givenF1algebra

Evaluation at 0 has kernel (q) and induces Q[q]/(q)≅Q, so (q) is a maximal ideal of Q[q] and q≠0 (A local ring is a nonzero commutative ring with a unique maximal ideal); in particular (q) is a nonzero prime ideal of the PID Q[q].

1.2givenL3algebra

The field of fractions of A0 is Q(q): every polynomial f∈Q[q] lies in A0 as f/1, so Frac⁡(A0) contains Frac⁡(Q[q])=Q(q) by [L3]; conversely A0⊆Q(q) and Q(q) is a field, so Frac⁡(A0)⊆Q(q).

2.1step 1.1F2algebra

By [F2] applied to p=(q), the localisation A0 is a local ring with maximal ideal (q)A0=qA0, residue field Q under evaluation f/g↦f(0)/g(0): this map is surjective on constants and its kernel consists precisely of fractions with f(0)=0, namely qA0, and units exactly the fractions f/g with f∉(q), that is, f(0)≠0 and g(0)≠0.

3.1step 1.1step 2.1L1L2

By step 1.1, (q) is a nonzero prime ideal of the principal ideal domain Q[q], and by step 2.1 the ring A0 is a local domain with maximal ideal qA0≠0. Every ideal J of A0 is generated by its contraction: if f/g∈J with g(0)≠0 then f=g⋅(f/g)∈J∩Q[q] and f/g=f⋅(1/g)∈(J∩Q[q])A0, while J∩Q[q]⊆J gives the reverse inclusion, so J=(J∩Q[q])A0. The contraction J∩Q[q] is an ideal of the principal ideal domain Q[q], hence principal, so J is principal and A0 is a local principal ideal domain with nonzero maximal ideal. By [L1] it is a discrete valuation ring; its maximal ideal is generated by q/1, so q/1 is a uniformiser, and by [L2] there is a discrete valuation v of Q(q) with A0={h:v(h)≥0}.

4.1step 2.1step 3.1algebra

Normalisation. Every nonzero x=f/g∈Q(q) can be written uniquely as qnu with n∈Z and u∈A0×: factor the maximal powers of q from the nonzero polynomials f,g and subtract their exponents. For the discrete valuation v of step 3.1, units have value zero because both u and u−1 lie in A0, so v(x)=nv(q). Surjectivity of v onto Z therefore forces v(q)=1. Set ord⁡q=v; this is the vanishing order just computed, with value group Z and valuation ring A0.

5.1step 3.1step 4.1algebra

Uniqueness and units: if w is any discrete valuation with Vw=A0 and w(q)=1, then w=ord⁡q. Indeed, for x∈Q(q)× one has w(x)=0 exactly when x∈A0 and x−1∈A0, that is, exactly when x∈A0×; for nonzero x the element x/qord⁡q(x) lies in A0×, so w(x)=w(qord⁡q(x))+0=ord⁡q(x), using w(q)=1, additivity and w(1)=0. Thus ord⁡q is the unique such valuation and A0={h:ord⁡q(h)≥0}, with units {h≠0:ord⁡q(h)=0}.

6.1step 2.1step 5.1L4algebra

Units and comparisons with A: step 2.1 gives the units. For the comparisons, q−1∈A by [L4] with u=q−1 in R=Q(q) but q−1∉A0, because q−1=f/g with g(0)≠0 would give g=qf and hence g(0)=0, a contradiction; and (1+q)−1∈A0 because 1+q has value 1≠0 at 0, while (1+q)−1∉A, because the unique homomorphism A→Z with q↦1 of [L4] would send (1+q)−1(1+q)=1 to ev1((1+q)−1)⋅2=1, forcing the integer ev1((1+q)−1)=1/2, which is impossible.

7.1step 2.1givenalgebra∎

The crystal limit: let L=⨁j∈JA0ej be a free A0-module with the displayed basis. The residue classes ej+qL form a Q-basis of L/qL because A0/qA0≅Q by step 2.1, and the elements 1⊗ej form a Q-basis of Q⊗A0L; the displayed map sends the second basis to the first, so it is an isomorphism. For λ∈Q(q)×, multiplication by λ is a bijection L→λL carrying qL onto qλL=λqL, hence induces an A0-module isomorphism L/qL→λL/qλL. No choice principle is used: the basis of L is given, and all further objects are residue projections of explicitly presented fractional ideals of Q[q].

Depends on

Used by

Dependency tree · two levels

56 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