Alphabeta Math
LemmaStatement: 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.

Curves without a common component meet finitely often

Statement

Assume the Axiom of Choice. Let C=V(F) and D=V(G) be plane projective curves over the algebraically closed field k with no common component. Then C∩D is nonempty and finite: after a projective change of coordinates putting [0:0:1] on neither curve, the intersection points project onto the finitely many zeros of the nonzero resultant Res⁡x2(F,G), with finitely many points over each zero. Equivalently, it consists of the finitely many points corresponding to the points of the zero-dimensional projective scheme X=Proj⁡(k[x0,x1,x2]/(F,G)) Projective scheme of a homogeneous quotient and its standard affine charts.

Facts & Assumptions

Given: AC, an algebraically closed field k, plane projective curves C=V(F), D=V(G) of degrees d,e≥1 with no common component.

[F1]

k is infinite: if k={a1,…,aq} were finite, then ∏i=1q(T−ai)+1 would be a nonconstant polynomial over k with no root in k An algebraically closed field: every nonconstant polynomial has a root in the field, Evaluation and roots of a polynomial in a commutative target ring, Field, Over an integral domain, degrees add under multiplication of nonzero polynomials.

[F2]

If a polynomial over k in several variables vanishes at every tuple of elements of the infinite subring k, then it is the zero polynomial A polynomial vanishing at every tuple from an infinite subdomain is the zero polynomial.

[F3]

A projective change of coordinates is given by a linear isomorphism of k3 defined up to scalars, it maps curves to curves and intersections to intersections, and it is a morphism of projective space with homogeneous coordinates morphism to projective space homogeneous coordinates, projective coordinate morphisms well defined, projective space points.

[F4]

For nonzero forms of positive degrees d,e with no common factor and with [0:0:1] on neither curve, the resultant Res⁡x2(F,G) is a nonzero form of degree de, and its value at (a,b)≠(0,0) vanishes exactly when [a:b:c]∈C∩D for some c; over each zero of the resultant the fibre of common points has at most min⁡(d,e) elements The resultant detects finitely many common projective points, Resultant of two plane forms, viewed in one variable.

[F5]

For nonzero plane forms with no common nonconstant factor, X=Proj⁡(k[x0,x1,x2]/(F,G)) is nonempty and zero-dimensional in the chartwise sense A plane intersection with no common component is nonempty and zero-dimensional; then X has finitely many points, every prime of each chart ring is maximal, and the points of X correspond to the maximal ideals of the chart rings A zero-dimensional projective scheme has finitely many closed points with finite-dimensional local rings, Prime and local-ring correspondence on standard projective charts. Over the algebraically closed field k, maximal ideals of the chart rings are evaluation ideals at points of the chart Over an algebraically closed field, every maximal ideal is an evaluation ideal.

[F6]

AC is assumed; it enters through the projective-scheme and Nullstellensatz suppliers above The Axiom of Choice.

[F7]

Every nonconstant polynomial in one variable over k has a root in k An algebraically closed field: every nonconstant polynomial has a root in the field, and a nonzero polynomial of degree N has at most N roots A nonzero polynomial of degree n over an integral domain has at most n distinct roots.

Proof

1.1F1F2F3givenconstruct

The product FG is a nonzero polynomial in three variables over the infinite domain k, so it does not vanish at every triple of elements of k: there is a∈k3∖{0} with F(a)G(a)≠0. Choosing a projective change of coordinates A with A[0:0:1]=[a] and replacing C,D by A−1(C),A−1(D), whose intersection is the inverse image of the original one, we may assume [0:0:1] lies on neither curve. The hypothesis of no common component is preserved, so the new defining forms are still nonzero of positive degrees d,e with no common factor.

1.2F7givenalgebra

Any nonzero binary form ρ∈k[x0,x1] of degree N≥1 has a zero in P1: writing ρ=x0sρ1 with s maximal and x0∤ρ1, the dehomogenisation ρ1(1,T) is a nonzero polynomial of degree N−s; if N−s≥1 it has a root λ∈k by algebraic closure and [1:λ] is a zero of ρ, while if N−s=0 the point [0:1] is a zero.

2.1step 1.1F4

In the coordinates of step 1.1 the forms F,G satisfy the hypotheses of the resultant detection: Res⁡x2(F,G) is a nonzero form of degree de, and it vanishes at (a,b)≠(0,0) exactly when some common point [a:b:c] of C and D exists; over each projective zero of the resultant the fibre of intersection points has at most min⁡(d,e) elements.

3.1step 2.1F5givenF6∎

The zeros of the nonzero form Res⁡x2(F,G) of degree de form a finite nonempty subset Z⊆P1: finite because writing ρ=Res⁡x2(F,G)=x0sρ1 with x0∤ρ1, the only possible zero with x0=0 is [0:1], while the zeros with x0≠0 are the at most de roots of the nonzero polynomial ρ1(1,T); and nonempty by step 1.2. By step 2.1 the projection C∩D→P1 has image exactly Z and finite fibres of at most min⁡(d,e) points, so C∩D is finite and nonempty, of at most de⋅min⁡(d,e) points [step 1.2, step 2.1]. For the scheme description, X=Proj⁡(k[x0,x1,x2]/(F,G)) is nonempty and zero-dimensional, hence has finitely many points which are the maximal ideals of the standard charts; over the algebraically closed field k these maximal ideals are exactly the evaluation ideals at the points of the corresponding chart lying on both dehomogenised curves, so the points of X correspond bijectively to the points of C∩D [F5, step 2.1]. This gives both the finite projection description and the equivalent scheme-theoretic description.

Depends on

Used by

Dependency tree · two levels

94 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