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 characteristic of a ring: the least with when one exists, and otherwise
Definition
Let be a ring (Ring: an abelian group under addition and a monoid under multiplication, with multiplication distributing over addition on both sides) with identity and zero . For let be the additive natural power of in the abelian group (Powers : natural exponents in a monoid and integer exponents in a group, with , Group and abelian group): thus and . Put
The characteristic of is
Why the least element exists. is a subset of , so when it is nonempty it has a least element by the well-ordering principle (The well-ordering principle), and that element is unique: two least members are below one another and hence equal by antisymmetry of the natural-number order ( is a linear order on , Order on the natural numbers). So is a well-defined natural number in both cases.
The clause is not decoration. contains (The natural numbers (von Neumann)) and holds in every ring, so without that clause would always contain and the definition would say nothing.
Convention: the value in the empty case is , and this is the OPPOSITE of the convention for the order of a group element. The order of a finite group and the order of an element, with when no positive power of is the identity writes when no positive power of is the identity. Here the value in the corresponding case is the natural number , not a symbol . A reader coming straight from The order of a finite group and the order of an element, with when no positive power of is the identity should notice the difference: it is deliberate, it is the standard convention for the characteristic, and it is what makes the divisibility statement of The characteristic of a ring is the additive order of , with recording infinite order; holds exactly when ; and in an integral domain every nonzero element has the same additive order as uniform across the two cases.
is a natural number, hence a set, not an element of . A natural number in this library is a von Neumann natural (The natural numbers (von Neumann)), so in general and the expression is not a product in but the additive multiple just described.
Dictionary for fields. When is a field (Field), the element is exactly the canonical natural of The canonical natural of a field; this is proved, not assumed, in In a field, the additive multiple is the canonical natural : the additive power of the group-power definition and the canonical natural are the same function, both being the unique one given by the recursion , . So for a field and the characteristic is the least with , or if there is none.
Remarks
-
Characteristic occurs, exactly once. , so exactly when , that is exactly when is the one-element ring; and then , since is the least member of with . The companion page records that ring. Every other ring has characteristic or a value at least .
-
Characteristic means "no such ", not " works". The value is a flag, and the flag is chosen so that " exactly when divides " is true in both cases: when the characteristic is the right-hand side says , which is exactly right. That statement is The characteristic of a ring is the additive order of , with recording infinite order; holds exactly when ; and in an integral domain every nonzero element has the same additive order as .
-
A further theorem about the possible characteristics of an integral domain is not stated here. The current corpus does not yet state or prove that result. A future algebra page may add it from The characteristic of a ring is the additive order of , with recording infinite order; holds exactly when ; and in an integral domain every nonzero element has the same additive order as once the needed prime-number interface is brought into scope.
Depends on
- Ring: an abelian group under addition and a monoid under multiplication, with multiplication distributing over addition on both sides
- Group and abelian group
- Powers $g^{n}$: natural exponents in a monoid and integer exponents in a group, with $g^{0} = e$
- In a field, the additive multiple $n \cdot 1_F$ is the canonical natural $\iota(n)$: the additive power of the group-power definition and the canonical natural are the same function, both being the unique one given by the recursion $\iota(0) = 0_F$, $\iota(\sigma(n)) = \iota(n) + 1_F$
- The canonical natural $\iota(n) = n \cdot 1_F$ of a field
- Field
- The order $|G|$ of a finite group and the order $\operatorname{ord}(g)$ of an element, with $\operatorname{ord}(g) = \infty$ when no positive power of $g$ is the identity
- The well-ordering principle
- The natural numbers $\mathbb{N}$ (von Neumann)
- Order on the natural numbers
- $\le$ is a linear order on $\mathbb{N}$
Used by
- [ℚ(ζₙ):ℚ]=φ(n) and Gal(ℚ(μₙ)/ℚ)≅(ℤ/n)^× Corollary
- The Galois group of a cyclotomic extension is abelian Corollary
- A quadratic form q in arbitrary characteristic and its polar form b_q(u,v)=q(u+v)-q(u)-q(v) Definition
- ℚ and ℝ are fields, hence commutative rings, integral domains and ordered rings, all of characteristic 0 Example
- The zero ring {0}, in which 1 = 0: a commutative ring of characteristic 1 that is not a domain, not a division ring and not a field Example
- When char(k) is not 2, the affine circle x² + y² = 1 is birational to the affine line Example
- ℤ is an integral domain of characteristic 0 whose group of units is {1,-1}, so it is not a field: 2 is nonzero and not invertible Example
- If p is a prime not dividing n, a rational minimal polynomial of a primitive n-th root of unity also kills its p-th power Lemma
- The characteristic of a ring is the additive order of 1_R, with 0 recording infinite order; n · 1_R = 0 holds exactly when char(R) ∣ n; and in an integral domain every nonzero element has the same additive order as 1_R Lemma
- Every intermediate field of ℚ(μₙ)/ℚ is Galois over ℚ with abelian Galois group Proposition
- In characteristic p the only pᵏ-th root of unity is 1, and t^pᵏ-1=(t-1)^pᵏ Proposition
- The underlying-set functor on fields has no left adjoint Proposition
- Φ_pʳ(t)=∑_k<pt^kpʳ⁻¹, and Φ_pʳ(t+1) is Eisenstein at p Proposition
- Φₙ is irreducible over K exactly when [K(ζₙ):K]=φ(n), exactly when the embedding into (ℤ/n)^× is onto Proposition
- Alternating forms are skew-symmetric; the converse holds when charF≠2, while in characteristic 2 alternating forms are symmetric Theorem
- Every finite abelian group is the Galois group of some finite Galois extension of ℚ Theorem
- For every n≥1 there are infinitely many primes p with p≡1 (mod n) Theorem
- For gcd(n,q)=1 the reduction of Φₙ in F_q[t] is a product of distinct monic irreducibles, each of degree the order of [q] modulo n Theorem
- If charF≠2, quadratic forms and symmetric bilinear forms correspond by q(v)=B(v,v) and B(u,v)=1/2 b_q(u,v) Theorem
- In characteristic p, a degree-p extension is cyclic exactly when it is generated by a root of xᵖ-x-a with a∈ F and that polynomial irreducible Theorem
- K(μₘ)K(μₙ)=K(μ_lcm(m,n)) Theorem
- K(μₙ)/K is Galois and σ↦ a_σ embeds its Galois group into (ℤ/n)^× Theorem
- Over a field whose characteristic does not divide n, the roots of Φₙ are exactly the primitive roots of unity Theorem
- Over a named splitting field in characteristic zero, repeated characteristic roots give polynomial-times-exponential closed forms Theorem
- PBW symmetrization in characteristic zero Theorem
- ℚ(μₘ)∩ℚ(μₙ)=ℚ(μ_gcd(m,n)) Theorem
- The characteristic of a field is zero or a prime number Theorem
- The recursion defines a unique monic Φₙ∈ℤ[t], of degree φ(n) Theorem
- tⁿ-1 is separable over K exactly when the characteristic does not divide n, and then a splitting field carries n distinct n-th roots of unity Theorem
- Φₙ is irreducible in ℚ[t] for every n≥1 Theorem
Dependency tree · two levels
44 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
- Characteristic (algebra) (Wikipedia) (standard reference, not scraped)