Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generated
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 sharing too many points share a component

Statement

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

Let C,D be plane projective curves of degree d≥1 over the algebraically closed field k. If C∩D contains more than d2 distinct points, then C and D share a component. Equivalently, two distinct curves of degree at most d cannot meet in more than d2 distinct points without a common component.

Facts & Assumptions

Given: AC The Axiom of Choice, plane projective curves C,D of degree d≥1 over the algebraically closed field k.

[F1]

For degrees dC,dD≥1, if C,D have no common component, then ∑p∈C∩DIp(C,D)=dCdD, a finite sum over the finitely many intersection points; when both degrees equal d, the sum is d2 Bezout's theorem for plane projective curves, Two plane projective curves meet.

[F2]

Whenever Ip(C,D) is finite, it is a positive integer at points of C∩D and zero at points outside the intersection Symmetry, additivity and local nature of intersection multiplicity. Under the no-common-component hypothesis, [F1] ensures this finiteness at every intersection point.

Proof

1.1F1F2algebra

Suppose C and D had no common component and let S⊆C∩D be a set of pairwise distinct intersection points with ∣S∣>d2. By [F2] each p∈S contributes Ip(C,D)≥1 to the Bezout sum, so ∑p∈C∩DIp(C,D)≥∣S∣>d2, contradicting the Bezout identity of [F1]. Hence a common component must exist.

2.1step 1.1F1algebra∎

Equivalently, if C and D are distinct curves of degrees dC≤d and dD≤d meeting in more than d2≥dCdD distinct points, then the same counting argument with the product dCdD in place of d2 forces a common component; specialising to dC=dD=d gives the first formulation, The equal-degree formulation is therefore a special case of the degree-bounded one.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

41 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