Alphabeta Math
CounterexampleConstruction: Literature-sourcedVerification: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-06
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

The generic point of the affine line has no relative k-valued coordinate

Statement refuted

“Every point p of Ak1 is the kernel of a k-algebra map k[t]→k.”

Facts & Assumptions

Given: A field k and Ak1=Spec⁡k[t].

[F1]

The closure of a prime p in a prime spectrum is V(p) (Generic points of irreducible closed subsets).

Counterexample

technique · direct
1.1F1givenalgebra

If f,g∈k[t] are nonzero, the leading coefficient of fg is the nonzero product of their leading coefficients; hence k[t] is a domain and (0) is a point of Ak1. By [F1], its closure is all of Spec⁡k[t].

2.1step 1.1algebra

Evaluation at 0 identifies k[t]/(t) with the domain k, so (t) is prime and strictly contains (0). Thus the closure in step 1.1 is not a singleton, and (0) is not closed. quotient-domain criterion

3.1F1step 2.1algebra∎

A relative k-valued coordinate representing a point p is a [F1, step 2.1, algebra] k-algebra map k[t]→k whose kernel is p. Such a map fixes k, hence is surjective and has maximal kernel. By [F1] its closure is the set of primes containing it, which is the singleton consisting of that maximal ideal. Its kernel is therefore closed, whereas (0) is not, so the generic point (0) has no relative k-valued coordinate.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

24 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources