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 tangent line meets a conic with multiplicity two at one point

Example

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

Over an algebraically closed field k of characteristic not two, let C=V(x02−x1x2) and let L=V(x1) be the tangent line to C at p=[0:0:1]. Then L∩C={p} as a set, and substituting x1=0 leaves the restriction x02 with a double root at p, so Ip(C,L)=2 and the single point accounts for the full degree-two total.

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), and the point p=[0:0:1].

[F1]

The quadratic is primitive and linear in x2 over k[x0,x1], so Gauss lemma makes it irreducible and square-free Gauss lemma over a UFD, Every finite-variable polynomial ring over a field is a UFD, with prime irreducibles and principal height-one primes. Therefore C is a plane projective curve of degree two and L a line with L⊈C; p∈L∩C because x1(p)=0 and x0(p)2−x1(p)x2(p)=0 Plane projective curves and their components.

[F2]

The gradient of x02−x1x2 at p is (2x0,−x2,−x1)=(0,−1,0), nonzero, and the tangent line it defines is x1=0, i.e. TpC=L; so L is the tangent line of the conic at p Multiplicity one characterises smooth points with a unique tangent, Tangent cone and tangent lines at a point.

[F3]

Restricting the defining form to L: every point of L has x1=0, and the restriction is the binary form x02 in the coordinates (x0,x2), with a double root at [x0:x2]=[0:1], the point p. By the order-of-vanishing formula Ip(C,L) equals that root multiplicity Intersection with a line is the order of vanishing of the restricted equation, Local intersection multiplicity of two plane curves.

[F4]

The line-intersection count for the degree-two conic and the degree-one line gives ∑q∈L∩CIq(C,L)=2 A line meets a degree-d curve in d points counted with multiplicity.

Verification

1.1F1algebra

The set L∩C is exactly {p}: on L the equation becomes x02=0, so x0=0 and the point is [0:0:1].

1.2F2F3F4algebra

Since the restriction x02 has a double root at p, the order of vanishing is two, so Ip(C,L)=2 by [F3]; the value is consistent with the total 2 of [F4], the line being tangent at its unique intersection point.

2.1step 1.1step 1.2F4∎

The single point p with multiplicity two accounts for the full degree total 2=2⋅1, so tangency is exactly the phenomenon that distinct-point counting misses.

Depends on

Used by

Dependency tree · two levels

75 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