Take this check

Compare the formal theorem and definitions with the informal n = 8 claim.

2026-evanbeller-erdos-132 · task erdos-132-lean-correspondence

Task type: statement audit
Entry points: formalization/ and the n = 8 theorem in the PDF
Source PDF: Download the exact manuscript
Erdős Problem #132, n = 8 proof writeup · version 5d3faea03531…
Effort: about 60 minutes (estimated by significance-editor)
Prerequisites: Lean 4 and the repository's formalization directory

Status

Open.

How to do this

Download the exact manuscript above and start with the stated entry points. The version hash identifies the file for the eventual record; you do not need to calculate it before reading.
Read or reproduce only the stated scope and note the method you actually used.
Submit what you found through the linked attestation form below, using the record, task, scope, and manuscript hash shown here. No Significance account is required; GitHub may ask you to sign in.

Open attestation form

Attestation template

Fill only what you did. State what you checked and found—not whether the whole proof is correct.

id: att-erdos-132-lean-correspondence
task_id: erdos-132-lean-correspondence
reviewer: '[your name or handle]'
scope: Compare the formal theorem and definitions with the informal n = 8 claim.
manuscript_sha256: 
  5d3faea03531035426c9f5ca8ece9c8db90ff2cdaff4238f3eb1090747c5b209
asserted_at: '[YYYY-MM-DDTHH:MM:SSZ]'
method: '[what you actually did: read / rederived / rebuilt / compared]'
finding: '[what you checked and found about exactly this scope]'
limits: '[what you did not check — optional but encouraged]'