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

Bezout's theorem for plane projective curves

Statement

Assume the Axiom of Choice. Let C=V(F) and D=V(G) be plane projective curves of degrees d,e≥1 over the algebraically closed field k, with no common component. Then

∑p∈C∩DIp(C,D)=de,

a finite sum over the finitely many intersection points, each term the local intersection multiplicity of the two curves.

Facts & Assumptions

Given: AC, plane projective curves C=V(F), D=V(G) of degrees d,e≥1 over the algebraically closed field k with no common component, and X=Proj⁡(k[x0,x1,x2]/(F,G)) Projective scheme of a homogeneous quotient and its standard affine charts.

[F1]

C∩D is nonempty and finite, and the points of X correspond to the points of C∩D Curves without a common component meet finitely often.

[F2]

The total length of X equals the degree product: len⁡k(X)=de Global length of a plane complete intersection equals the degree product.

[F3]

The total length of X equals the sum of the local intersection multiplicities: len⁡k(X)=∑p∈C∩DIp(C,D) Global intersection length is the sum of the local multiplicities, with every term finite by the no-common-component hypothesis Local intersection multiplicity of two plane curves.

Proof

1.1F2F3given

By [F2] the global length of X is len⁡k(X)=de; by [F3] the same global length equals the finite sum of the local multiplicities ∑p∈C∩DIp(C,D) over the finitely many intersection points, each summand finite.

2.1step 1.1F1F2F3∎

Equating the two computations of the same number len⁡k(X) gives ∑p∈C∩DIp(C,D)=de, which is Bezout's identity; finiteness and nonemptiness of the intersection were recorded in [F1] and are used to make the sum meaningful.

Depends on

Used by

Dependency tree · two levels

57 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