Problem packetWorkR1137
[#R1137] Resolve the stated acceptance condition
1Summary
Prove that for every \(\eta>0\) there is \(N_0\) such that \(\Pr(f_n\text{ is irreducible over }\mathbb Q)>1-\eta\) for every \(n\ge N_0\).
Target the displayed statement directly. Prove that for every \(\eta>0\) there is \(N_0\) such that \(\Pr(f_n\text{ is irreducible over }\mathbb Q)>1-\eta\) for every \(n\ge N_0\). Preserve exact hypotheses, source locators, and any finite certificates so later work can distinguish a full resolution from partial progress.
Reported evidence. Replay readiness: source only.
2Outcome
A verification source is cited. This record has no executable replay attached.
Verification source: mathoverflow.net ↗, Editorial research route recorded 2026-07-31
3How it connects
Addresses
- claim
Recorded for
- problem
4Agent packet
A compact handoff with the evidence boundary, replay manifest, and relation pointers.
View structured packet
{
"schema": "theoremdb-agent-record-v1",
"ref": "R1137",
"content_hash": null,
"slug": "random-littlewood-irreducibility-limit-attempt-resolution-route",
"type": "attempt",
"title": "Resolve the stated acceptance condition",
"summary": "Prove that for every \\(\\eta>0\\) there is \\(N_0\\) such that \\(\\Pr(f_n\\text{ is irreducible over }\\mathbb Q)>1-\\eta\\) for every \\(n\\ge N_0\\).",
"relevance": "For Irreducibility probability for random Littlewood polynomials, record random-littlewood-irreducibility-limit-attempt-resolution-route (“Resolve the stated acceptance condition”) documents a concrete method, search boundary, or failed route. The record states: Prove that for every \\(\\eta>0\\) there is \\(N_0\\) such that \\(\\Pr(f_n\\text{ is irreducible over }\\mathbb Q)>1-\\eta\\) for every \\(n\\ge N_0\\).",
"relevance_source": "recorded",
"body": "Target the displayed statement directly. Prove that for every \\(\\eta>0\\) there is \\(N_0\\) such that \\(\\Pr(f_n\\text{ is irreducible over }\\mathbb Q)>1-\\eta\\) for every \\(n\\ge N_0\\). Preserve exact hypotheses, source locators, and any finite certificates so later work can distinguish a full resolution from partial progress.",
"status": "open_strategy",
"evidence_grade": "self_reported",
"scope": null,
"reproduction": {
"schema": "theoremdb-reproduction-v1",
"readiness": "source_only",
"kind": "attempt",
"citation": {
"url": "https://mathoverflow.net/questions/7969/irreducible-polynomials-with-constrained-coefficients",
"locator": "Editorial research route recorded 2026-07-31"
},
"missing": [
"source",
"command",
"runtime",
"expected_output"
]
},
"formal_statement": null,
"source": {
"url": "https://mathoverflow.net/questions/7969/irreducible-polynomials-with-constrained-coefficients",
"locator": "Editorial research route recorded 2026-07-31"
},
"models": [],
"relations": [
{
"slug": "R1138",
"title": "Current status and unresolved remainder",
"object_type": "claim",
"relation": "addresses",
"direction": "outgoing"
},
{
"slug": "random-littlewood-irreducibility-limit",
"title": "random littlewood irreducibility limit",
"object_type": "problem",
"relation": "recorded_for",
"direction": "outgoing"
}
]
}5Provenance
View source, identifiers, and projection details
- Project
- random-littlewood-irreducibility-limit-source-review
- Locator
- Editorial research route recorded 2026-07-31
- License
- CC0-1.0
- Contributors
- TheoremDB maintainers
- Source
- mathoverflow.net ↗
- Public record
- R1137
- Stable alias
- random-littlewood-irreducibility-limit-attempt-resolution-route
- Projection
- Reproduction fields are derived from the immutable record.
A route someone took, recorded so the next person can reuse it or avoid it.