Documentation

LeanPool.JacobianDiffgeo.MappingDegree.Degree

The mapping degree #

noncomputable def RS.degree {X : Type u_1} [TopologicalSpace X] [ChartedSpace X] {Y : Type u_2} [TopologicalSpace Y] [ChartedSpace Y] [Nonempty Y] (F : XY) :

The mapping degree: total multiplicity of F over an arbitrary basepoint of Y. Well-defined (basepoint-independent) by fiberMultSum_eq_degree; 0 for constant maps (degree_of_forall_eq).

Equations
Instances For
    theorem RS.degree_of_forall_eq {X : Type u_1} [TopologicalSpace X] [ChartedSpace X] {Y : Type u_2} [TopologicalSpace Y] [ChartedSpace Y] [Nonempty Y] (c : Y) :
    (degree fun (x : X) => c) = 0

    Junk convention: constant maps have degree ≡ 0.

    THE well-definedness statement in degree form: the fiber-sum over any y is the degree.

    degree F is positive exactly when F is nonconstant.

    Fiber cardinality equals the degree over regular values (every fiber point has multiplicity exactly 1).

    In general (branch values included), fiber cardinality is at most the degree.

    Degree 1 ⇒ bijective ⇒ homeomorphism (genus-zero-headline / Abel bank) #

    Degree 1 forces bijectivity: surjectivity is automatic (nonconstant on connected X); injectivity fails only if some fiber has ≥ 2 points, forcing fiberMultSum ≥ 2 > 1.

    The homeomorphism witnessed by a degree-1 map (compact source, T2 target, continuous bijection).

    Equations
    Instances For

      degree_comp (statement bank; no critical downstream consumer) #

      Degree is multiplicative under composition. The only statement in the unit needing the extra instance [CompactSpace Y] (finiteness of G's fibers).