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

Counting distinct points is not enough: tangent contact

Statement refuted

False claim: for two plane projective curves of degrees d,e over an algebraically closed field, the number of distinct intersection points equals de.

Facts & Assumptions

Given: AC The Axiom of Choice, the conic C=V(x02−x1x2) and its tangent line L=V(x1) at p=[0:0:1], both over an algebraically closed field of characteristic not two.

[F1]

L∩C={p} as a set, and Ip(C,L)=2: the restriction of the conic equation to L is x02, a double root at p A tangent line meets a conic with multiplicity two at one point.

[F2]

Bezout for deg⁡C=2, deg⁡L=1 gives ∑q∈C∩LIq(C,L)=2 over an algebraically closed field Bezout's theorem for plane projective curves, and every local multiplicity at a point of the intersection is a positive integer Local intersection multiplicity of two plane curves.

Counterexample

1.1F1given

The distinct intersection points number one, while the degree product is de=2⋅1=2.

1.2F1F2given

The multiplicity-weighted sum is Ip(C,L)=2, the value required by Bezout, concentrated at the unique point.

2.1step 1.1step 1.2F1F2∎

Therefore the distinct-point count 1 differs from de=2; the deficiency is repaired exactly by counting the tangent contact with multiplicity two, so the number of distinct points alone does not equal the degree product.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

23 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