Documentation

Atlas.AlgebraicTopologyI.code.Section32

structure OrientationTheorem.OrientationTheoremResult {M : Type u_1} [TopologicalSpace M] (n : ) [ChartedSpace (EuclideanSpace (Fin n)) M] (Hrel : Set MType u_2) [inst : (q : ) → (A : Set M) → AddCommGroup (Hrel q A)] (Γsec : Set MType u_3) [inst' : (A : Set M) → AddCommGroup (Γsec A)] (jMap : (A : Set M) → Hrel n A →+ Γsec A) (K : Set M) :

Conclusion of Theorem 32.1 for a compact subset K. Packages the two assertions of the orientation theorem for an n-manifold M and a compact set K ⊆ M: the relative homology groups Hrel q K vanish for q > n, and the comparison map jMap K : Hrel n K → Γsec K to sections of the orientation sheaf is a bijection. Stated abstractly so that the proof structure of Section 32 can be reused for any homology theory Hrel/section functor Γsec satisfying the appropriate axioms.

Instances For
    structure OrientationTheorem.MayerVietorisLadder {M : Type u_1} [TopologicalSpace M] (n : ) [ChartedSpace (EuclideanSpace (Fin n)) M] (Hrel : Set MType u_2) [(q : ) → (K : Set M) → AddCommGroup (Hrel q K)] (Γsec : Set MType u_3) [(K : Set M) → AddCommGroup (Γsec K)] (jMap : (K : Set M) → Hrel n K →+ Γsec K) (A B : Set M) :
    Type (max u_2 u_3)

    Mayer–Vietoris ladder data for Proposition 32.2. Records the relevant portion of the commutative diagram with exact rows used to prove that if the orientation theorem holds for A, B, and A ∩ B, then it holds for A ∪ B: the top row is the relative-homology Mayer–Vietoris sequence at degrees n and q > n, the bottom row is the Mayer–Vietoris sequence for sections of the orientation sheaf, and jMap provides the comparison map between them.

    Instances For
      def OrientationTheorem.MayerVietorisLadder.ofExactSequences {M : Type u_1} [TopologicalSpace M] (n : ) [ChartedSpace (EuclideanSpace (Fin n)) M] (Hrel : Set MType u_2) [(q : ) → (K : Set M) → AddCommGroup (Hrel q K)] (Γsec : Set MType u_3) [(K : Set M) → AddCommGroup (Γsec K)] (jMap : (K : Set M) → Hrel n K →+ Γsec K) (A B : Set M) (_hA : IsClosed A) (_hB : IsClosed B) (_hOT_AB : OrientationTheoremResult n Hrel Γsec jMap (A B)) (mvα_q : (q : ) → Hrel q (A B) →+ Hrel q A × Hrel q B) (mvβ_q : (q : ) → Hrel q A × Hrel q B →+ Hrel q (A B)) (mvδ_q : (q : ) → Hrel (q + 1) (A B) →+ Hrel q (A B)) (mv_exact_δα : ∀ (q : ), Function.Exact (mvδ_q q) (mvα_q q)) (mv_exact_αβ : ∀ (q : ), Function.Exact (mvα_q q) (mvβ_q q)) (secα : Γsec (A B) →+ Γsec A × Γsec B) (secβ : Γsec A × Γsec B →+ Γsec (A B)) (sec_inj : ∀ (x : Γsec (A B)), secα x = 0x = 0) (sec_exact : Function.Exact secα secβ) (comm_α : secα.comp (jMap (A B)) = ((jMap A).prodMap (jMap B)).comp (mvα_q n)) (comm_β : secβ.comp ((jMap A).prodMap (jMap B)) = (jMap (A B)).comp (mvβ_q n)) :
      MayerVietorisLadder n Hrel Γsec jMap A B

      Build a MayerVietorisLadder from the full Mayer–Vietoris long exact sequences in Hrel and Γsec together with the commutation hypotheses. Uses the vanishing part of the orientation theorem on A ∩ B to derive injectivity of mvα and of the higher-degree maps mvα_q for q > n, since their kernels lie in Hrel (q+1) (A ∩ B) = 0.

      Instances For
        theorem OrientationTheorem.orientation_theorem_union_of_ladder {M : Type u_1} [TopologicalSpace M] (n : ) [ChartedSpace (EuclideanSpace (Fin n)) M] (A B : Set M) (_hA : IsClosed A) (_hB : IsClosed B) (Hrel : Set MType u_2) [(q : ) → (K : Set M) → AddCommGroup (Hrel q K)] (Γsec : Set MType u_3) [(K : Set M) → AddCommGroup (Γsec K)] (jMap : (K : Set M) → Hrel n K →+ Γsec K) (hOT_A : OrientationTheoremResult n Hrel Γsec jMap A) (hOT_B : OrientationTheoremResult n Hrel Γsec jMap B) (hOT_AB : OrientationTheoremResult n Hrel Γsec jMap (A B)) (ladder : MayerVietorisLadder n Hrel Γsec jMap A B) :
        OrientationTheoremResult n Hrel Γsec jMap (A B)

        Proposition 32.2, ladder form. Given the orientation theorem on A, B, and A ∩ B, together with a Mayer–Vietoris ladder relating their relative homologies and section groups, deduce the orientation theorem on A ∪ B. The vanishing part follows from injectivity of mvα in degrees q > n, and the bijectivity of jMap (A ∪ B) is obtained by the five-lemma applied to the ladder.

        structure OrientationTheorem.RelativeMVSequenceData {M : Type u_2} [TopologicalSpace M] (n : ) [ChartedSpace (EuclideanSpace (Fin n)) M] (Hrel : Set MType u_3) [(q : ) → (K : Set M) → AddCommGroup (Hrel q K)] (Γsec : Set MType u_4) [(K : Set M) → AddCommGroup (Γsec K)] (jMap : (K : Set M) → Hrel n K →+ Γsec K) (A B : Set M) :
        Type (max u_3 u_4)

        Abstract data of the relative Mayer–Vietoris long exact sequences in all degrees together with the section-sequence and compatibility conditions, packaged so that MayerVietorisLadder.ofExactSequences can be invoked from a single bundle.

        Instances For
          noncomputable def OrientationTheorem.relativeMVSequenceData_from_manifold {M : Type u_2} [TopologicalSpace M] (n : ) [AlgebraicTopologyI.TopologicalManifold n M] (A B : Set M) (_hA : IsClosed A) (_hB : IsClosed B) (Hrel : Set MType u_3) [(q : ) → (K : Set M) → AddCommGroup (Hrel q K)] (Γsec : Set MType u_4) [(K : Set M) → AddCommGroup (Γsec K)] (jMap : (K : Set M) → Hrel n K →+ Γsec K) :
          RelativeMVSequenceData n Hrel Γsec jMap A B

          Manifold-level construction of the Mayer–Vietoris data for closed subsets A, B ⊆ M of a topological n-manifold. Currently a placeholder referring to the underlying Mayer–Vietoris machinery for the homology of closed pairs in a manifold.

          Instances For
            noncomputable def OrientationTheorem.mayerVietorisLadder_from_manifold {M : Type u_2} [TopologicalSpace M] (n : ) [AlgebraicTopologyI.TopologicalManifold n M] (A B : Set M) (hA : IsClosed A) (hB : IsClosed B) (Hrel : Set MType u_3) [(q : ) → (K : Set M) → AddCommGroup (Hrel q K)] (Γsec : Set MType u_4) [(K : Set M) → AddCommGroup (Γsec K)] (jMap : (K : Set M) → Hrel n K →+ Γsec K) (hOT_AB : OrientationTheoremResult n Hrel Γsec jMap (A B)) :
            MayerVietorisLadder n Hrel Γsec jMap A B

            Specialises relativeMVSequenceData_from_manifold and feeds it through MayerVietorisLadder.ofExactSequences to produce the Mayer–Vietoris ladder needed by orientation_theorem_union_of_ladder.

            Instances For
              theorem OrientationTheorem.orientation_theorem_union {M : Type u_2} [TopologicalSpace M] (n : ) [AlgebraicTopologyI.TopologicalManifold n M] (A B : Set M) (hA : IsClosed A) (hB : IsClosed B) (Hrel : Set MType u_3) [(q : ) → (K : Set M) → AddCommGroup (Hrel q K)] (Γsec : Set MType u_4) [(K : Set M) → AddCommGroup (Γsec K)] (jMap : (K : Set M) → Hrel n K →+ Γsec K) (hOT_A : OrientationTheoremResult n Hrel Γsec jMap A) (hOT_B : OrientationTheoremResult n Hrel Γsec jMap B) (hOT_AB : OrientationTheoremResult n Hrel Γsec jMap (A B)) :
              OrientationTheoremResult n Hrel Γsec jMap (A B)

              Proposition 32.2. If M is a topological n-manifold and the orientation theorem holds for each of the closed subsets A, B, and A ∩ B of M, then it holds for the union A ∪ B.

              theorem OrientationTheorem.compact_decreasing_sequence_subset_open {X : Type u_2} [TopologicalSpace X] [T2Space X] (A : Set X) (hA_compact : ∀ (i : ), IsCompact (A i)) (hA_decreasing : ∀ (i : ), A (i + 1) A i) (U : Set X) (hU_open : IsOpen U) (hAU : ⋂ (i : ), A i U) :
              ∃ (i : ), A i U

              Lemma 32.5. In a Hausdorff space, given a decreasing sequence A₀ ⊇ A₁ ⊇ ⋯ of compact subsets and an open set U containing the intersection ⋂ i, A i, some term A i is already contained in U. Proved by contradiction using compactness of the nonempty closed sets A i \ U.

              theorem OrientationTheorem.result_finset_biUnion {M : Type u_1} [TopologicalSpace M] {n : } [ChartedSpace (EuclideanSpace (Fin n)) M] {Hrel : Set MType u_2} [(q : ) → (K : Set M) → AddCommGroup (Hrel q K)] {Γsec : Set MType u_3} [(K : Set M) → AddCommGroup (Γsec K)] {jMap : (K : Set M) → Hrel n K →+ Γsec K} {ι : Type u_4} [DecidableEq ι] (union_step : ∀ (K₁ K₂ : Set M), IsClosed K₁IsClosed K₂OrientationTheoremResult n Hrel Γsec jMap K₁OrientationTheoremResult n Hrel Γsec jMap K₂OrientationTheoremResult n Hrel Γsec jMap (K₁ K₂)OrientationTheoremResult n Hrel Γsec jMap (K₁ K₂)) (k : ) (D : ιSet M) :
              (∀ (i : ι), IsClosed (D i))(∀ (S : Finset ι), S.NonemptyOrientationTheoremResult n Hrel Γsec jMap (⋂ iS, D i))∀ (T : Finset ι), T.NonemptyT.card kOrientationTheoremResult n Hrel Γsec jMap (⋃ iT, D i)

              Iterated form of the union step (Proposition 32.2): if the union_step hypothesis is available, then the orientation theorem propagates from intersections ⋂ i ∈ S, D i along nonempty finite families to the union ⋃ i ∈ T, D i over any nonempty finite index set T with T.card ≤ k. Proved by induction on k, peeling off one element at a time and applying union_step.

              theorem OrientationTheorem.orientation_theorem_from_cover {M : Type u_1} [TopologicalSpace M] (n : ) (A : Set M) [AlgebraicTopologyI.TopologicalManifold n M] (_hA_compact : IsCompact A) (hA_closed : IsClosed A) (Hrel : Set MType u_4) [(q : ) → (K : Set M) → AddCommGroup (Hrel q K)] (Γsec : Set MType u_5) [(K : Set M) → AddCommGroup (Γsec K)] (jMap : (K : Set M) → Hrel n K →+ Γsec K) (m : ) (D : Fin mSet M) (hD_closed : ∀ (i : Fin m), IsClosed (D i)) (hD_cover : A ⋃ (i : Fin m), D i) (hD_result : ∀ (S : Finset (Fin m)), S.NonemptyOrientationTheoremResult n Hrel Γsec jMap (A iS, D i)) (union_step : ∀ (K₁ K₂ : Set M), IsClosed K₁IsClosed K₂OrientationTheoremResult n Hrel Γsec jMap K₁OrientationTheoremResult n Hrel Γsec jMap K₂OrientationTheoremResult n Hrel Γsec jMap (K₁ K₂)OrientationTheoremResult n Hrel Γsec jMap (K₁ K₂)) (hm_pos : 0 < m) :
              OrientationTheoremResult n Hrel Γsec jMap A

              Reduces the orientation theorem for a compact A ⊆ M to the case of intersections A ∩ ⋂ i ∈ S, D i where D : Fin m → Set M is a finite closed cover of A. Combines result_finset_biUnion with the decomposition A = ⋃ i, A ∩ D i.

              structure OrientationTheorem.RelativeHomologyColimitData {X : Type u_2} [TopologicalSpace X] (A : Set X) (G : Set XType u_3) [(K : Set X) → AddCommGroup (G K)] :
              Type u_3

              Abstract data witnessing that G (⋂ j, A j) is the colimit of the sequence G (A i) along the inclusions A (i+1) ⊆ A i: restriction maps ρ i to the intersection, transition maps φ i j compatible with them, and the two filtered-colimit conditions (every element of the limit comes from some G (A i), and an element vanishing in the limit already vanishes at some larger stage).

              • ρ (i : ) : G (A i) →+ G (⋂ (j : ), A j)
              • φ (i j : ) : i jG (A i) →+ G (A j)
              • compat (i j : ) (hij : i j) : (self.ρ j).comp (self.φ i j hij) = self.ρ i
              • surj (x : G (⋂ (j : ), A j)) : ∃ (i : ) (g : G (A i)), (self.ρ i) g = x
              • inj (i : ) (g : G (A i)) : (self.ρ i) g = 0∃ (j : ) (hij : i j), (self.φ i j hij) g = 0
              Instances For
                theorem OrientationTheorem.RelativeHomologyColimitData.vanishing_propagation {X : Type u_2} [TopologicalSpace X] {A : Set X} {G : Set XType u_3} [(K : Set X) → AddCommGroup (G K)] (col : RelativeHomologyColimitData A G) (hvan : ∀ (i : ) (x : G (A i)), x = 0) (x : G (⋂ (j : ), A j)) :
                x = 0

                If every group G (A i) vanishes, the colimit G (⋂ j, A j) also vanishes. Used to propagate the vanishing part of the orientation theorem from a decreasing sequence of compact sets to their intersection.

                theorem OrientationTheorem.RelativeHomologyColimitData.bijective_propagation {X : Type u_2} [TopologicalSpace X] {A : Set X} {G : Set XType u_3} {H : Set XType u_4} [(K : Set X) → AddCommGroup (G K)] [(K : Set X) → AddCommGroup (H K)] (colG : RelativeHomologyColimitData A G) (colH : RelativeHomologyColimitData A H) (f : (K : Set X) → G K →+ H K) (hf_ρ : ∀ (i : ), (colH.ρ i).comp (f (A i)) = (f (⋂ (j : ), A j)).comp (colG.ρ i)) (hf_φ : ∀ (i j : ) (hij : i j), (colH.φ i j hij).comp (f (A i)) = (f (A j)).comp (colG.φ i j hij)) (hf_bij : ∀ (i : ), Function.Bijective (f (A i))) :
                Function.Bijective (f (⋂ (j : ), A j))

                If a natural transformation f : G ⟶ H of colimit data induces a bijection at each stage A i, then the induced map on colimits f (⋂ j, A j) is also bijective. This is the standard fact that filtered colimits of bijections are bijections, packaged in the form needed to upgrade the orientation-theorem isomorphism from each A i to their intersection.

                theorem OrientationTheorem.orientation_theorem_iInter {M : Type u_1} [TopologicalSpace M] [T2Space M] (n : ) [ChartedSpace (EuclideanSpace (Fin n)) M] {A : Set M} (_hA_compact : ∀ (i : ), IsCompact (A i)) (_hA_decreasing : ∀ (i : ), A (i + 1) A i) (Hrel : Set MType u_2) [(q : ) → (K : Set M) → AddCommGroup (Hrel q K)] (Γsec : Set MType u_3) [(K : Set M) → AddCommGroup (Γsec K)] (jMap : (K : Set M) → Hrel n K →+ Γsec K) (colH : (q : ) → RelativeHomologyColimitData A (Hrel q)) (colΓ : RelativeHomologyColimitData A Γsec) (hjMap_ρ : ∀ (i : ), (colΓ.ρ i).comp (jMap (A i)) = (jMap (⋂ (j : ), A j)).comp ((colH n).ρ i)) (hjMap_φ : ∀ (i j : ) (hij : i j), (colΓ.φ i j hij).comp (jMap (A i)) = (jMap (A j)).comp ((colH n).φ i j hij)) (hsat : ∀ (i : ), OrientationTheoremResult n Hrel Γsec jMap (A i)) :
                OrientationTheoremResult n Hrel Γsec jMap (⋂ (i : ), A i)

                Proposition 32.3, abstract form. For a decreasing sequence A₀ ⊇ A₁ ⊇ ⋯ of compact subsets of a Hausdorff n-manifold-like space, given colimit data witnessing that Hrel q (⋂ i, A i) and Γsec (⋂ i, A i) are colimits of Hrel q (A i) and Γsec (A i), the orientation theorem on each A i implies the orientation theorem on the intersection ⋂ i, A i.

                structure OrientationTheorem.ColimitDataForDecreasingCompact {M : Type u_2} [TopologicalSpace M] (n : ) [ChartedSpace (EuclideanSpace (Fin n)) M] (A : Set M) (Hrel : Set MType u_3) [(q : ) → (K : Set M) → AddCommGroup (Hrel q K)] (Γsec : Set MType u_4) [(K : Set M) → AddCommGroup (Γsec K)] (jMap : (K : Set M) → Hrel n K →+ Γsec K) :
                Type (max u_3 u_4)

                Bundle of all colimit data needed for the orientation_theorem_iInter proof at a single decreasing compact sequence: per-degree RelativeHomologyColimitData for Hrel q, one for Γsec, and the compatibility of jMap with the restriction and transition maps.

                Instances For
                  theorem OrientationTheorem.compact_subset_complement_eventually_aux {X : Type u_2} [TopologicalSpace X] (A : Set X) (hA_closed : ∀ (i : ), IsClosed (A i)) (hA_decreasing : ∀ (i : ), A (i + 1) A i) (K : Set X) (hK : IsCompact K) (hKA : K (⋂ (i : ), A i)) :
                  ∃ (i : ), K (A i)

                  Companion to compact_decreasing_sequence_subset_open rephrased in complement form: if K is a compact subset of the complement of ⋂ i, A i where A i is a decreasing sequence of closed sets, then K ⊆ (A i)ᶜ already for some i. Proved using the directed-cover formulation of compactness.

                  def OrientationTheorem.ColimitDataForDecreasingCompact.ofManifold {M : Type u_2} [TopologicalSpace M] (n : ) [AlgebraicTopologyI.TopologicalManifold n M] (A : Set M) (hA_compact : ∀ (i : ), IsCompact (A i)) (hA_decreasing : ∀ (i : ), A (i + 1) A i) (Hrel : Set MType u_3) [(q : ) → (K : Set M) → AddCommGroup (Hrel q K)] (Γsec : Set MType u_4) [(K : Set M) → AddCommGroup (Γsec K)] (jMap : (K : Set M) → Hrel n K →+ Γsec K) (ρH : (q i : ) → Hrel q (A i) →+ Hrel q (⋂ (j : ), A j)) (φH : (q i j : ) → i jHrel q (A i) →+ Hrel q (A j)) (hcompatH : ∀ (q i j : ) (hij : i j), (ρH q j).comp (φH q i j hij) = ρH q i) (hsurjH : ∀ (q : ) (x : Hrel q (⋂ (j : ), A j)), ∃ (K : Set M), IsCompact K K (⋂ (i : ), A i) ∀ (i : ), K (A i)∃ (g : Hrel q (A i)), (ρH q i) g = x) (hinjH : ∀ (q i : ) (g : Hrel q (A i)), (ρH q i) g = 0∃ (K : Set M), IsCompact K K (⋂ (k : ), A k) ∀ (j : ) (hij : i j), K (A j)(φH q i j hij) g = 0) (ρΓ : (i : ) → Γsec (A i) →+ Γsec (⋂ (j : ), A j)) (φΓ : (i j : ) → i jΓsec (A i) →+ Γsec (A j)) (hcompatΓ : ∀ (i j : ) (hij : i j), (ρΓ j).comp (φΓ i j hij) = ρΓ i) (hsurjΓ : ∀ (x : Γsec (⋂ (j : ), A j)), ∃ (K : Set M), IsCompact K K (⋂ (i : ), A i) ∀ (i : ), K (A i)∃ (g : Γsec (A i)), (ρΓ i) g = x) (hinjΓ : ∀ (i : ) (g : Γsec (A i)), (ρΓ i) g = 0∃ (K : Set M), IsCompact K K (⋂ (k : ), A k) ∀ (j : ) (hij : i j), K (A j)(φΓ i j hij) g = 0) (hjMap_ρ : ∀ (i : ), (ρΓ i).comp (jMap (A i)) = (jMap (⋂ (j : ), A j)).comp (ρH n i)) (hjMap_φ : ∀ (i j : ) (hij : i j), (φΓ i j hij).comp (jMap (A i)) = (jMap (A j)).comp (φH n i j hij)) :

                  Manifold-flavoured constructor for ColimitDataForDecreasingCompact: assembles the colimit data from the manifold versions of the surjectivity and injectivity assertions, where witnesses are presented as compact subsets of the complement of ⋂ i, A i and are converted to indices using compact_subset_complement_eventually_aux.

                  Instances For
                    noncomputable def OrientationTheorem.colimitData_of_manifold_decreasingCompact {M : Type u_2} [TopologicalSpace M] (n : ) [AlgebraicTopologyI.TopologicalManifold n M] (A : Set M) (hA_compact : ∀ (i : ), IsCompact (A i)) (hA_decreasing : ∀ (i : ), A (i + 1) A i) (Hrel : Set MType u_3) [(q : ) → (K : Set M) → AddCommGroup (Hrel q K)] (Γsec : Set MType u_4) [(K : Set M) → AddCommGroup (Γsec K)] (jMap : (K : Set M) → Hrel n K →+ Γsec K) :

                    Existence of the ColimitDataForDecreasingCompact for any decreasing sequence of compact subsets of a topological n-manifold; placeholder for the underlying construction that produces the relative homology and section colimit data from the manifold's Mayer–Vietoris / excision machinery.

                    Instances For
                      theorem OrientationTheorem.orientation_theorem_iInter_manifold {M : Type u_2} [TopologicalSpace M] (n : ) [AlgebraicTopologyI.TopologicalManifold n M] {A : Set M} (hA_compact : ∀ (i : ), IsCompact (A i)) (hA_decreasing : ∀ (i : ), A (i + 1) A i) (Hrel : Set MType u_3) [(q : ) → (K : Set M) → AddCommGroup (Hrel q K)] (Γsec : Set MType u_4) [(K : Set M) → AddCommGroup (Γsec K)] (jMap : (K : Set M) → Hrel n K →+ Γsec K) (cd : ColimitDataForDecreasingCompact n A Hrel Γsec jMap) (hsat : ∀ (i : ), OrientationTheoremResult n Hrel Γsec jMap (A i)) :
                      OrientationTheoremResult n Hrel Γsec jMap (⋂ (i : ), A i)

                      Proposition 32.3. For a decreasing sequence of compact subsets of a topological n-manifold, given the colimit data from ColimitDataForDecreasingCompact, the orientation theorem propagates from each A i to their intersection ⋂ i, A i.

                      theorem OrientationTheorem.compact_finite_closed_chart_cover (n : ) (M : Type u_2) [TopologicalSpace M] [AlgebraicTopologyI.TopologicalManifold n M] (A : Set M) (hA : IsCompact A) :
                      ∃ (m : ) (D : Fin mSet M), 0 < m (∀ (i : Fin m), IsClosed (D i)) A ⋃ (i : Fin m), D i ∀ (i : Fin m), eatlas (EuclideanSpace (Fin n)) M, D i e.source

                      Lemma 32.4-style auxiliary. Any compact subset A of a topological n-manifold can be covered by finitely many closed sets D i, each contained in the source of an atlas chart. This is the reduction step that brings the proof of Theorem 32.1 to the Euclidean-chart base case.

                      theorem OrientationTheorem.orientation_theorem_abstract {M : Type u_2} [TopologicalSpace M] (n : ) (A : Set M) [AlgebraicTopologyI.TopologicalManifold n M] (hA_compact : IsCompact A) (Hrel : Set MType u_3) [(q : ) → (K : Set M) → AddCommGroup (Hrel q K)] (Γsec : Set MType u_4) [(K : Set M) → AddCommGroup (Γsec K)] (jMap : (K : Set M) → Hrel n K →+ Γsec K) (base_case : ∀ (K : Set M), IsCompact K(∃ eatlas (EuclideanSpace (Fin n)) M, K e.source)OrientationTheoremResult n Hrel Γsec jMap K) (union_step : ∀ (K₁ K₂ : Set M), IsClosed K₁IsClosed K₂OrientationTheoremResult n Hrel Γsec jMap K₁OrientationTheoremResult n Hrel Γsec jMap K₂OrientationTheoremResult n Hrel Γsec jMap (K₁ K₂)OrientationTheoremResult n Hrel Γsec jMap (K₁ K₂)) :
                      OrientationTheoremResult n Hrel Γsec jMap A

                      Theorem 32.1, abstract reduction. The orientation theorem holds for any compact subset A of a topological n-manifold, provided one supplies the chart-level base case (orientation theorem on any compact subset of a single chart) and the Mayer–Vietoris-style union_step (Proposition 32.2). The proof covers A by finitely many closed chart-contained sets via compact_finite_closed_chart_cover and then invokes orientation_theorem_from_cover.