Problem packetResearch packetR1130
Current status and unresolved remainder
Link to a section
The record cites sources for its explanation.
Recorded status: reported
Recorded scope: No scope is recorded.
Originating problem: A polynomial bijection from the rational plane to the rational line
Authored record and scope
- Authored title
- Current status and unresolved remainder
- Record type
- claim
- Stored status
- reported
- Evidence grade
- sourced
2Authored explanation
UNKNOWN as of 2026-07-31. The MathOverflow thread has no accepted answer. Poonen gives a conditional polynomial injection, while Bresciani proves conditional nonexistence of a polynomial bijection under a weak Bombieri-Lang conjecture. The dated search found no unconditional resolution.
A complete resolution must satisfy this condition: Give an explicit polynomial \(F\in\mathbb Q[X,Y]\) and prove that every rational \(t\) has exactly one ordered rational preimage.
Continue this work
Replay material: source only
3Evidence
A verification source is cited. This record has no executable replay attached.
Verification source: mathoverflow.net ↗, See dataset.references[0] for the exact external source and locator.
4How it connects
Addressed by
- attempt
Recorded for
- problem
Cite this record
Cite the original sources separately.
Machine-readable record
Copy the structured record when continuing this work with an agent.
{
"schema": "theoremdb-agent-record-v1",
"ref": "R1130",
"content_hash": null,
"slug": "polynomial-bijection-q2-q-claim-status-20260731",
"type": "claim",
"title": "Current status and unresolved remainder",
"summary": "UNKNOWN as of 2026-07-31. The MathOverflow thread has no accepted answer. Poonen gives a conditional polynomial injection, while Bresciani proves conditional nonexistence of a polynomial bijection under a weak Bombieri-Lang conjecture. The dated search found no unconditional resolution. Give an explicit polynomial \\(F\\in\\mathbb Q[X,Y]\\) and prove that every rational \\(t\\) has exactly one ordered rational preimage.",
"relevance": "For polynomial bijection q2 q, pins the dated research frontier: UNKNOWN as of 2026-07-31. The MathOverflow thread has no accepted answer. Poonen gives a conditional polynomial injection, while Bresciani proves conditional nonexistence of a polynomial bijection under a weak Bombieri-Lang conjecture. The dated search found no unconditional resolution. Give an.",
"relevance_source": "recorded",
"body": "UNKNOWN as of 2026-07-31. The MathOverflow thread has no accepted answer. Poonen gives a conditional polynomial injection, while Bresciani proves conditional nonexistence of a polynomial bijection under a weak Bombieri-Lang conjecture. The dated search found no unconditional resolution.\n\nA complete resolution must satisfy this condition: Give an explicit polynomial \\(F\\in\\mathbb Q[X,Y]\\) and prove that every rational \\(t\\) has exactly one ordered rational preimage.",
"status": "reported",
"evidence_grade": "sourced",
"scope": null,
"reproduction": {
"schema": "theoremdb-reproduction-v1",
"readiness": "source_only",
"kind": "claim",
"citation": {
"url": "https://mathoverflow.net/questions/21003/polynomial-bijection-from-mathbb-q-times-mathbb-q-to-mathbb-q",
"locator": "See dataset.references[0] for the exact external source and locator."
},
"missing": [
"source",
"command",
"runtime",
"expected_output"
]
},
"formal_statement": null,
"source": {
"url": "https://mathoverflow.net/questions/21003/polynomial-bijection-from-mathbb-q-times-mathbb-q-to-mathbb-q",
"locator": "See dataset.references[0] for the exact external source and locator."
},
"models": [],
"relations": [
{
"slug": "R1129",
"title": "Resolve the stated acceptance condition",
"object_type": "attempt",
"relation": "addresses",
"direction": "incoming"
},
{
"slug": "polynomial-bijection-q2-q",
"title": "polynomial bijection q2 q",
"object_type": "problem",
"relation": "recorded_for",
"direction": "outgoing"
}
]
}6Provenance
View source, identifiers, and projection details
A statement this project treats as settled at the recorded evidence grade, with the work that backs it.