Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: Literature-sourcedPipeline-generatedprecheck passjudge 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.

Degree as an intersection with a regular value

Example

Let F:Mn→Nn be a proper smooth map between nonempty connected oriented boundaryless manifolds, and let y∈N be a regular value, with {y} given the positive point orientation. The degree satisfies deg⁡(F)=∑p∈F−1(y)sgn⁡(dFp), the finite transverse signed intersection count against {y}. If M is compact this is I(F,{y}) in The oriented intersection number; for noncompact M the displayed finite count is the proper-map regular-value formula, without asserting the compact-source definition applies. If M is compact, orient ΓF by its parametrization p↦(p,F(p)) and M×{y} by M and the positive point; then deg⁡(F)=I(M×{y},ΓF),I(ΓF,M×{y})=(−1)ndeg⁡(F). The fibre precedes the graph, in the product-oriented M×N.

Facts & Assumptions

Given: Proper F:Mn→Nn as above, a regular value y with positive point orientation, and compact M for the intersection-number and graph clauses.

[F1]

The regular fibre is finite and deg⁡(F)=∑sgn⁡(dFp), including dimension zero (Regular-value formula for degree, Local orientation sign of a regular preimage, Degree of a proper smooth map by compact-support cohomology).

[F2]

For a compact source the intersection number is the sum of local signs; against a positive point the signs agree with regular-preimage signs (The oriented intersection number, Preimage orientation agrees with the local intersection sign).

[F3]

The graph is embedded and the ambient product orientation lists M before N (The graph of a smooth map is an embedded submanifold, Product orientations).

[F4]

The diagonal comparison for transverse maps is I(f,g)=(−1)dim⁡ZI(f×g,Δ) (Two-map intersection as a diagonal preimage).

Verification

1.1F1F2givenalgebra

Regularity makes F transverse to {y}. Its finite signed count is the sum in [F1], since the local intersection signs against the positive point equal sgn⁡(dFp) by [F2]. The sum is deg⁡(F); with compact M the definition in [F2] names it I(F,{y}). Properness supplies finiteness even when M is noncompact, but it does not enlarge that compact-source definition.

2.1F1F2F3step 1.1algebra

Assume M compact. At (p,y) a fibre tangent vector is (u,0) and a graph tangent vector is (v,dFpv). The ordered derivative matrix for fibre first, graph second is (II0dFp), whose determinant has sign sgn⁡(dFp) in the induced orientations. The determinant-line calculation also handles n=0: the two source point signs from M cancel, leaving the ambient point sign of M×N, equal to sgn⁡(dFp). The transverse intersection is exactly the finite regular fibre, so summing gives I(M×{y},ΓF)=deg⁡(F). Reversing the two n-blocks multiplies each sign by (−1)n2=(−1)n.

3.1F4step 2.1algebra∎

Write s(p)=(p,F(p)) and let i include M×{y}. Their oriented parametrizations identify I(s,i) with the graph-first count, so [F4] gives I(s,i)=(−1)nI(s×i,ΔM×N). This agrees with the opposite-order graph sign in 2.1, establishing compatibility of the degree and diagonal conventions.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

36 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