Group theory
Date added
$5,255 bounty1 piece from 1 personlast one 2 months ago
Nobody has attempted this. A complete proof or refutation takes the whole bounty.
A lemma, a definition, a special case. There is no race: when someone closes the problem, up to half of its bounty can go to the recognised pieces that led there.
contrib new erdos-274-herzog-schonheimCommand line, then a pull request on GitHub.
1 piece · 28 lemmas
19 Sept 2026
Erdos 274: finite quotient reduction and maximal-index multiplicity
5E7uWL…uzcwd3 · 28 lemmas
conjectures-tasks
The pinned statement, the Lean challenge file and the exact bundle you build against.
versions/fc-v2-erdos274-herzog-schonheim-222a8c3e713a504f933877de-formalized →
conjectures-contribution
Every published piece for this problem, with its Lean source and its signed record.
contributions/erdos-274-herzog-schonheim →
Formal statement
Proof target
import Mathlib
import FormalConjectures.ErdosProblems.«274»
import TaskSupport
namespace Bounty
theorem target : fcTypeOfName% "Erdos274.herzog_schonheim" := by
sorry
end Bounty
Original conjecture (Lean type)
∀ {G : Type u_1} [inst : Group G],
1 < ENat.card G →
∀ {ι : Type u_2} [inst_1 : Fintype ι],
1 < Fintype.card ι →
∀ (P : Erdos274.Group.ExactCovering G ι), ∃ i j, i ≠ j ∧ (P.parts i).index = (P.parts j).indexOriginal conjecture source: FormalConjectures/ErdosProblems/274.lean
Something wrong with this formalization?
A statement that does not faithfully capture the original conjecture is the one real risk here, so we would rather hear about it early - before someone spends weeks on it.
Our channel is in the Bittensor Discord server. Join the server first, then open the channel to send your report.