Alphabeta Math
RemarkRemark: AI-adaptedProof: Not applicablePipeline-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.

Closedness is needed for the Hopf degree classification

Remark

The Hopf classification of The Hopf degree theorem for oriented domains assumes a nonempty compact source without boundary. For a compact manifold with boundary, prescribing values on that boundary is additional data, and a relative classification requires a separate statement for maps and homotopies of pairs (Smooth charts, atlases, and structures with boundary). No such relative classification is proved on this page.

For a noncompact source M there is no proper map M→Sm: the inverse image of the compact target is all of M, which properness would require to be compact. Thus the proper-map degree of Degree of a proper smooth map by compact-support cohomology cannot be applied to such a sphere map. For maps to other, noncompact targets the cited definition requires properness, and Degree is invariant under proper smooth homotopy requires properness of the combined homotopy. These are separate settings; this page asserts no classification there (Open cover, subcover, and compact topological space; a compact subset is a subspace that is compact in its own right).

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

28 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