Alphabeta Math
ExampleConstruction: AI-adaptedVerification: AI-adaptedPipeline-generatedaudited 2026-09-27
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.

A tangent line and conic have one intersection point of local length two

Example

Assume the Axiom of Choice (The Axiom of Choice). Let k be any field, let F=x0x2−x12 (a conic) and G=x2 (a line) in k[x0,x1,x2], and let X=Proj⁡(k[x0,x1,x2]/(F,G)). Then X has exactly one point, P=[1:0:0]. Writing u=x1/x0 and v=x2/x0 on the chart x0≠0, the chart ring is k[u,v]/(v−u2,v)≅k[u]/(u2), the local algebra OX,P is this two-dimensional local k-algebra, its length is 2, the residue field is k with [κ(P):k]=1, and len⁡k(X)=2=deg⁡F⋅deg⁡G.

Facts & Assumptions

Given: The Axiom of Choice, a field k, the conic F=x0x2−x12 of degree 2, the line G=x2 of degree 1, the quotient S=k[x0,x1,x2]/(F,G) with its standard grading, and X=Proj⁡S with standard charts D+(xi)=Spec⁡(Ai) (Projective scheme of a homogeneous quotient and its standard affine charts).

[L1]

Points of X are the homogeneous primes p⊆S with S+⊈p; a chart D+(xi) is empty exactly when the localisation Sxi is the zero ring, and the point of the chart corresponding to p⊆Ai is the point of X it contracts from (Projective scheme of a homogeneous quotient and its standard affine charts, Prime and local-ring correspondence on standard projective charts).

[L2]

Assume AC. If x∈D+(xi) corresponds to the prime p0⊆Ai, then OX,x≅(Ai)p0, the chart ring being the quotient Ai≅k[y0,y1]/(fi,gi) of the polynomial ring in the two chart coordinates by the dehomogenised equations (Two coprime projective plane forms meet in total length equal to their degree product, Prime and local-ring correspondence on standard projective charts).

[L3]

Assume AC. The total length of the zero-dimensional X is len⁡k(X)=∑x∈XℓOX,x(OX,x)[κ(x):k], and for coprime plane forms of degrees d,e it equals de (Total length of a zero-dimensional projective scheme, Algebraic Bezout formula as a sum of local scheme lengths).

[L4]

The length of a module is the number of factors in a composition series, whose factors are simple modules (Composition series and length of a module, Simple module: a nonzero module with no proper nonzero submodule).

Verification

technique · direct
1.1

In S one has x2=0 and hence x12=x0x2=0, so x1,x2 are nilpotent in S and the localisations Sx1,Sx2 are the zero ring: the charts D+(x1) and D+(x2) are empty; moreover S≅k[x0,x1]/(x12) by x2↦0, whose only homogeneous prime not containing (x0,x1) is (x1), so X has exactly one point, namely the point P=[1:0:0] cut out by (x1,x2).

L1algebra
2.1

In the chart D+(x0) the dehomogenised equations are v−u2 and v with u=x1/x0, v=x2/x0, so A0≅k[u,v]/(v−u2,v)≅k[u]/(u2), and this is the chart through P by step 1.1; this ring has the unique prime (u) with A0/(u)≅k, so OX,P≅A0 and κ(P)=k, that is [κ(P):k]=1.

L2step 1.1
3.1

In A0=k[u]/(u2) the chain 0⊊(u)⊊A0 is a composition series: (u)=k⋅u is a simple module (it is annihilated by (u), so it is the simple A0-module k) and A0/(u)≅k is simple, so by [L4] the length is ℓOX,P(OX,P)=ℓA0(A0)=2.

L4step 2.1algebra
4.1

Since X has the single point P with local length 2 and residue degree 1, [L3] gives len⁡k(X)=2⋅1=2, which agrees with the Bezout value deg⁡F⋅deg⁡G=2⋅1=2 for the coprime forms F,G.

L3step 1.1step 2.1step 3.1algebra∎

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

55 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