Skip to content

audit(erdos-161): mark clean (cycle 4) — F^(t)(n,α) jump axiomatization integrity verified#21509

Closed
rjwalters wants to merge 0 commit into
mainfrom
audit/erdos-161-clean-cycle4-2026-05-31
Closed

audit(erdos-161): mark clean (cycle 4) — F^(t)(n,α) jump axiomatization integrity verified#21509
rjwalters wants to merge 0 commit into
mainfrom
audit/erdos-161-clean-cycle4-2026-05-31

Conversation

@rjwalters
Copy link
Copy Markdown
Owner

Summary

  • Re-audit of Erdős Problem Wiedijk #65: Isosceles Triangle Theorem #161 (Almost Monochromatic Subsets in Hypergraph Colorings).
  • Lean source matches meta.json on every counter (4 axioms, 0 sorries, 2 theorems, 8 definitions, 158 lines).
  • No narrative-failure-mode flags: title flags SOLVED-for-t=3, description discloses Conlon-Fox-Sudakov axiomatization, assumptions enumerates the four axioms, originalContributions labels axioms as axioms.

Verification

Check meta.json Lean source
Sorries 0 0 ✓
Axioms 4 4 ✓ (F, erdos_spencer_lower_bound, F3_characterization, one_jump_for_t3)
Theorems 2 2 ✓ (alpha_positive_growth, erdos_161_summary)
Definitions 8 8 ✓
Lines 158 158 ✓
True stubs n/a none ✓
Status / Badge axiomatized / axiom matches Tier C scaffold ✓

Test plan

  • meta.json counts vs. Lean source
  • No True-stub theorems
  • Narrative failure modes (delegation opacity, axiom masking, inequality≠theorem, pipeline inflation, hidden imports) all negative

🤖 Generated with Claude Code

rjwalters added a commit that referenced this pull request May 31, 2026
…tion integrity verified (#21512)

Re-audited Erdős Problem #155 (Slow Growth of Maximum Sidon Subsets).
Lean source (Proofs/Erdos155Problem.lean) matches meta.json:

- 1 axiom (erdos_turan_upper) — encoding the Erdős–Turán/Lindström upper
  bound F(N) ≤ √N + N^(1/4) + 1; matches meta axiomCount: 1
- 0 sorries (matches meta sorries: 0)
- 10 theorems (empty_mem_sidonSets, sidonSets_nonempty, maxSidon_achievable,
  maxSidon_optimal, maxSidon_monotone, maxSidon_step, increase_count_le,
  maxSidonSize_1, maxSidonSize_2, maxSidonSize_3) — matches theoremCount: 10
- 3 definitions (IsSidonSet, sidonSets, maxSidonSize) — matches definitionCount: 3
- 199 lines — matches lineCount: 199
- status=axiomatized / badge=axiom (Tier C) — main conjecture F(N+k) ≤ F(N)+1
  remains OPEN, and the Erdős–Turán upper bound supporting the proof toolkit
  is honestly axiomatized

Narrative checks pass: title and description explicitly mark the conjecture
"Status: OPEN"; proofStrategy enumerates which results are axiomatized vs
proved vs docstring-only; assumptions field declares "1 axiom: erdos_turan_upper.
0 sorries." No delegation opacity, axiom masking, inequality-as-theorem,
pipeline inflation, or 0-sorries-with-hidden-imports failure modes detected.

Sibling skip note: erdos-161 (also priority-top in queue) was skipped because
PR #21509 already covers its cycle 4 tracker bump.

Co-authored-by: Robb Walters <r.j.walters@gmail.com>
Co-authored-by: Claude Opus 4.7 <noreply@anthropic.com>
@rjwalters rjwalters closed this May 31, 2026
@rjwalters rjwalters force-pushed the audit/erdos-161-clean-cycle4-2026-05-31 branch from 0678f76 to 7513dbf Compare May 31, 2026 17:47
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

1 participant