Math 2.0

Number theory Proof

Proof that the p-adic valuation of a product is the sum of the valuations

Builds on P-adic valuationEuclid's lemmaDivisibility

Proof

  1. Let pp be a prime and let aa, bb be nonzero integers. Put α=νp(a)\alpha = \nu_p(a) and β=νp(b)\beta = \nu_p(b), where νp\nu_p is the p-adic valuation.
  2. Since pα∣ap^\alpha \mid a, write a=pαa′a = p^\alpha a' with an integer a′a'. Then a′≠0a' \neq 0.
  3. We have p∤a′p \nmid a'. Otherwise a′=pca' = p c for an integer cc, so a=pα+1ca = p^{\alpha + 1} c and pα+1∣ap^{\alpha+1} \mid a. This contradicts the maximality of α\alpha.
  4. In the same way, b=pβb′b = p^\beta b' with an integer b′b' and p∤b′p \nmid b'.
  5. Then ab=pα+βa′b′a b = p^{\alpha + \beta} a' b'. Since ab≠0a b \neq 0, νp(ab)\nu_p(ab) is a natural number. Since pα+β∣abp^{\alpha + \beta} \mid ab, νp(ab)≥α+β\nu_p(ab) \ge \alpha + \beta.
  6. Suppose pα+β+1∣abp^{\alpha + \beta + 1} \mid ab. Then pα+βa′b′=pα+β+1dp^{\alpha + \beta} a' b' = p^{\alpha + \beta + 1} d for an integer dd.
  7. Cancelling the nonzero factor pα+βp^{\alpha + \beta} gives a′b′=pda' b' = p d, so p∣a′b′p \mid a' b'.
  8. By Euclid's lemma, p∣a′p \mid a' or p∣b′p \mid b'. This contradicts steps 3 and 4.
  9. So pα+β+1∤abp^{\alpha + \beta + 1} \nmid ab. If k>α+βk > \alpha + \beta and pk∣abp^k \mid ab, then pα+β+1∣abp^{\alpha + \beta + 1} \mid ab, since pα+β+1p^{\alpha+\beta+1} divides pkp^k. Hence no such kk exists.
  10. Therefore νp(ab)=α+β=νp(a)+νp(b)\nu_p(ab) = \alpha + \beta = \nu_p(a) + \nu_p(b).

Idea

Pull out of aa and bb all the factors pp they contain. The parts that remain are not divisible by pp, and by Euclid's lemma neither is their product. So the product contains exactly α+β\alpha + \beta factors pp.

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
Definition by recursion, concept, no evidence levelDefinition by recursi…conceptDivisibility, definition, no evidence levelDivisibilitydefinitionMathematical induction, concept, no evidence levelMathematical inductionconceptNatural numbers, object, no evidence levelNatural numbersobjectPeano axioms, concept, no evidence levelPeano axiomsconceptGreatest common divisor, definition, no evidence levelGreatest common divis…definitionPrime number, definition, no evidence levelPrime numberdefinitionSuccessor function, definition, no evidence levelSuccessor functiondefinitionCoprime integers, definition, no evidence levelCoprime integersdefinitionP-adic valuation, definition, no evidence levelP-adic valuationdefinitionAddition of natural numbers, definition, no evidence levelAddition of natural n…definitionThe successor function is injective, statement, no evidence levelThe successor functio…statementZero is not a successor, statement, no evidence levelZero is not a success…statementProof of the commutativity of addition by induction, proof, no evidence levelProof of the commutat…proofOrder on the natural numbers, definition, no evidence levelOrder on the natural …definitionCommutativity of addition, statement, no evidence levelCommutativity of addi…statementProof of strong induction from ordinary induction, proof, no evidence levelProof of strong induc…proofStrong induction, statement, no evidence levelStrong inductionstatementProof of the well-ordering principle from strong induction, proof, no evidence levelProof of the well-ord…proofWell-ordering principle, statement, no evidence levelWell-ordering princip…statementProof of the division algorithm, proof, no evidence levelProof of the division…proofDivision algorithm, statement, no evidence levelDivision algorithmstatementProof of Bézout's identity, proof, no evidence levelProof of Bézout's ide…proofBézout's identity, statement, no evidence levelBézout's identitystatementProof of the generalized Euclid's lemma, proof, no evidence levelProof of the generali…proofGeneralized Euclid's lemma, statement, no evidence levelGeneralized Euclid's …statementProof of Euclid's lemma, proof, no evidence levelProof of Euclid's lem…proofEuclid's lemma, statement, no evidence levelEuclid's lemmastatementProof that the p-adic valuation of a product is the sum of the valuations, proof, no evidence levelProof that the p-adic…proof
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Definition by recursion concept
  2. Divisibility definition
  3. Mathematical induction concept
  4. Natural numbers object
  5. Peano axioms concept
  6. Greatest common divisor definition
  7. Prime number definition
  8. Successor function definition
  9. Coprime integers definition
  10. P-adic valuation definition
  11. Addition of natural numbers definition
  12. The successor function is injective statement
  13. Zero is not a successor statement
  14. Proof of the commutativity of addition by induction proof
  15. Order on the natural numbers definition
  16. Commutativity of addition statement
  17. Proof of strong induction from ordinary induction proof
  18. Strong induction statement
  19. Proof of the well-ordering principle from strong induction proof
  20. Well-ordering principle statement
  21. Proof of the division algorithm proof
  22. Division algorithm statement
  23. Proof of Bézout's identity proof
  24. Bézout's identity statement
  25. Proof of the generalized Euclid's lemma proof
  26. Generalized Euclid's lemma statement
  27. Proof of Euclid's lemma proof
  28. Euclid's lemma statement
  29. 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.

Further reading

  1. Web https://en.wikipedia.org/wiki/P-adic_valuation
About this page
TagCTKD74QERT
URIm2://CTKD74QERT
Kindproof
WritingW0 stub
MSC11A51
ProvesP-adic valuation of a product
UsesP-adic valuation, Euclid's lemma, Divisibility
Changed4 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.