qedbot

Wikipedia·wikipedia:Catalan

Catalan's conjecture and related Diophantine equations

conjecture formal record: mixed F3 anchored

Machine-checked by Palomar.

Fidelity F3: The project checks its proof with Comparator against a statement from the Wikipedia collection of a corpus written separately from the proof, and held here.

Source

AI activity

How grades work

No AI contribution recorded against this statement.

F3 anchored. The project checks its proof with Comparator against a statement from the Wikipedia collection of a corpus written separately from the proof, and held here.

Anchored to google-deepmind/formal-conjectures/blob/main/FormalConjectures/Wikipedia/Catalan.lean

declares divergences from its source reviewed by an agent source authors not contacted

Checks

1
  • verified·Palomar

    Registered by Palomar at 597469e8: Comparator confirmed 4 theorems prove the recorded statement within Palomar's axiom policy, replayed through Lean's kernel and the independent nanoda kernel

    project registered at a pinned commit·2026-10-06·commit 597469e8eba9

    PALOMAR-2026-10-06-000009

Declared by the projects

1

As each project's formalization.yaml states it.

A Lean 4 formalization of Catalan's conjecture (Mihăilescu's theorem)cadamcat/catalan-lean4 · joined by anchor · Palomar

Read formalization.yaml

authors
Yao Xu
method
agent — Claude Fable 5.1, Claude Opus 5, GPT-5.6 Luna, GPT-6 Astra, GPT-6 Luna, GPT-6 Pro
review
agent-reviewed
axioms
Classical.choice, Quot.sound, propext
sorry
0 unproved goals declared
results
4 main results named, checked with Comparator, with an alignment table
sources
Primary cyclotomic units and a proof of Catalan's conjecture — formalizes, authors not-contacted; Catalan's conjecture (after Mihăilescu) — formalizes, authors not-contacted; Catalan without logarithmic forms (after Bugeaud, Hanrot and Mihăilescu) — formalizes, authors not-contacted; A class number free criterion for Catalan's conjecture — formalizes, authors not-contacted
divergences
None in the four registered statements. Catalan's conjecture is stated over the natural numbers with truncated subtraction, x ^ a - y ^ b = 1, exactly as in Formal Conjectures; with this hypothesis the equation forces x ^ a = y ^ b + 1. The consecutive-powers form Catalan.JSP.statement is proved but not registered here.
checked by
Palomar

Follow and discuss

All discussion

Discussion and bounties for this problem load here.

Something wrong or missing here? Request a correction or add a claim, with its sources.

Formal material

Formal statements · 1
Cited proofs · 1
Also known as · 2
  • https://github.com/google-deepmind/formal-conjectures/blob/main/FormalConjectures/Wikipedia/Catalan.lean
  • FormalConjectures/Wikipedia/Catalan.lean

Cite this record

qed.bot, “Catalan's conjecture and related Diophantine equations”, https://qed.bot/s/wikipedia-catalan, as of 20 Nov 2026.

This record as plain text, with each claim, its grades and its sources.