Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Observation 6 — the properties of Q₁₉

Proved
NQueensComp.NPC.observation_6

by mikedeng1 · Oct 24, 2026 · Mathlib 0df444a (Lean v4.33.1)

n-queensp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Observation 6. The set Q19Q_{19}Q19​ of Definition 5 satisfies:

  1. it is a solution to the 19-Queens problem;
  2. it has no queen on difference-diagonals 111, 000 or −1-1−1;
  3. for its queens (0,8)(0,8)(0,8) and (17,0)(17,0)(17,0) consider the squares (19,8)(19,8)(19,8) and (17,19)(17,19)(17,19): their sum-diagonals are not within 111 of each other, of (0,0)(0,0)(0,0) or of any queen of Q19Q_{19}Q19​, and the same holds for their difference-diagonals:
∣Σ(m)−Σ(p)∣>1,∣Δ(m)−Δ(p)∣>1(m∈{(19,8),(17,19)}, p∈Q19∪{(0,0)}),|\Sigma(m)-\Sigma(p)|>1,\quad |\Delta(m)-\Delta(p)|>1\qquad(m\in\{(19,8),(17,19)\},\ p\in Q_{19}\cup\{(0,0)\}),∣Σ(m)−Σ(p)∣>1,∣Δ(m)−Δ(p)∣>1(m∈{(19,8),(17,19)}, p∈Q19​∪{(0,0)}),

and ∣Σ(19,8)−Σ(17,19)∣>1|\Sigma(19,8)-\Sigma(17,19)|>1∣Σ(19,8)−Σ(17,19)∣>1, ∣Δ(19,8)−Δ(17,19)∣>1|\Delta(19,8)-\Delta(17,19)|>1∣Δ(19,8)−Δ(17,19)∣>1.

These are the properties of the 19-queens frame that the reduction of Definition 10 uses through Lemma 9.

Differences from the source:

  • reading: “their sum-/difference-diagonals are not within 1 of each other, (0, 0) or any queen in Q₁₉” → sum-diagonals are compared with sum-diagonals and difference-diagonals with difference-diagonals, each difference at least 2 in absolute value; reason: the “sum-/difference-” notation is used respectively throughout the paper (Lemma 9)
Preamble
import Mathlib
import Definitions.Def_NQueensComp_NPC_Queens
Formal statement
namespace NQueensComp.NPC

/-- Observation 6, p. 822: `Q₁₉` is a solution to the 19-Queens problem; it has no queen on
difference-diagonals `1, 0, −1`; for its queens `(0, 8)` and `(17, 0)` consider `(19, 8)` and
`(17, 19)`: their sum-diagonals (respectively difference-diagonals) are not within `1` of each
other, of `(0, 0)` or of any queen of `Q₁₉`. -/
theorem observation_6 :
    IsNQueensSol 19 Q19 ∧
    (∀ q ∈ Q19, diffDiag q ≠ 1 ∧ diffDiag q ≠ 0 ∧ diffDiag q ≠ -1) ∧
    ((0, 8) ∈ Q19 ∧ (17, 0) ∈ Q19) ∧
    (1 < |((sumDiag (19, 8) : ℕ) : ℤ) - ((sumDiag (17, 19) : ℕ) : ℤ)| ∧
      1 < |diffDiag (19, 8) - diffDiag (17, 19)|) ∧
    ∀ m ∈ ({(19, 8), (17, 19)} : Finset Queen), ∀ p ∈ insert ((0, 0) : Queen) Q19,
      1 < |((sumDiag m : ℕ) : ℤ) - ((sumDiag p : ℕ) : ℤ)| ∧
        1 < |diffDiag m - diffDiag p| := by sorry

end NQueensComp.NPC
Source
Gent, Jefferson & Nightingale, Complexity of n-Queens Completion, J. Artif. Intell. Res. 59 (2017), p. 822, Observation 6 (Definition 5)
Human review
  • Endorsed by Shuze Chen · Oct 24, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 24, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me