|
|
|
|
divisibility by product
|
(Theorem)
|
|
|
Proof. The divisibility assumptions mean that $c = aa_1 = bb_1$ where $a_1$ and $b_1$ are some elements of $R$ . Because $R$ is a Bézout ring, there exist such elements $x$ and $y$ of $R$ that $\gcd(a,\,b) = 1 = xa+yb$ . This implies the equation $a_1 = xaa_1+yba_1 = xbb_1+yba_1$ which shows that $a_1$ is divisible by $b$ , i.e. $a_1 = bb_2$ , $b_2\in R$ . Consequently, $c = aa_1 = abb_2$ , or $ab \mid c$ Q.E.D.
Note 1. The theorem may by induction be generalized for several factors of $c$ .
Note 2. The theorem holds e.g. in all Bézout domains, especially in principal ideal domains, such as $\mathbb{Z}$ and polynomial rings over a field.
|
"divisibility by product" is owned by pahio.
|
|
(view preamble | get metadata)
Cross-references: field, polynomial rings, principal ideal domains, Bézout domains, induction, theorem, divisible, equation, implies, divisibility, proof, divide, principal ideal, ideal, finitely generated, non-zero unity, commutative ring
There are 2 references to this entry.
This is version 10 of divisibility by product, born on 2004-11-22, modified 2008-03-18.
Object id is 6513, canonical name is DivisibilityByProduct.
Accessed 2876 times total.
Classification:
| AMS MSC: | 11A51 (Number theory :: Elementary number theory :: Factorization; primality) | | | 13A05 (Commutative rings and algebras :: General commutative ring theory :: Divisibility) |
|
|
|
|
|
|
Pending Errata and Addenda
|
|
|
|
|
|
|
|
|
|
|