qedbot

Erdős·erdos:274

Erdős Problem 274

conjecture formal record: mixed source: open F3 anchored

Machine-checked by Palomar.

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

group theory, covering systems·Source

AI activity

How grades work

No AI contribution recorded against this statement.

Claimed on erdosproblems.com

1

Proof claims posted on erdosproblems.com, which says that listing a claim “is no guarantee of proof correctness”. The register records who claims what, with which systems, and links to each claim there. Nobody has examined them, and none counts in the register's totals.

Rio Itabe

a partial proof claimed·17 Aug 2026·using GPT-5.6 (ChatGPT Pro and OpenAI Codex)

Proof·Formalisation at commit 40865c8c79c3

candidateA? V0

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

Anchored to google-deepmind/formal-conjectures/blob/main/FormalConjectures/ErdosProblems/274.lean

declares divergences from its source reviewed by an agent

Checks

1
  • verified·Palomar

    Registered by Palomar at d701decf: Comparator confirmed 2 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-02·commit d701decf37c2

    PALOMAR-2026-10-02-000004

Declared by the projects

1

As each project's formalization.yaml states it.

The Herzog–Schönheim conjecture for solvable groupsJostamon/erdos274-hs-solvable · joined by anchor · Palomar

Read formalization.yaml

authors
Murali Menon
method
agent — Claude Fable 5, Claude Opus 5, Claude Opus 5.5, Claude Sonnet 5.5, GPT-5.6 Sol, GPT-6-Luna
review
agent-reviewed (GPT-5.6 Sol (paper review), Qwen3.8-Max (paper review))
axioms
Classical.choice, Quot.sound, propext
sorry
0 unproved goals declared
results
2 main results named, checked with Comparator, with an alignment table
sources
The Herzog–Schönheim conjecture for solvable groups — other; The Herzog–Schönheim conjecture (original statement, 1974) — background; Groups covered by finitely many cosets — background; Remark on the multiplicity of a partition of a group into cosets — background
divergences
The Challenge restates the upstream `Erdos274.Group.ExactCovering` structure verbatim (same field names, types and order) rather than importing it, so that the Challenge needs only Mathlib. The three compared theorems have the hypotheses and conclusions of upstream `herzog_schonheim` and `erdos_274` plus `[Group.IsSolvable G]`; the unused `hG` hypothesis is kept to match upstream. The accompanying paper is not bundled in this repository.
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 · 3
  • https://www.erdosproblems.com/274
  • https://github.com/google-deepmind/formal-conjectures/blob/main/FormalConjectures/ErdosProblems/274.lean
  • FormalConjectures/ErdosProblems/274.lean

Cite this record

qed.bot, “Erdős Problem 274”, https://qed.bot/s/erdos-274, as of 20 Nov 2026.

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