Math 2.0

definition

Irreducible element

Definition

Let RR be an integral domain. An element p∈Rp \in R is irreducible if it has these three properties.

  1. p≠0p \neq 0.
  2. pp is not a unit.
  3. If p=abp = a b with a,b∈Ra, b \in R, then aa is a unit or bb is a unit.

Remarks

The irreducible elements of Z\mathbb{Z} are the numbers pp and −p-p with pp prime. In Z[i]\mathbb{Z}[i], the number 33 is irreducible, but 5=(2+i)(2−i)5 = (2 + i)(2 - i) is not. Every prime element is irreducible. The converse can fail. For polynomials over a field, the irreducible elements are the irreducible polynomials.

Explanations

L1 human

An irreducible element cannot be split into smaller factors. The only factorizations are trivial ones, with a unit as one factor, like 7=(−1)(−7)7 = (-1)(-7). In the integers, the irreducible elements are the primes and their negatives.

What this node needs for W2
  • edge instance_of in: one example (0 of 1)
  • edge not_instance_of in: one non-example that fails one clause (0 of 1)

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

What this needs

To read this node, read these 7 nodes in this order. The foundations come first, and the list ends with this node.

Each node uses the nodes above it. The colour of the bar on a box shows the evidence level, and the box also gives it as text. The list below has the same nodes.
  • no evidence level
  1. Group concept
  2. Ring definition
  3. Commutative ring definition
  4. Unit of a ring definition
  5. Zero divisor definition
  6. Integral domain definition
  7. Irreducible element definition

What depends on this

41 nodes use this node, directly or through other nodes.

Sources

  1. Web https://en.wikipedia.org/wiki/Irreducible_element, Definition in an integral domain