Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: AI-adaptedPipeline-generatedjudge pass (gpt-6.1-sol)
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 line and a conic meet in two points counted with multiplicity

Example

Assume the Axiom of Choice, inherited from the cited local-length, smoothness or Bezout suppliers.

Let C=V(x02−x1x2)⊆P2 over an algebraically closed field of characteristic not two and let L=V(x1−x2). Then L⊈C and L∩C={[1:1:1],[−1:1:1]}; both intersections are transversal, so Ip(C,L)=1 at each point and the total is 2=deg⁡C⋅deg⁡L.

Facts & Assumptions

Given: AC The Axiom of Choice, an algebraically closed field k of characteristic not two, the conic C=V(x02−x1x2), the line L=V(x1−x2), and the parametrisation (s:t)↦[s:t:t] of L.

[F1]

Viewed in k[x0,x1][x2], the polynomial x02−x1x2 is primitive (its two nonzero coefficients are coprime) and linear, hence irreducible over k(x0,x1) and over k[x0,x1] by Gauss lemma over a UFD, Every finite-variable polynomial ring over a field is a UFD, with prime irreducibles and principal height-one primes. Thus it is a square-free quadratic form, so C is a plane projective curve of degree two with no linear component; L is a line and L⊈C Plane projective curves and their components.

[F2]

Substituting the parametrisation into the defining form gives the binary quadratic s2−t2=(s−t)(s+t); its roots are [s:t]=[1:1] and [−1:1], corresponding to [1:1:1] and [−1:1:1], and both roots are simple Intersection with a line is the order of vanishing of the restricted equation.

[F3]

At each of the two points the gradients of x02−x1x2 and of x1−x2 are nonzero with distinct tangent directions, so the curves meet transversally and Ip(C,L)=1; the line-intersection count confirms the total 2 Transversal smooth curves meet with multiplicity one, A line meets a degree-d curve in d points counted with multiplicity, Local intersection multiplicity of two plane curves.

Verification

1.1F1F2given

The restrictions: substituting (s:t)↦[s:t:t] gives x02−x1x2↦s2−t2, so the intersection points of L with C are exactly [1:1:1] and [−1:1:1].

1.2F3algebra

At [1:1:1] the gradient of the conic is (2x0,−x2,−x1)=(2,−1,−1) and at [−1:1:1] it is (−2,−1,−1), both nonzero, while L is a line with constant gradient (0,1,−1); the tangent lines are distinct at both points, so each local multiplicity is 1.

2.1step 1.1step 1.2F2F3∎

The two simple roots account for the full degree total 2⋅1=2=de, in agreement with the line-intersection count; there are exactly two distinct intersection points and both are transversal.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

59 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