Alphabeta Math
False statementConstruction: AI-adaptedVerification: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-13
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.

Degree is the unsigned number of points in a regular fibre

Statement

False. The degree of a proper smooth map equals the unsigned number of points in any regular fibre.

Refutation

Given: Give source and target R their standard orientations and let F:RR be F(x)=x2.

1.1

The map is proper. If KR is compact, [F2] makes it closed and bounded, say yB on K. Then F1(K) is closed by continuity and is contained in [B,B] when B0; if K is empty its inverse image is empty. Thus [F2] makes F1(K) compact.

F2given
1.2

The value 1 has exactly the two preimages 1 and 1. Since F(x)=2x, both are regular, but their local orientation signs are 1 at 1 and +1 at 1. Hence [F1] gives deg(F)=(1)+(+1)=0, whereas the unsigned fibre cardinality is 2.

F1givenalgebra
2.1

This explicit witness disproves the claimed equality. A singleton fibre whose local sign is +1 would make the two numbers agree, while an empty regular fibre gives both zero; those special cases do not remove the cancellation in step 1.2. The example is one-dimensional, boundaryless, nonempty, and uses no selections or choice principle.

F1step 1.1step 1.2

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

44 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