Math 2.0

statement proposition

Prime elements are irreducible in an integral domain

Statement

Let RR be an integral domain and let p∈Rp \in R be a prime element. Then pp is irreducible.

Remarks

The proof: let p=abp = a b. Then p∣abp \mid a b, so p∣ap \mid a, say. Write a=pca = p c. Then p=pcbp = p c b, and cancellation gives cb=1c b = 1, so bb is a unit. The converse is false in general: in Z[−5]\mathbb{Z}[\sqrt{-5}], 22 is irreducible but not prime. In a unique factorization domain, irreducible elements are prime.

Explanations

L1 human

Suppose that a prime pp factors as aba b. Then pp divides one factor, so that factor is at least as large as pp for divisibility. The other factor must then be a unit.

What this node needs for W1
  • an inventory row: the row of the inventory that the node accounts for (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 10 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. Divisibility in a commutative ring definition
  7. Integral domain definition
  8. Prime element definition
  9. Irreducible element definition
  10. Prime elements are irreducible in an integral domain statement

What depends on this

1 node uses this node, directly or through other nodes.

Sources

  1. Web https://en.wikipedia.org/wiki/Prime_element, Irreducible elements