Alphabeta Math
ExampleConstruction: AI-adaptedVerification: 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.

A sphere reflection has degree minus one

Example

Assume ACω (The Axiom of Countable Choice (ACω)). For m≥1 let R(x0,x1,…,xm)=(−x0,x1,…,xm) be the coordinate reflection of Sm, oriented by the outward-normal-first boundary orientation of Sm=∂Dm+1. Then R is a smooth diffeomorphism of Sm reversing orientation, so deg⁡(R)=−1; by the sphere classification every self-map of Sm of degree −1 is homotopic to R, and by the homotopy-equivalence corollary a self-map of Sm of degree −1 is a homotopy equivalence exactly when it is homotopic to a reflection.

Facts & Assumptions

[L1]

The ambient reflection has determinant −1 and sends the outward normal x at x∈Sm to the outward normal R(x). Consequently it reverses the tangent orientation defined by placing that normal first; it is a smooth involution, hence an orientation-reversing diffeomorphism. The general diffeomorphism-degree theorem gives degree −1. (Induced boundary orientation, Degree of an orientation-preserving or reversing diffeomorphism).

Given: ACω, an integer m≥1, the sphere Sm=∂Dm+1 with its outward-normal-first orientation and the coordinate reflection R (Euclidean spheres and closed balls as subspaces of Rn, the local calculation, Induced boundary orientation).

[F1]

The coordinate reflection restricts to an orientation-reversing smooth diffeomorphism of Sm and has degree −1 (the local calculation, the local calculation).

[F2]

An orientation-reversing diffeomorphism between nonempty connected oriented boundaryless manifolds has degree −1 (Degree of an orientation-preserving or reversing diffeomorphism).

[F3]

Sphere self-maps are homotopic exactly when their degrees agree, and every integer occurs as a degree (Sphere self-maps are homotopic exactly when their degrees agree).

[F4]

A self-map of Sm is a homotopy equivalence exactly when its degree is ±1 (Sphere self-maps of degree ±1 are exactly the homotopy equivalences).

Verification

technique · direct
1.1L1F1F2given

The reflection R is the restriction of the invertible linear map of Rm+1 with determinant −1 that preserves the unit sphere, hence restricts to a smooth diffeomorphism of Sm; the linear reflection reverses the ambient orientation and the outward-normal-first orientation of Sm is transported from the ambient orientation, so R reverses the orientation of Sm, and deg⁡(R)=−1 both by the direct reflection computation of [F1] and by the diffeomorphism criterion of [F2].

2.1F3F4step 1.1

Let f:Sm→Sm have degree −1. By [F3] applied to f and R, whose degrees are equal, f is homotopic to R; conversely every map homotopic to R has degree −1 by [F3]. By [F4] every self-map of degree −1 is a homotopy equivalence, and by [F3] its homotopy class is that of the reflection, so a map of degree −1 is a homotopy equivalence precisely when it lies in the homotopy class of a reflection.

3.1F1F3step 2.1∎

This identifies the degree-−1 class, represented by a reflection, and shows the consistency of the reflection sign with the general classification; no new invariant or orientation convention is introduced beyond the outward-normal-first orientation of the sphere.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

29 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