Math 2.0

definition

Divisibility in a commutative ring

Definition

Let RR be a commutative ring and let a,b∈Ra, b \in R. The element aa divides bb, written a∣ba \mid b, if there is c∈Rc \in R with b=acb = a c. Then aa is a divisor of bb, and bb is a multiple of aa.

Remarks

The relation a∣ba \mid b holds if and only if (b)⊆(a)(b) \subseteq (a) for the principal ideals. Every element divides 00, and 00 divides only 00. A unit divides every element. In Z[i]\mathbb{Z}[i], 1+i1 + i divides 22, because 2=(1+i)(1−i)2 = (1 + i)(1 - i).

Explanations

L1 human

Divisibility in a ring works as for integers: aa divides bb if bb is aa times some element of the ring. The answer depends on the ring: 22 does not divide 11 in Z\mathbb{Z}, but it does in Q\mathbb{Q}.

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 4 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. Divisibility in a commutative ring definition

What depends on this

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

Sources

  1. Web https://en.wikipedia.org/wiki/Divisibility_(ring_theory), Definition