mondrian_dvd_prime_pow_eq
A divisor x of a power of a prime p is p to its own p-adic exponent.
Statement
theorem mondrian_dvd_prime_pow_eq (p e x : ℕ) (hp : Nat.Prime p)
(hx : x ∣ p ^ e) : x = p ^ (x.factorization p)- Source
- Helper for OP-280 and mondrian_perfect_partition_large_prime_iff. Related work: arXiv:2610.19193, Section 1 (perfect partitions and scaling); arXiv:2007.09639, Theorem 4.1 (available shapes and prime-power exclusions).
- Verified
- 26 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Used by 3
- mondrian_prime_free_area_shape_boundFor distinct primes p and q, if t+r=2e, at most r plus floor(log_p(q)) plus one shapes of pure p-power area p^t fit in the q times p^e…
- mondrian_prime_free_height_encodingIf x*y=q^s*p^t for primes p and q and q does not divide x, then y is q^s times a power of p; the primes need not be distinct.
- mondrian_prime_power_shape_boundFor k at least two and positive A with k times A equal to the area of a p-power square, the number of available shapes is at most the…
The proof, explained
Since $p$ is prime, any divisor $x$ of $p^e$ must be an integer power of $p$, say $x = p^u$ for some $u \\le e$. Substituting this expression for $x$, the multiplicity of $p$ in the prime factorization of $p^u$ is precisely $u$. Therefore, $x = p^u = p^{x\\text{.factorization } p}$.
$x$ is of the form $p^u$ for some exponent $u \\le e$
Since $p$ is prime and $x$ divides $p^e$, the classification of divisors of prime powers (Nat.dvd_prime_pow) shows that $x = p^u$ for some $u \\le e$. Substituting $x$ with $p^u$ updates the goal to $p^u = p^{(p^u\\text{.factorization } p)}$.
uses
Nat.dvd_prime_powobtain ⟨u, hu, rfl⟩ := (Nat.dvd_prime_pow hp).mp hx
The identity $p^u = p^{(p^u\\text{.factorization } p)}$ holds
For a prime $p$, the exponent of $p$ in the prime factorization of $p^u$ is simply $u$ (Nat.factorization_pow_self). Rewriting the exponent with this evaluation simplifies the right-hand side to $p^u$, closing the goal by reflexivity.
uses
Nat.factorization_pow_selfrw [Nat.factorization_pow_self hp]
Nat.dvd_prime_pow- A natural number divides a power of a prime $p^m$ if and only if it equals $p^k$ for some $k \\le m$.
Nat.factorization_pow_self- For a prime $p$, the multiplicity of $p$ in the prime factorization of $p^n$ is $n$.
Written by a model (gemini-3.8-flash) from the Lean proof and the goal states Lean reported at each step. Lean verified the proof; this explanation is a reading aid and is not itself machine-checked.
Lean source view module on GitHub
Choose a tactic — a marked line — to see the goals Lean had before and after it, as in Lean’s infoview. Step with ← → or j k.
theorem mondrian_dvd_prime_pow_eq (p e x : ℕ) (hp : Nat.Prime p) (hx : x ∣ p ^ e) : x = p ^ (x.factorization p) := by obtain ⟨u, hu, rfl⟩ := (Nat.dvd_prime_pow hp).mp hx rw [Nat.factorization_pow_self hp]