logic-foundations / Computability; Hilbert's tenth problem

Matiyasevich's single-fold conjecture: every r.e. set has a single-fold Diophantine representation

Theorem 1.1: every r.e. S⊆NnS\subseteq\mathbb N^n, n≥1n\ge1, has a polynomial P∈Z[A1..An,W1..Wm]P\in\mathbb Z[A_1..A_n,W_1..W_m] with #{w∈Nm:P(a,w)=0}\#\{w\in\mathbb N^m:P(a,w)=0\} equal to 1 for a∈Sa\in S and 0 otherwise. Hence the finite-fold conjecture holds, and Diophantine solvability over N\mathbb N stays undecidable under an at-most-one-solution promise (Section 8). The construction bounds a Pell-type exponential with a cutoff from rational points on a rank-one elliptic curve. Witnesses range over N\mathbb N; the paper does not claim the analogue over Z\mathbb Z beyond what follows from it, nor any bound on degree or number of variables.

42Significance / 100
1Frontier events
0Verification tasks
0Recorded attempts

Temporal state

Current frontier

No reconciled state yet.

Append-only history

Frontier timeline

logic-foundationsSep 24, 2026Significance 42/100Registry: lean checked

Matiyasevich's single-fold conjecture: every r.e. set has a single-fold Diophantine representation

Prior state unknown→proved

Theorem 1.1: every r.e. S⊆NnS\subseteq\mathbb N^n, n≥1n\ge1, has a polynomial P∈Z[A1..An,W1..Wm]P\in\mathbb Z[A_1..A_n,W_1..W_m] with #{w∈Nm:P(a,w)=0}\#\{w\in\mathbb N^m:P(a,w)=0\} equal to 1 for a∈Sa\in S and 0 otherwise. Hence the finite-fold conjecture holds, and Diophantine solvability over N\mathbb N stays undecidable under an at-most-one-solution promise (Section 8). The construction bounds a Pell-type exponential with a cutoff from rational…

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review

Research memory

Claims and attempts

Scoped claims

Source authenticated

Theorem 1.1: every r.e. S⊆NnS\subseteq\mathbb N^n, n≥1n\ge1, has a polynomial P∈Z[A1..An,W1..Wm]P\in\mathbb Z[A_1..A_n,W_1..W_m] with #{w∈Nm:P(a,w)=0}\#\{w\in\mathbb N^m:P(a,w)=0\} equal to 1 for a∈Sa\in S and 0 otherwise. Hence the finite-fold conjecture holds, and Diophantine solvability over N\mathbb N stays undecidable under an at-most-one-solution promise (Section 8). The construction bounds a Pell-type exponential with a cutoff from rational points on a rank-one elliptic curve. Witnesses range over N\mathbb N; the paper does not claim the analogue over Z\mathbb Z beyond what follows from it, nor any bound on degree or number of variables.

Theorem 1.1: every r.e. S⊆NnS\subseteq\mathbb N^n, n≥1n\ge1, has a polynomial P∈Z[A1..An,W1..Wm]P\in\mathbb Z[A_1..A_n,W_1..W_m] with #{w∈Nm:P(a,w)=0}\#\{w\in\mathbb N^m:P(a,w)=0\} equal to 1 for a∈Sa\in S and 0 otherwise. Hence the finite-fold conjecture holds, and Diophantine solvability over N\mathbb N stays undecidable under an at-most-one-solution promise (Section 8). The construction bounds a Pell-type exponential with a cutoff from rational points on a rank-one elliptic curve. Witnesses range over N\mathbb N; the paper does not claim the analogue over Z\mathbb Z beyond what follows from it, nor any bound on degree or number of variables.

Recorded attempts

Evidence graph

Connected research record