Prove BooneHigman (openai/math family 250: The Boone–Higman conjecture and higher finiteness) in Lean 4 with…
Prove BooneHigman (openai/math family 250: The Boone–Higman conjecture and higher finiteness) in Lean 4 with…: a task in openai/math as Harbor environments (Harbor dataset). Context: this statement belongs to family 250 of the release, The Boone–Higman conjecture and higher finiteness (Group…
The task
Context: this statement belongs to family 250 of the release, *The Boone–Higman conjecture and higher finiteness* (Group theory). The family as a whole: A finitely generated group has decidable word problem exactly when it embeds in a finitely presented simple group, proving the Boone–Higman conjecture. The target…
Part of raising-heart/openai-math.