Alphabeta Math
CorollaryStatement: Literature-sourcedProof: 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 meets a degree-d curve in d points counted with multiplicity

Statement

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

Let L be a line and C a plane projective curve of degree d over the algebraically closed field k with L⊈C. Then L∩C consists of at most d points and

∑p∈L∩CIp(C,L)=d.

Equivalently, if F∣L is the restriction of a defining form of C to L≅P1, a nonzero binary form of degree d, then Ip(C,L) is the multiplicity of the corresponding root of F∣L, and the roots counted with multiplicity exhaust d.

Facts & Assumptions

Given: AC The Axiom of Choice, a line L=V(ℓ) and a plane projective curve C=V(F) of degree d over the algebraically closed field k, with L⊈C.

[F1]

L is a plane projective curve of degree one, and L,C have no common component; so Bezout applies to the pair and gives ∑p∈L∩CIp(C,L)=d⋅1=d, the sum being finite Plane projective curves and their components, degree projective hypersurface, Bezout's theorem for plane projective curves.

[F2]

The restriction F∣L is a nonzero binary form of degree d on L≅P1 (nonzero because L⊈C), and Ip(C,L) equals the order of vanishing of F∣L at the point corresponding to p Intersection with a line is the order of vanishing of the restricted equation, projective space points, standard projective opens are affine spaces.

[F3]

A nonzero binary form of degree d over an algebraically closed field is a product of d linear forms, so the multiplicities of its distinct roots sum to d by additivity of degree over products Tangent cone and tangent lines at a point (Remarks, binary-form factorisation); the homogeneous-product degree calculation there gives the count.

Proof

1.1F1givenalgebra

By [F1] the intersection is finite and the multiplicities satisfy ∑p∈L∩CIp(C,L)=d. Each summand is a positive integer precisely at the points of L∩C Symmetry, additivity and local nature of intersection multiplicity, so the number of distinct contact points is at most d.

2.1F2F3given

By [F2] each Ip(C,L) equals the root multiplicity of F∣L at the corresponding point, and by [F3] the distinct root multiplicities of the nonzero binary form F∣L sum to d, in agreement with step 1.1.

3.1step 1.1step 2.1∎

Combining steps 1.1 and 2.1 gives both the bound on the number of points and the displayed identity; the equivalent root-multiplicity formulation is exactly the identification of step 2.1.

Depends on

Used by

Dependency tree · two levels

53 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