Unique factorisation domain
Definition
A unique factorisation domain is an integral domain with these two properties.
- Every nonzero element that is not a unit is a product of irreducible elements, with .
- The factorization is unique up to order and units. If with all irreducible, then . Also, there is a permutation of such that and are associates for each .
Remarks
The integers are a unique factorisation domain: this is the fundamental theorem of arithmetic. Every principal ideal domain is a unique factorisation domain, and so is every polynomial ring over a unique factorisation domain. The ring is not a unique factorisation domain. In a unique factorisation domain, irreducible elements are prime.
Explanations
L1 human
In the integers, , and every other factorization into primes uses the same primes, up to order and signs. A unique factorisation domain is a ring where this works for every nonzero nonunit. Units like do not count as a different factorization.
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 10 nodes in this order. The foundations come first, and the list ends with this node.
- no evidence level
- Group concept
- Ring definition
- Commutative ring definition
- Unit of a ring definition
- Zero divisor definition
- Divisibility in a commutative ring definition
- Integral domain definition
- Associate elements definition
- Irreducible element definition
- Unique factorisation domain definition
What depends on this
15 nodes use this node, directly or through other nodes.
- Existence of splitting fields 01441KDGBY
- Eisenstein's criterion 02BPKD7TMD
- Galois field 04SGPNT8R9
- PID implies UFD 055HT85T3S
- Product of primitive polynomials is primitive 08C1NWBNHA
- Content of a polynomial 08VV7YJRB7
- Z[√-5] is not a UFD 0BSJYCG7NM
- Impossibility of doubling the cube 0CQ357M0QS
- Polynomial ring over a UFD is a UFD 0D6KH8Y59N
- Reduction modulo p test for irreducibility 0KWWEXW0RN
- Gauss's lemma 0QFV5Y1Z5X
- In a UFD irreducible elements are prime 0QRCFZKXH8
- Primitive polynomial 0SP14DZN0G
- Existence of finite fields of every prime power order 0T8M3YC5RG
- Every polynomial has a root in some extension field 0VG02M1FEZ
Sources
What links here
Used by
- PID implies UFD 055HT85T3S
- Product of primitive polynomials is primitive 08C1NWBNHA
- Content of a polynomial 08VV7YJRB7
- Z[√-5] is not a UFD 0BSJYCG7NM
- Polynomial ring over a UFD is a UFD 0D6KH8Y59N
- Gauss's lemma 0QFV5Y1Z5X
- In a UFD irreducible elements are prime 0QRCFZKXH8