Math 2.0

Field theory and polynomials Definition

Near-field

Builds on Abelian groupGroupDivision ringFinite fieldFrobenius endomorphism

Definition

A near-field is a set NN with two binary operations ++ and ⋅\cdot such that:

  1. (N,+)(N, +) is an abelian group, with identity element 00.
  2. N∖{0}N \setminus \set{0} is closed under ⋅\cdot and is a group under ⋅\cdot.
  3. a⋅0=0⋅a=0a \cdot 0 = 0 \cdot a = 0 for all a∈Na \in N.
  4. (a+b)⋅c=a⋅c+b⋅c(a + b) \cdot c = a \cdot c + b \cdot c for all a,b,c∈Na, b, c \in N.

Remarks

Clauses 2 and 3 make multiplication associative on all of NN, with an identity 11. Some authors use the left distributive law a(b+c)=ab+aca(b + c) = ab + ac in clause 4 instead; the two versions are mirror images of each other. A near-field that also satisfies the other distributive law is a division ring. The commutativity of ++ in clause 1 is often omitted, because it follows from the other clauses.

Example: let F=𝔽9F = \F_9 be the finite field with 99 elements, and let ϕ(a)=a3\phi(a) = a^3 be its Frobenius automorphism. Define a∘b=aba \circ b = a b if bb is a square in FF (including b=0b = 0) and a∘b=ϕ(a)ba \circ b = \phi(a) b otherwise. Clause 4 holds because ϕ\phi is additive. Clause 2 holds because ϕ\phi preserves squares. So b∘cb \circ c is a nonzero square exactly when bb and cc are both squares or both non-squares, and this gives associativity. The element 11 is the identity. A nonzero bb has the inverse cc with ϕk(c)=b−1\phi^{k}(c) = b^{-1}, where k=0k = 0 if bb is a square and k=1k = 1 otherwise. Write 𝔽9=𝔽3(i)\F_9 = \F_3(i) with i2=−1i^2 = -1; then ii is a square and 1+i1 + i is not, and i∘(1+i)=1−ii \circ (1 + i) = 1 - i while (1+i)∘i=i−1(1 + i) \circ i = i - 1. So (F,+,∘)(F, +, \circ) is a near-field with non-commutative multiplication; since every finite division ring is commutative, it is not a division ring.

Non-example: ℤ\Z with its usual operations satisfies clauses 1, 3 and 4 but fails clause 2, because 22 has no multiplicative inverse in ℤ\Z.

Reading path

To understand this page from the ground up, read these 6 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Abelian group concept
  2. Division ring concept
  3. Finite field concept
  4. Frobenius endomorphism concept
  5. Group concept
  6. Near-field definition

Further reading

  1. Web https://en.wikipedia.org/wiki/Near-field_(mathematics)
About this page
Tag486GPTW3M8
URIm2://486GPTW3M8
Kinddefinition
WritingW0 stub
MSC12K05, 16Y30
DefinesNear-field
UsesAbelian group, Group, Division ring, Finite field, Frobenius endomorphism
Changed2 November 2026

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)
  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.