Valuation et applications larithmtique

Essaidi Ali Lundi 18 Fvrier 2013

Valuation p-adique :
Dnition 1 : Soit n Z et p un nombre premier. On appelle valuation p-adique de n llment de N {+} dni par : vp (n) = sup{k N, pk |n}

Remarques : On note P lensemble des nombres premiers et on rappelle que cet ensemble est inni. n Z, p P, vp (n) = vp (n) = vp (|n|). p P, vp (0) = +. Soit n Z et p P. Lensemble A = {k N, pk |n} est un sous-ensemble de N non vide, car 0 A, et major par n donc admet un lment maximum do vp (n) N et vp (n) = max{k N, pk |n}. Soit n Z. n = 0 p P, vp (n) = +. On convient que : 1. n N, + + n = n + (+) = +. 2. + + (+) = +. 3. + +. 4. n N, n +. Soient n Z, k N et p P. pk |n k vp (n). Soit n N . Si n = p1 pk est la dcomposition de n en facteurs premiers 1 k alors i {1, . . . , k}, vpi (n) = i . Proposition 1 : Soient n, m Z. m|n p P, vp (m) vp (n) Dmonstration : ) Soit p P.

CPGE Laayoune

https ://www.facebook.com/mathlaayoune

Essaidi Ali

Si m = 0 : On a m|n donc n = 0 do vp (m) = + = vp (n). On dduit que vp (m) vp (n). Si m = 0 : On a pvp (m) |m et m|n donc pvp (m) |n do vp (m) vp (n). ) Si m = 0 : Soit p N, on a vp (m) = + et vp (m) vp (n) donc vp (n) = + do n = 0. On dduit que m|n. Si |m| = 1 alors m|n. Si |m| 2, soit |m| = p1 pk la dcomposition de |m| en facteurs premiers 1 k donc i {1, . . . , k}, i = vpi (m). Or i {1, . . . , k}, vpi (m) vpi (n) donc pi |n do m|n. i Corollaire 1 : Soient m, n Z. Alors : |m| = |n| p P, vp (m) = vp (n)

Dmonstration : |m| = |n| m|n et n|m p P, vp (m) vp (n) et vp (n) vp (m) p P, vp (m) = vp (n). Proprit 1 : Soient m, n Z et p P : vp (mn) = vp (m) + vp (n). Si m N et (m, n) = (0, 0) alors vp (nm ) = mvp (n). vp (m n) = min(vp (m), vp (n)). vp (m n) = max(vp (n), vp (n)). Dmonstration : Si m = 0 ou n = 0 alors mn = 0 do vp (mn) = + = vp (m) + vp (n). Si non, on a pvp (m) |m et pvp (n) |n donc pvp (m)+vp (n) |mn do vp (m) + vp (n) vp (mn). On a pvp (mn) |mn donc k, l N tels que k + l = vp (mn), pk |m et pl |n. On dduit que k vp (m) et l vp (n) et par suite vp (mn) = k + l vp (m) + vp (n). Donc vp (mn) = vp (m) + vp (n). 1. Si m = 0 alors n = 0 donc vp (nm ) = vp (1) = 0 = mvp (n). 2. Sinon, on a k {0, . . . , m 1}, vp (nk+1 ) = vp (nnk ) = vp (n) + vp (nk ) donc vp (nk+1 ) vp (nk ) = vp (n).
m1 m1

On a
k=0

vp (nk+1 ) vp (nk ) =
k=0

vp (n) donc vp (nm ) vp (1) =

mvp (n) do vp (nm ) = mvp (n) car vp (1) = 0. On a m n|m et m n|n donc vp (m n) vp (m) et vp (m n) vp (n) do vp (m n) min(vp (m), vp (n)). Si m = 0 ou n = 0 alors mn = 0 donc vp (mn) = + min(vp (m), vp (n)). Si non, on pose k = min(vp (m), vp (n)). On a k vp (m) et k vp (n) www.mathlaayoune.webs.com 2/4 mathlaayoune@gmail.com

CPGE Laayoune

https ://www.facebook.com/mathlaayoune

Essaidi Ali

donc pk |m et pk |n do pk |(m n). On dduit que min(vp (m), vp (n)) = k vp (m n). Do vp (m n) = min(vp (m), vp (n)). On a |mn| = (m n)(m n) donc vp (|mn|) = vp ((m n)(m n)) do vp (m) + vp (n) = vp (n m) + vp (m n). Or vp (m) + vp (n) = max(vp (m), vp (n)) + min(vp (m), vp (n)) et vp (m n) = min(vp (m), vp (n)) donc vp (m n) = max(vp (n), vp (n)).

Applications :

Soient a, b, c Z. Exemple 01 : Montrons que a (b c) = (a b) (a c) : Soit p P, on a : vp (a (b c)) = min(vp (a), vp (b c)) = min(vp (a), max(vp (b), vp (c))) = max(min(vp (a), vp (b)), min(vp (a), vp (c))) = max(vp (a b), vp (a c)) = vp ((a b) (a c)) Donc a (b c) = (a b) (a c). Exemple 02 : Montrons que a (b c) = (a b) (a c) : Soit p P, on a : vp (a (b c)) = max(vp (a), vp (b c)) = max(vp (a), min(vp (b), vp (c))) = min(max(vp (a), vp (b)), max(vp (a), vp (c))) = min(vp (a b), vp (a c)) = vp ((a b) (a c)) Donc a (b c) = (a b) (a c). Exemple 03 : Montrons que (a b) (b c) (c a) = (a b) (b c) (c a) : Soit p P, Vu la symtrie de lexpression dmontrer on peut supposer que vp (a) vp (b) vp (c). On a : vp ((a b) (b c) (c a)) = max(min(vp (a), vp (b)), min(vp (b), vp (c)), min(vp (c), vp (a))) = max(vp (a), vp (b), vp (a)) = vp (b) De mme : vp ((a b) (b c) (c a)) = min(max(vp (a), vp (b)), max(vp (b), vp (c)), max(vp (c), vp (a))) = max(vp (b), vp (c), vp (c)) = vp (b) Donc (a b) (b c) (c a) = (a b) (b c) (c a). Exemple 04 : Montrons que (a b c)(ab bc ca) = |abc|. Soit p P, Vu la symtrie de lexpression dmontrer on peut supposer que vp (a) vp (b) vp (c). On a : vp ((a b c)(ab bc ca)) = vp ((a b c)) + vp ((ab bc ca)) = min(vp (a), vp (b), vp (c)) + max(vp (a) + vp (b), vp (b) + vp (c), vp (c) + vp (a)) = vp (a) + vp (b) + vp (c) = vp (abc)

www.mathlaayoune.webs.com

3/4

mathlaayoune@gmail.com

CPGE Laayoune

https ://www.facebook.com/mathlaayoune

Essaidi Ali

Donc (a b c)(ab bc ca) = |abc|. Exemple 05 : Montrons que (a b c)(ab bc ca) = |abc| : Soit p P, Vu la symtrie de lexpression dmontrer on peut supposer que vp (a) vp (b) vp (c). On a : vp ((a b c)(ab bc ca)) = vp ((a b c)) + vp ((ab bc ca)) = max(vp (a), vp (b), vp (c)) + min(vp (a) + vp (b), vp (b) + vp (c), vp (c) + vp (a)) . = vp (c) + vp (a) + vp (b) = vp (abc) Donc (a b c)(ab bc ca) = |abc|. Exemple 06 : Montrons que (a b c)(a b)(b c)(c a) = |abc|(a b c) : Soit p P, Vu la symtrie de lexpression dmontrer on peut supposer que vp (a) vp (b) vp (c). On a : vp ((a b c)(a b)(b c)(c a)) = vp (a b c) + vp (a b) + vp (b c) + vp (c a) = max(vp (a), vp (b), vp (c)) + min(vp (a), vp (b)) + min(vp (b), vp (c)) + min(vp (c), vp (a)) = vp (c) + vp (a) + vp (b) + vp (a) = (vp (a) + vp (b) + vp (c)) + vp (a) = vp (abc) + min(vp (a), vp (b), vp (c)) = vp (abc) + vp (a b c) = vp (abc(a b c)) Donc (a b c)(a b)(b c)(c a) = |abc|(a b c). (a b)(b c)(c a) (a b)(b c)(c a) = . Exemple 07 : On suppose que abc = 0. Montrons que (a b c)2 (a b c)2 Soit p P, Vu la symtrie de lexpression dmontrer on peut supposer que vp (a) vp (b) vp (c). On a : vp ((a b)(b c)(c a)(a b c)2 ) = vp (a b) + vp (b c) + vp (c a) + 2vp (a b c) = vp (a) + vp (b) + vp (a) + 2vp (c) = vp (b) + vp (c) + vp (c) + 2vp (a) = vp (a b) + vp (b c) + vp (c a) + vp ((a b c)2 ) = vp ((a b)(b c)(c a)(a b c)2 ) 2 Donc (a b)(b c)(c a)(a b c) = (a b)(b c)(c a)(a b c)2 . (a b)(b c)(c a) (a b)(b c)(c a) On dduit que = . (a b c)2 (a b c)2

www.mathlaayoune.webs.com

4/4

mathlaayoune@gmail.com