AFTD Auto-Formalizing Theoretical Domains

mondrian_no_perfect_six_mul_prime_pow

theoremverified

For every prime p greater than six and every natural e, the square of side six times p to the e has no perfect admissible partition.

Statement

theorem mondrian_no_perfect_six_mul_prime_pow (p e : ℕ)
    (hp : Nat.Prime p) (hpc : 6 < p) :
    ¬ ∃ P, mondrian_is_partition (6 * p ^ e) P ∧ mondrian_defect P = 0
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
Built on 4
  • mondrian_defectThe defect def(P) = max_{R∈P} |R| − min_{R∈P} |R| of a family of rectangles.
  • mondrian_is_partitionAn admissible Mondrian partition of the n×n square: at least two axis-parallel rectangles with positive integer side lengths, with…
  • mondrian_large_prime_descentIf c is positive and p is a prime greater than c, any perfect partition of the c times p to the e square yields a perfect partition of the…
  • mondrian_no_perfect_sixThe integer square of side six has no perfect admissible partition.

The proof, explained

The theorem is proved by contradiction. If the square of side 6 * p ^ e had a perfect partition, then because p is a prime strictly greater than 6, large prime descent (`mondrian_large_prime_descent`) would produce a perfect partition of the square of side 6. However, `mondrian_no_perfect_six` shows that no such partition exists for side 6, completing the contradiction.

  1. Assume, for contradiction, that the square of side 6 * p ^ e has a perfect partition.

    We assume the negation of the theorem statement, introducing the hypothesis that there exists an admissible partition P of the square of side 6 * p ^ e having defect 0.

    line 4

      intro hP
  2. This contradicts the known impossibility of a perfect partition for side 6.

    Applying the descent theorem `mondrian_large_prime_descent` with base side c = 6, prime p, and exponent e (with the condition 0 < 6 verified by direct computation via `decide`), the assumed partition yields a perfect partition of the square of side 6. But `mondrian_no_perfect_six` states that side 6 has no such partition, yielding False and completing the proof.

    lines 5–6

    uses mondrian_no_perfect_six, mondrian_large_prime_descent

      exact mondrian_no_perfect_six
        (mondrian_large_prime_descent 6 p e (by decide) hp hpc hP)
mondrian_no_perfect_six
There is no admissible partition of a square of side length 6 with defect zero.
mondrian_large_prime_descent
For any positive integer c and any prime p > c, if a square of side c * p ^ e admits a perfect partition, then so does a square of side c.

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

theorem mondrian_no_perfect_six_mul_prime_pow (p e : ℕ)    (hp : Nat.Prime p) (hpc : 6 < p) :    ¬ ∃ P, mondrian_is_partition (6 * p ^ e) P ∧ mondrian_defect P = 0 := by  intro hP  exact mondrian_no_perfect_six    (mondrian_large_prime_descent 6 p e (by decide) hp hpc hP)
See it in the graphDiscuss this resultChallenge it