The p-adic valuation of n factorial is the sum of all quotient floors by powers of p. A small computation will anchor the general statement before the abstraction takes over.
Objects and notation
The valuation \(v_p(n)\) counts factors of \(p\), and the metric \(|x|_p=p^{-v_p(x)}\) reverses the usual sense of size. Hensel lifting turns approximate roots modulo \(p\) into exact \(p\)-adic roots.
The first display fixes the mathematical data. I label it \(\mathsf{data}\) mentally, while the next is the \(\mathsf{claim}\); the bridge between them is the displayed \(\Longrightarrow\), not an automatic implication.
Push the symbols
Now evaluate one representative case. The result should agree with the structural law above, but it is obtained without assuming the conclusion.
Structural reading
The abstraction earns its keep by explaining why the same computation reappears. The notation compresses repeated reasoning without erasing the hypothesis that licenses it.
A hypothesis worth keeping
A congruence root lifts uniquely only in the simple-root case. Multiple roots need stronger inequalities and may split, disappear, or lift nonuniquely.
This is enough machinery for one note: an exact object, a worked case, a structural law, and a clearly marked boundary. Each layer can now be tested independently.