@[simp]
The classical geometric-series divisibility identity at the natural-number
level: x - 1 divides x^j - 1 for any x, j : Nat. Downstream polynomial
divisibility proofs use this as an automation-facing rewrite, without unfolding
the geometric-series witness.
Edge cases (where the implicit subtraction underflows to 0) all reduce to
0 ∣ 0 and require no special handling.
@[simp]
Fermat-style exponent identity: if d ∣ m, then p^d - 1 ∣ p^m - 1 over
Nat. This is the public helper used in the project-side
xPowSubX_dvd_of_dvd polynomial divisibility chain.