Proof that the p-adic valuation of a product is the sum of the valuations
Proof
- Let be a prime and let , be nonzero integers. Put and , where is the p-adic valuation.
- Since , write with an integer . Then .
- We have . Otherwise for an integer , so and . This contradicts the maximality of .
- In the same way, with an integer and .
- Then . Since , is a natural number. Since , .
- Suppose . Then for an integer .
- Cancelling the nonzero factor gives , so .
- By Euclid's lemma, or . This contradicts steps 3 and 4.
- So . If and , then , since divides . Hence no such exists.
- Therefore .
Idea
Pull out of and all the factors they contain. The parts that remain are not divisible by , and by Euclid's lemma neither is their product. So the product contains exactly factors .
Reading path
To understand this page from the ground up, read these 29 pages in order. The foundations come first. The path takes the proofs Proof of Bézout's identity, Proof of the generalized Euclid's lemma, Proof of the commutativity of addition by induction, Proof of Euclid's lemma, Proof of strong induction from ordinary induction, Proof of the well-ordering principle from strong induction, Proof of the division algorithm.
Show the path as a graph
- no evidence level
- Definition by recursion concept
- Divisibility definition
- Mathematical induction concept
- Natural numbers object
- Peano axioms concept
- Greatest common divisor definition
- Prime number definition
- Successor function definition
- Coprime integers definition
- P-adic valuation definition
- Addition of natural numbers definition
- The successor function is injective statement
- Zero is not a successor statement
- Proof of the commutativity of addition by induction proof
- Order on the natural numbers definition
- Commutativity of addition statement
- Proof of strong induction from ordinary induction proof
- Strong induction statement
- Proof of the well-ordering principle from strong induction proof
- Well-ordering principle statement
- Proof of the division algorithm proof
- Division algorithm statement
- Proof of Bézout's identity proof
- Bézout's identity statement
- Proof of the generalized Euclid's lemma proof
- Generalized Euclid's lemma statement
- Proof of Euclid's lemma proof
- Euclid's lemma statement
- Proof that the p-adic valuation of a product is the sum of the valuations proof
Where this leads
20 pages build on this one.
- Legendre's formula
- Sum of two squares theorem
- P-adic valuation of a product
- Fermat's right triangle theorem
- Fermat's Last Theorem for n = 4
- Lifting-the-exponent lemma
- Classification of Pythagorean triples
- Dirichlet convolution of multiplicative functions is multiplicative
- Multiplicativity of the Möbius function
- Kummer's theorem
- Proof of the sum of two squares theorem
- Proof of the classification of Pythagorean triples
- Proof of Fermat's right triangle theorem by infinite descent
- Proof of the multiplicativity of the Möbius function
- Proof of Kummer's theorem from Legendre's formula
- Proof of Fermat's Last Theorem for n = 4
- Congruent number problem
- Proof of the lifting-the-exponent lemma for odd primes
- Proof of Legendre's formula by counting multiples of prime powers
- Proof that the Dirichlet convolution of multiplicative functions is multiplicative
Further reading
About this page
| Tag | CTKD74QERT |
|---|---|
| URI | m2://CTKD74QERT |
| Kind | proof |
| Writing | W0 stub |
| MSC | 11A51 |
| Proves | P-adic valuation of a product |
| Uses | P-adic valuation, Euclid's lemma, Divisibility |
| Changed | 4 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.