{"schema_version":"source-reader-v1","record":{"source_id":"feige-conjecture-lean","versions":[{"work":{"authors":["Guanyang Wang","Peng Zhang"],"kind":"research_project","publication":"project","publication_note":"Public formal source; execution and statement correspondence are separate checks.","ai_role":"self_reported","ai_note":"The project credits GPT-5.6 Sol Codex for formalization. This is a different contribution from the July discovery model. Authors report verification; OpenMath has not executed it.","artifacts":[{"kind":"formal_code","title":"Lean proof of the sharp unit-slack Feige bound — pinned source","url":"https://github.com/pengzhang91/Feige/blob/19c61d6cb556d1e967dbb0ada9f293c290837867/Solution.lean","version":"19c61d6cb556d1e967dbb0ada9f293c290837867","assessment":"not_executed","note":"Exact source inspected; OpenMath has not executed this formal proof project.","sha256":"61807ad8500eca72545c86ad34ae2e3569bff83f713d1251b97b19b59e425ec1"}]},"id":"feige-conjecture:source:lean:v1","source_id":"feige-conjecture-lean","title":"Lean proof of the sharp unit-slack Feige bound","owner":"Guanyang Wang, Peng Zhang","url":"https://github.com/pengzhang91/Feige/blob/19c61d6cb556d1e967dbb0ada9f293c290837867/Solution.lean","subject_scope":"The headline theorem asserts optimality of (n/(n+1))^n for every positive finite n in the strict unit-slack event.","revision":"19c61d6cb556d1e967dbb0ada9f293c290837867","content_sha256":"61807ad8500eca72545c86ad34ae2e3569bff83f713d1251b97b19b59e425ec1","update_method":"Compare the exact source and publish a new immutable curation revision.","identifier_policy":"Stable source identity with exact versioned passages.","observed_on":"2026-10-13","source_updated_on":null,"rights":"metadata-link","license":"Original source license and document rights apply.","terms_url":"https://github.com/pengzhang91/Feige/blob/19c61d6cb556d1e967dbb0ada9f293c290837867/Solution.lean","attribution":"Guanyang Wang, Peng Zhang","rights_note":"OpenMath supplies its own mathematical paraphrases and links; proof text is not republished.","check_interval_days":90}],"entries":[{"id":"feige-conjecture:entry:lean:v1","source_version_id":"feige-conjecture:source:lean:v1","item_id":"lean","url":"https://github.com/pengzhang91/Feige/blob/19c61d6cb556d1e967dbb0ada9f293c290837867/Solution.lean","wording":"The headline theorem asserts optimality of (n/(n+1))^n for every positive finite n in the strict unit-slack event.","wording_kind":"paraphrase","locator":"PalomarFeige.sharp_unit_slack_feige_complete; README and formalization metadata","supersedes":null}],"problems":[{"slug":"feige-conjecture","title":"Feige’s probability conjecture","publication_version":7}],"selected_version_id":"feige-conjecture:source:lean:v1","available_versions":[{"id":"feige-conjecture:source:lean:v1","revision":"19c61d6cb556d1e967dbb0ada9f293c290837867","observed_on":"2026-10-13","title":"Lean proof of the sharp unit-slack Feige bound","publication":"project","content_sha256":"61807ad8500eca72545c86ad34ae2e3569bff83f713d1251b97b19b59e425ec1","used_in_current_publications":true}],"usages":[{"id":"source-use-e8abd844dec2bd322146","entry_id":"feige-conjecture:entry:lean:v1","problem":{"slug":"feige-conjecture","title":"Feige’s probability conjecture","publication_version":7},"kind":"assessment","title":"Unit-slack optimality reported complete in Lean","claim":{"id":"claim-feige-sharp-finite-unit-slack","version":1,"slug":"feige-sharp-finite-unit-slack","title":"The optimal bound for a fixed number of variables"},"fragment":"claim-feige-sharp-finite-unit-slack","assessment":{"id":"feige-conjecture:report:unit-lean:v1","entry_id":"feige-conjecture:entry:lean:v1","state":"resolved","source_label":"Unit-slack optimality reported complete in Lean","scope":"The pinned source targets δ = 1 only; no general-δ formal proof is attributed to it.","source_date":null,"observed_on":"2026-10-13","evidence_url":"https://github.com/pengzhang91/Feige/blob/19c61d6cb556d1e967dbb0ada9f293c290837867/Solution.lean","supersedes":null},"superseded":false,"formalization":null,"update":null},{"id":"source-use-c5691944527566aaf44d","entry_id":"feige-conjecture:entry:lean:v1","problem":{"slug":"feige-conjecture","title":"Feige’s probability conjecture","publication_version":7},"kind":"bound","title":"Unit-slack probability","claim":{"id":"claim-feige-sharp-finite-unit-slack","version":1,"slug":"feige-sharp-finite-unit-slack","title":"The optimal bound for a fixed number of variables"},"fragment":"claim-feige-sharp-finite-unit-slack","assessment":null,"superseded":false,"formalization":null,"update":null},{"id":"source-use-ce417985b7cec7b1faa8","entry_id":"feige-conjecture:entry:lean:v1","problem":{"slug":"feige-conjecture","title":"Feige’s probability conjecture","publication_version":7},"kind":"construction","title":"A finite-dimensional extremizer","claim":{"id":"claim-feige-sharp-finite-unit-slack","version":1,"slug":"feige-sharp-finite-unit-slack","title":"The optimal bound for a fixed number of variables"},"fragment":"claim-feige-sharp-finite-unit-slack","assessment":null,"superseded":false,"formalization":null,"update":null},{"id":"source-use-39fd77b7f77e1c61bd93","entry_id":"feige-conjecture:entry:lean:v1","problem":{"slug":"feige-conjecture","title":"Feige’s probability conjecture","publication_version":7},"kind":"formalization","title":"Sharp finite-dimensional Feige inequality","claim":{"id":"claim-feige-sharp-finite-unit-slack","version":1,"slug":"feige-sharp-finite-unit-slack","title":"The optimal bound for a fixed number of variables"},"fragment":"claim-feige-sharp-finite-unit-slack","assessment":null,"superseded":false,"formalization":{"title":"Sharp finite-dimensional Feige inequality","url":"https://github.com/pengzhang91/Feige/blob/19c61d6cb556d1e967dbb0ada9f293c290837867/Solution.lean","note":"Lean 4 proof reports complete fixed-n optimality for δ = 1. It does not certify the July δ-dependent theorem or Ling’s Samuels proposal. Source definitions quantify over measurable, integrable, pointwise nonnegative independent variables on probability spaces.","target":{"id":"claim-feige-sharp-finite-unit-slack","version":1},"proof_status":"reported_complete","source_entry_ids":["feige-conjecture:entry:lean:v1"],"declaration":"PalomarFeige.sharp_unit_slack_feige_complete","source_commit":"19c61d6cb556d1e967dbb0ada9f293c290837867","alignment":"staff_linked","checked_on":"2026-10-13"},"update":null},{"id":"source-use-adc67011296870a4a39d","entry_id":"feige-conjecture:entry:lean:v1","problem":{"slug":"feige-conjecture","title":"Feige’s probability conjecture","publication_version":7},"kind":"milestone","title":"Unit-slack optimality has a public Lean proof","claim":null,"fragment":"history","assessment":null,"superseded":false,"formalization":null,"update":null},{"id":"source-use-c63a55d6cb32bce62ecd","entry_id":"feige-conjecture:entry:lean:v1","problem":{"slug":"feige-conjecture","title":"Feige’s probability conjecture","publication_version":7},"kind":"question","title":"Feige’s probability conjecture","claim":null,"fragment":"question","assessment":null,"superseded":false,"formalization":null,"update":null},{"id":"source-use-54d9d50ed510704e8311","entry_id":"feige-conjecture:entry:lean:v1","problem":{"slug":"feige-conjecture","title":"Feige’s probability conjecture","publication_version":7},"kind":"reading","title":"Inspect the formal statement, assumptions and reported checks.","claim":null,"fragment":"provenance","assessment":null,"superseded":false,"formalization":null,"update":null},{"id":"source-use-d2cffc24dd5a5c91e706","entry_id":"feige-conjecture:entry:lean:v1","problem":{"slug":"feige-conjecture","title":"Feige’s probability conjecture","publication_version":7},"kind":"statement","title":"The optimal bound for a fixed number of variables","claim":{"id":"claim-feige-sharp-finite-unit-slack","version":1,"slug":"feige-sharp-finite-unit-slack","title":"The optimal bound for a fixed number of variables"},"fragment":"claim-feige-sharp-finite-unit-slack","assessment":null,"superseded":false,"formalization":null,"update":null}],"linked_entries":[{"id":"feige-conjecture:entry:lean:v1","source_version_id":"feige-conjecture:source:lean:v1","item_id":"lean","url":"https://github.com/pengzhang91/Feige/blob/19c61d6cb556d1e967dbb0ada9f293c290837867/Solution.lean","wording":"The headline theorem asserts optimality of (n/(n+1))^n for every positive finite n in the strict unit-slack event.","wording_kind":"paraphrase","locator":"PalomarFeige.sharp_unit_slack_feige_complete; README and formalization metadata","supersedes":null}],"linked_sources":[{"work":{"authors":["Guanyang Wang","Peng Zhang"],"kind":"research_project","publication":"project","publication_note":"Public formal source; execution and statement correspondence are separate checks.","ai_role":"self_reported","ai_note":"The project credits GPT-5.6 Sol Codex for formalization. This is a different contribution from the July discovery model. Authors report verification; OpenMath has not executed it.","artifacts":[{"kind":"formal_code","title":"Lean proof of the sharp unit-slack Feige bound — pinned source","url":"https://github.com/pengzhang91/Feige/blob/19c61d6cb556d1e967dbb0ada9f293c290837867/Solution.lean","version":"19c61d6cb556d1e967dbb0ada9f293c290837867","assessment":"not_executed","note":"Exact source inspected; OpenMath has not executed this formal proof project.","sha256":"61807ad8500eca72545c86ad34ae2e3569bff83f713d1251b97b19b59e425ec1"}]},"id":"feige-conjecture:source:lean:v1","source_id":"feige-conjecture-lean","title":"Lean proof of the sharp unit-slack Feige bound","owner":"Guanyang Wang, Peng Zhang","url":"https://github.com/pengzhang91/Feige/blob/19c61d6cb556d1e967dbb0ada9f293c290837867/Solution.lean","subject_scope":"The headline theorem asserts optimality of (n/(n+1))^n for every positive finite n in the strict unit-slack event.","revision":"19c61d6cb556d1e967dbb0ada9f293c290837867","content_sha256":"61807ad8500eca72545c86ad34ae2e3569bff83f713d1251b97b19b59e425ec1","update_method":"Compare the exact source and publish a new immutable curation revision.","identifier_policy":"Stable source identity with exact versioned passages.","observed_on":"2026-10-13","source_updated_on":null,"rights":"metadata-link","license":"Original source license and document rights apply.","terms_url":"https://github.com/pengzhang91/Feige/blob/19c61d6cb556d1e967dbb0ada9f293c290837867/Solution.lean","attribution":"Guanyang Wang, Peng Zhang","rights_note":"OpenMath supplies its own mathematical paraphrases and links; proof text is not republished.","check_interval_days":90}]}}