AFTD Auto-Formalizing Theoretical Domains

mondrian_pell_family_defect_280

theoremverifiedformalization

For n₀ = 315, n₁ = 106785, n_{j+2} = 340n_{j+1} − n_j: for every j the n_j×n_j square has a Mondrian partition into seven pairwise noncongruent integer rectangles with defect 280, and n_j ≡ 315 (mod 630).

Statement

theorem mondrian_pell_family_defect_280 (j : ℕ) :
    (∃ P, mondrian_is_partition (mondrian_pell_side j) P ∧ P.length = 7 ∧ mondrian_defect P = 280) ∧
      mondrian_pell_side j % 630 = 315
Formalizes
arXiv:2610.19193 (A Bounded-Defect Construction for the Mondrian Art Problem), Theorem 1.1 (the liminf consequence is stated separately as mondrian_liminf_min_defect_seven_le).
Verified
15 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 8
  • mondrian_pell_side_eqEach n_j equals 105 q_j for odd p_j, q_j with q_j < p_j < 7q_j and p_j² − 19 q_j² = −2, where (p₀, q₀) = (13, 3) and (p_{j+1}, q_{j+1}) =…
  • mondrian_pell_side_modEvery side length n_j of the family is ≡ 315 (mod 630).
  • mondrian_seven_rects_is_partitionFor positive integers p, q of the same parity with q < p < 7q, the seven rectangles R₁, …, R₇ have positive integer sides, partition the…
  • mondrian_seven_rects_defectWith E = p² − 19q², the defect of the seven-rectangle dissection is 140|E|.
  • mondrian_is_partitionAn admissible Mondrian partition of the n×n square: at least two axis-parallel rectangles with positive integer side lengths, with…
  • mondrian_defectThe defect def(P) = max_{R∈P} |R| − min_{R∈P} |R| of a family of rectangles.
  • mondrian_seven_rectsThe seven rectangles R₁, …, R₇ of the generic dissection of the n×n square, n = 105q, with a = 7(7q−p), b = 42q, c = 7(7q+p), d = 5(8q−p),…
  • mondrian_pell_sideThe side lengths n₀ = 315, n₁ = 106785, n_{j+2} = 340 n_{j+1} − n_j.
Used by 1

The proof, explained

The modular condition on the side length n_j ≡ 315 (mod 630) is established immediately by an existing lemma. To produce the partition, the side length is represented as n_j = 105q using parameters from a Pell-type equation p² − 19q² = −2 with q < p < 7q. An explicit seven-rectangle geometric configuration is then instantiated: its validity as a noncongruent partition is guaranteed by these bounds, and its defect evaluates to 140|p² − 19q²| = 140 × 2 = 280.

  1. The modular condition on the side length holds, reducing the theorem to constructing the required partition.

    The second conjunct, mondrian_pell_side j % 630 = 315, is resolved directly by the lemma mondrian_pell_side_mod, leaving only the existential claim for the 7-rectangle partition of defect 280.

    line 4

    uses mondrian_pell_side_mod

      refine ⟨?_, mondrian_pell_side_mod j⟩
  2. There exist odd integers p and q satisfying q < p < 7q, p² − 19q² = −2, n_j = 105q, and p ≡ q (mod 2).

    The lemma mondrian_pell_side_eq supplies parameters p and q satisfying the Pell-type equation p² − 19q² = −2, the side length relation n_j = 105q, and the bounds q < p < 7q. Since both p and q are odd, linear integer arithmetic (omega) establishes that they have identical parity.

    lines 5–6

    uses mondrian_pell_side_eq

      obtain ⟨p, q, hp1, hq1, hqp, hp7, hE, hn⟩ := mondrian_pell_side_eq j
      have hpar : p % 2 = q % 2 := by omega
  3. The list of rectangles mondrian_seven_rects p q is chosen as the candidate partition.

    We instantiate the existential witness with the explicit configuration mondrian_seven_rects p q. Unfolding its definition confirms it contains exactly seven rectangles, leaving two subgoals: verifying it partitions the n_j × n_j square and computing its defect.

    line 7

      refine ⟨mondrian_seven_rects p q, ?_, by simp [mondrian_seven_rects], ?_⟩
  4. The candidate rectangles form a valid Mondrian partition of the n_j × n_j square.

    Rewriting the side length n_j to 105q using the equality from the Pell parameters, the partition property follows from mondrian_seven_rects_is_partition, since p and q satisfy the required parity equality and bounds q < p < 7q.

    lines 8–9

    uses mondrian_seven_rects_is_partition

      · rw [hn]
        exact mondrian_seven_rects_is_partition p q hpar hqp hp7
  5. The defect of the partition is 280.

    By mondrian_seven_rects_defect, the defect of this configuration is 140|p² − 19q²|. Substituting p² − 19q² = −2 yields 140|−2| = 280, which simplifies by arithmetic (norm_num) and is cast from integers to natural numbers.

    lines 10–13

    uses mondrian_seven_rects_defect

      · have h := mondrian_seven_rects_defect p q hpar hqp hp7
        rw [hE] at h
        norm_num at h
        exact_mod_cast h
mondrian_pell_side_mod
For every j, the sequence side length satisfies n_j ≡ 315 (mod 630).
mondrian_pell_side_eq
For every j, there exist odd positive integers p and q such that q < p < 7q, p² − 19q² = −2, and n_j = 105q.
mondrian_seven_rects_is_partition
If p and q have the same parity and q < p < 7q, the seven rectangles defined by mondrian_seven_rects p q form a valid Mondrian partition of the (105q) × (105q) square into pairwise noncongruent rectangles.
mondrian_seven_rects_defect
If p and q have the same parity and q < p < 7q, the defect of the partition mondrian_seven_rects p q equals 140|p² − 19q²|.

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_pell_family_defect_280 (j : ℕ) :    (∃ P, mondrian_is_partition (mondrian_pell_side j) P ∧ P.length = 7 ∧ mondrian_defect P = 280) ∧      mondrian_pell_side j % 630 = 315 := by  refine ⟨?_, mondrian_pell_side_mod j⟩  obtain ⟨p, q, hp1, hq1, hqp, hp7, hE, hn⟩ := mondrian_pell_side_eq j  have hpar : p % 2 = q % 2 := by omega  refine ⟨mondrian_seven_rects p q, ?_, by simp [mondrian_seven_rects], ?_⟩  · rw [hn]    exact mondrian_seven_rects_is_partition p q hpar hqp hp7  · have h := mondrian_seven_rects_defect p q hpar hqp hp7    rw [hE] at h    norm_num at h    exact_mod_cast h
See it in the graphDiscuss this resultChallenge it