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 be the Laurent polynomial ring of The Laurent polynomial ring as the principal localisation of Z[t] at t. Then:
(a) is an integral domain;
(b) for every , and more generally for ;
(c) is a unit if and only if for some ;
(d) for the element is not a unit of .
No choice principle is used.
Facts & Assumptions
Given: The Laurent polynomial ring with , a nonzero integer polynomial , and integers .
Every element of is a fraction with and , and is a unit with inverse (The Laurent polynomial ring as the principal localisation of Z[t] at t, A fraction is a unit in exactly when for some ).
A fraction is zero if and only if for some (Equality, vanishing, and the kernel of the localisation map).
is an integral domain (A polynomial ring over an integral domain is an integral domain): it has no zero divisors, so forces for every , since ; and for nonzero one has and the constant term of 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).
A polynomial is a unit if and only if it is constant with value a unit of , and the units of are and (The units of over an integral domain are exactly the constant polynomials whose values are units of , is a commutative monoid whose group of units is ; equivalently holds exactly for and ).
Proof
Normal form. Write a nonzero element of as with , by [F1], and factor out the largest power of dividing : there are and with and , the latter meaning . Then , so every nonzero element has a representative with and . This representative is unique: if with , multiply by to get ; if , the constant term of the right-hand side equals when and vanishes when , while the constant term of is , so and ; the case is symmetric.
is an integral domain. Suppose with , nonzero in normal form, so and by [F3]. Then . If , the element is a polynomial, and [F2] yields with in ; since and is a domain by [F3], , a contradiction. If , the element is , and [F2] yields with in , again forcing by [F3], a contradiction. Hence , so is a domain.
Distinct powers of . The elements and are in normal form, since the constant polynomial has . By uniqueness in step 1.1, forces and . More generally forces , hence .
Units. If , then , so is a unit. Conversely let in normal form be a unit, with inverse in normal form; then . Applying the normal form uniqueness of step 1.1 to and to gives and in . By [F4] the unit of is one of the two constants ; hence .
The sum . For put , a polynomial with constant term and at least two nonzero coefficients. In normal form . If were a unit, step 2.3 would give for some ; two elements equal in have the same normal-form exponent and polynomial by step 1.1, so and , contradicting that has at least two nonzero coefficients. Hence 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
- The Laurent polynomial ring as the principal localisation of Z[t] at t
- A fraction $r/s$ is a unit in $S^{-1}R$ exactly when $ar\in S$ for some $a\in R$
- Equality, vanishing, and the kernel of the localisation map
- Degree, leading coefficient and monic polynomial, with the zero polynomial having no degree
- Over an integral domain, degrees add under multiplication of nonzero polynomials
- The units of $R[x]$ over an integral domain are exactly the constant polynomials whose values are units of $R$
- A polynomial ring over an integral domain is an integral domain
- $(\mathbb{Z}, \cdot, 1)$ is a commutative monoid whose group of units is $\{1, -1\}$; equivalently $u \mid 1$ holds exactly for $u = 1$ and $u = -1$
Used by
- An invariant line need not have an invariant complement over a Laurent ring Counterexample
- The Alexander polynomial from the zeroth elementary ideal Definition
- The HOMFLYPT coefficient ring Definition
- The unreduced Burau matrices Definition
- Specializing Burau at t = 1 recovers permutation data Example
- The image of the full twist under the Burau representation Example
- Unreduced and reduced Burau matrices for three strands Example
- The cyclic cover retracts onto the lifted flower and has a deck-equivariant spine model Lemma
- The invariant vector and the invariant covectors of the unreduced Burau Lemma
- The Laurent polynomial ring is Noetherian and a unique factorisation domain Lemma
- The Markov trace of an inverse Hecke generator Lemma
- The minus-one specialization of three-strand Burau has kernel generated by Delta to the fourth Lemma
- The reduced Burau module is free of rank n minus one Lemma
- The reduced Burau representation detects every power of the fourth power of the half twist in B3 Lemma
- The reduced and unreduced Burau representations have the same kernel Proposition
- The unreduced module fits an exact sequence with the reduced module Proposition
- The Alexander polynomial is an oriented link invariant Theorem
- The reduced Burau representation is faithful for at most three strands Theorem
- The topological and matrix Burau representations agree Theorem
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
- The Stacks Project, Section 10.9 (Localization, Tag 00CM): background on fraction equality and localisation (standard reference, not scraped)
- Joan S. Birman and Tara E. Brendle, Braids: A Survey (background on Burau matrices, the cyclic cover and absolute homology) (standard reference, not scraped)