Alphabeta Math
LemmaStatement: 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.

Units, powers and the domain property of the Laurent polynomial ring

Statement

Let Λ1=Z[t±1] be the Laurent polynomial ring of The Laurent polynomial ring as the principal localisation of Z[t] at t. Then:

(a) Λ1 is an integral domain;

(b) tm≠1 for every m≠0, and more generally tm≠tn for m≠n;

(c) u∈Λ1 is a unit if and only if u=±tm for some m∈Z;

(d) for n≥2 the element 1+t+⋯+tn−1 is not a unit of Λ1.

No choice principle is used.

Facts & Assumptions

Given: The Laurent polynomial ring Λ1=S−1Z[t] with S={tk:k≥0}, a nonzero integer polynomial p∈Z[t], and integers m,m′∈Z.

[F1]

Every element of Λ1 is a fraction p/tN with p∈Z[t] and N≥0, and t is a unit with inverse t−1 (The Laurent polynomial ring as the principal localisation of Z[t] at t, A fraction r/s is a unit in S−1R exactly when ar∈S for some a∈R).

[F2]

A fraction r/s is zero if and only if tkr=0 for some k≥0 (Equality, vanishing, and the kernel of the localisation map).

[F3]

Z[t] is an integral domain (A polynomial ring over an integral domain is an integral domain): it has no zero divisors, so tkf=0 forces f=0 for every k≥0, since tk≠0; and for nonzero f,g one has deg⁡(fg)=deg⁡f+deg⁡g and the constant term of fg is the product of the constant terms (Over an integral domain, degrees add under multiplication of nonzero polynomials, Degree, leading coefficient and monic polynomial, with the zero polynomial having no degree).

Proof

technique · direct
1.1F1F2F3

Normal form. Write a nonzero element of Λ1 as p/tN with p∈Z[t], N≥0 by [F1], and factor out the largest power of t dividing p: there are d≥0 and q∈Z[t] with p=tdq and t∤q, the latter meaning q(0)≠0. Then p/tN=td−Nq, so every nonzero element has a representative tmq with m∈Z and q(0)≠0. This representative is unique: if tmq=tm′q′ with q(0),q′(0)≠0, multiply by t−m to get q=tm′−mq′; if m′≥m, the constant term of the right-hand side equals q′(0)≠0 when m′=m and vanishes when m′>m, while the constant term of q is q(0)≠0, so m′=m and q=q′; the case m′<m is symmetric.

2.1F2F3step 1.1

Λ1 is an integral domain. Suppose uv=0 with u=tmp, v=tnq nonzero in normal form, so p(0),q(0)≠0 and pq≠0 by [F3]. Then uv=tm+npq. If m+n≥0, the element tm+npq is a polynomial, and [F2] yields k≥0 with tktm+npq=tk+m+npq=0 in Z[t]; since tk+m+n≠0 and Z[t] is a domain by [F3], pq=0, a contradiction. If m+n<0, the element is pq/t−(m+n), and [F2] yields k≥0 with tkpq=0 in Z[t], again forcing pq=0 by [F3], a contradiction. Hence uv≠0, so Λ1 is a domain.

2.2step 1.1

Distinct powers of t. The elements tm=tm⋅1 and 1=t0⋅1 are in normal form, since the constant polynomial 1 has 1≠0. By uniqueness in step 1.1, tm=1 forces m=0 and q=1. More generally tm=tm′ forces tm−m′=1, hence m=m′.

2.3F4step 1.1

Units. If u=±tm, then u⋅(±t−m)=1, so u is a unit. Conversely let u=tmp in normal form be a unit, with inverse v=tnq in normal form; then tm+npq=1. Applying the normal form uniqueness of step 1.1 to tm+npq and to 1=t0⋅1 gives m+n=0 and pq=1 in Z[t]. By [F4] the unit p of Z[t] is one of the two constants ±1; hence u=±tm.

3.1step 1.1step 2.1step 2.2step 2.3∎

The sum 1+t+⋯+tn−1. For n≥2 put f=1+t+⋯+tn−1, a polynomial with constant term 1 and at least two nonzero coefficients. In normal form f=t0f. If f were a unit, step 2.3 would give f=±tm for some m; two elements equal in Λ1 have the same normal-form exponent and polynomial by step 1.1, so m=0 and f=±1, contradicting that f has at least two nonzero coefficients. Hence f is not a unit, which is (d); claims (a), (b), (c) are steps 2.1, 2.2 and 2.3. No choice principle is used.

Depends on

Used by

Dependency tree · two levels

37 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