ProCGroups.Topologies.ContinuousMonoidHom
This module develops the maps induced by continuous homomorphisms. It organizes the relevant quotient pullbacks and finite-stage maps, then proves the compatibility statements needed for the completed construction.
import
- Mathlib.Topology.Algebra.ContinuousMonoidHom
- Mathlib.Topology.Algebra.Group.Quotient
theorem continuous_of_isOpen_ker_to_discrete
{G : Type u} {Q : Type v}
[Group G] [TopologicalSpace G] [IsTopologicalGroup G]
[Group Q] [TopologicalSpace Q] [DiscreteTopology Q]
(f : G →* Q) (hker : IsOpen ((f.ker : Subgroup G) : Set G)) : Continuous fA homomorphism from a topological group to a discrete group is continuous if its kernel is open.
Show proof
by
classical
rw [continuous_discrete_rng]
intro y
by_cases hy : ∃ x : G, f x = y
· rcases hy with ⟨x, hx⟩
have hEq :
f ⁻¹' ({y} : Set Q) = (fun z : G => x * z) '' ((f.ker : Subgroup G) : Set G) := by
ext z
constructor
· intro hz
have hz' : f z = y := by simpa using hz
refine ⟨x⁻¹ * z, ?_, by simp only [mul_inv_cancel_left]⟩
change f (x⁻¹ * z) = 1
simp only [map_mul, map_inv, hx, hz', inv_mul_cancel]
· rintro ⟨k, hk, rfl⟩
change f (x * k) = y
rw [map_mul, hx]
simpa using hk
rw [hEq]
exact isOpenMap_mul_left x _ hker
· have hEq : f ⁻¹' ({y} : Set Q) = ∅ := by
ext z
constructor
· intro hz
exact False.elim (hy ⟨z, hz⟩)
· intro hz
simp only [Set.mem_empty_iff_false] at hz
rw [hEq]
exact isOpen_emptyProof. Work with open normal subgroups and finite quotients of the profinite or pro-\(C\) group. Finite quotients separate points, and continuous homomorphisms are determined by their compatible quotient-level maps. Continuity is checked by composing with all finite quotient projections; each composite is a continuous map between finite or profinite quotient spaces. Kernel and image statements are verified after quotienting by sufficiently small open normal subgroups, where they become ordinary finite group calculations. Compatibility under refinement then assembles the finite-quotient data and proves the required profinite or pro-\(C\) statement. The quotient-level assertions are stable under passing to smaller open normal subgroups, so they define compatible data in the inverse system of finite quotients. For pro-\(C\) permanence, the construction uses only operations for which the chosen finite group class is closed. Hence the finite verification assembles to the desired profinite map, subgroup, or quotient statement. For categorical constructions such as products, pullbacks, and inverse limits, the universal property is checked by composing with the coordinate projections. The uniqueness part follows because any two candidate maps with the same finite quotient composites have the same value on every separating finite quotient. Existence is obtained by assembling the compatible coordinate maps supplied by the finite quotient construction. The topological assertion is checked by the initial topology of the inverse limit. After composing with each finite-stage projection, the relevant map is a continuous finite-stage homomorphism or an operation on a finite product; compactness, Hausdorffness, total disconnectedness, and profiniteness are then inherited from the finite stages by the standard inverse-limit argument.
□def subtype (K : Subgroup G) : K →ₜ* G where
toMonoidHom := K.subtype
continuous_toFun := continuous_subtype_valThe inclusion of a subgroup, as a continuous monoid homomorphism for the subtype topology.
@[simp] theorem subtype_apply (K : Subgroup G) (x : K) :
subtype K x = xThe continuous homomorphism induced by a subgroup inclusion evaluates to the underlying subgroup element.
Show proof
rflProof. Work with open normal subgroups and finite quotients of the profinite or pro-\(C\) group. Finite quotients separate points, and continuous homomorphisms are determined by their compatible quotient-level maps. Continuity is checked by composing with all finite quotient projections; each composite is a continuous map between finite or profinite quotient spaces. Compatibility under refinement then assembles the finite-quotient data and proves the required profinite or pro-\(C\) statement. The quotient-level assertions are stable under passing to smaller open normal subgroups, so they define compatible data in the inverse system of finite quotients. For pro-\(C\) permanence, the construction uses only operations for which the chosen finite group class is closed. Hence the finite verification assembles to the desired profinite map, subgroup, or quotient statement. For categorical constructions such as products, pullbacks, and inverse limits, the universal property is checked by composing with the coordinate projections. The uniqueness part follows because any two candidate maps with the same finite quotient composites have the same value on every separating finite quotient. Existence is obtained by assembling the compatible coordinate maps supplied by the finite quotient construction. The topological assertion is checked by the initial topology of the inverse limit. After composing with each finite-stage projection, the relevant map is a continuous finite-stage homomorphism or an operation on a finite product; compactness, Hausdorffness, total disconnectedness, and profiniteness are then inherited from the finite stages by the standard inverse-limit argument. For quotient and subgroup claims, representatives are chosen in the ambient group and the induced map is checked to send the class of an element to the class of its image. Normality, openness, and membership in the finite quotient class are preserved by the subgroup, quotient, intersection, or inverse-image closure property being invoked.
□def quotientMk (K : Subgroup G) [K.Normal] : G →ₜ* G ⧸ K where
toMonoidHom := QuotientGroup.mk' K
continuous_toFun := continuous_quotient_mk'The quotient projection \(G \to G/K\), bundled as a continuous monoid homomorphism for the quotient topology.
@[simp] theorem quotientMk_apply (K : Subgroup G) [K.Normal] (x : G) :
quotientMk K x = QuotientGroup.mk' K xThe continuous quotient homomorphism evaluates by taking the quotient class of the input element.
Show proof
rflProof. Work with open normal subgroups and finite quotients of the profinite or pro-\(C\) group. Finite quotients separate points, and continuous homomorphisms are determined by their compatible quotient-level maps. For pro-\(C\) claims, the resulting finite quotients lie in \(C\) by the closure property used in the construction: closure under quotients, subgroups, finite products, or extensions. Continuity is checked by composing with all finite quotient projections; each composite is a continuous map between finite or profinite quotient spaces. Compatibility under refinement then assembles the finite-quotient data and proves the required profinite or pro-\(C\) statement. The quotient-level assertions are stable under passing to smaller open normal subgroups, so they define compatible data in the inverse system of finite quotients. For pro-\(C\) permanence, the construction uses only operations for which the chosen finite group class is closed. Hence the finite verification assembles to the desired profinite map, subgroup, or quotient statement. For categorical constructions such as products, pullbacks, and inverse limits, the universal property is checked by composing with the coordinate projections. The uniqueness part follows because any two candidate maps with the same finite quotient composites have the same value on every separating finite quotient. Existence is obtained by assembling the compatible coordinate maps supplied by the finite quotient construction. The topological assertion is checked by the initial topology of the inverse limit. After composing with each finite-stage projection, the relevant map is a continuous finite-stage homomorphism or an operation on a finite product; compactness, Hausdorffness, total disconnectedness, and profiniteness are then inherited from the finite stages by the standard inverse-limit argument.
□theorem isOpenMap_of_surjective_compact_t2
[IsTopologicalGroup G] [IsTopologicalGroup H] [CompactSpace G] [T2Space H]
(f : G →ₜ* H) (hf : Function.Surjective f) :
IsOpenMap fA continuous surjective homomorphism from a compact group to a Hausdorff topological group is an open map.
Show proof
by
intro U hU
have hq : Topology.IsQuotientMap f :=
f.continuous_toFun.isClosedMap.isQuotientMap f.continuous_toFun hf
refine (hq.isOpen_preimage).1 ?_
have hpre :
f ⁻¹' (f '' U) =
⋃ k : f.toMonoidHom.ker, (fun x : G => x * k.1) '' U := by
ext z
constructor
· intro hz
rcases hz with ⟨u, huU, huf⟩
refine Set.mem_iUnion.2
⟨⟨u⁻¹ * z, ?_⟩, ⟨u, huU, by simp only [mul_inv_cancel_left]⟩⟩
change f.toMonoidHom (u⁻¹ * z) = 1
simp only [coe_toMonoidHom, map_mul, map_inv, MonoidHom.coe_coe, huf, inv_mul_cancel]
· intro hz
rcases Set.mem_iUnion.1 hz with ⟨k, hk⟩
rcases hk with ⟨u, huU, rfl⟩
exact ⟨u, huU, by
change f.toMonoidHom u = f.toMonoidHom (u * k.1)
rw [map_mul, show f.toMonoidHom k.1 = 1 from k.2, mul_one]⟩
rw [hpre]
exact isOpen_iUnion fun k => isOpenMap_mul_right k.1 U hUProof. Work with open normal subgroups and finite quotients of the profinite or pro-\(C\) group. Finite quotients separate points, and continuous homomorphisms are determined by their compatible quotient-level maps. Continuity is checked by composing with all finite quotient projections; each composite is a continuous map between finite or profinite quotient spaces. Compatibility under refinement then assembles the finite-quotient data and proves the required profinite or pro-\(C\) statement. The quotient-level assertions are stable under passing to smaller open normal subgroups, so they define compatible data in the inverse system of finite quotients. For pro-\(C\) permanence, the construction uses only operations for which the chosen finite group class is closed. Hence the finite verification assembles to the desired profinite map, subgroup, or quotient statement. For categorical constructions such as products, pullbacks, and inverse limits, the universal property is checked by composing with the coordinate projections. The uniqueness part follows because any two candidate maps with the same finite quotient composites have the same value on every separating finite quotient. Existence is obtained by assembling the compatible coordinate maps supplied by the finite quotient construction. For surjectivity, choose a representative of the target coordinate and lift it through the underlying surjective group, quotient, or coefficient map. The defining formula for the induced map sends the constructed preimage to the chosen representative at every finite stage, so inverse-limit extensionality gives the required global preimage. The topological assertion is checked by the initial topology of the inverse limit. After composing with each finite-stage projection, the relevant map is a continuous finite-stage homomorphism or an operation on a finite product; compactness, Hausdorffness, total disconnectedness, and profiniteness are then inherited from the finite stages by the standard inverse-limit argument.
□def rangeRestrict (f : G →ₜ* H) : G →ₜ* f.toMonoidHom.range where
toMonoidHom := f.toMonoidHom.rangeRestrict
continuous_toFun := Continuous.subtype_mk f.continuous_toFun fun x => ⟨x, rfl⟩A continuous homomorphism restricts to its range with the induced subtype topology.
@[simp] theorem rangeRestrict_apply (f : G →ₜ* H) (x : G) :
f.rangeRestrict x = f.toMonoidHom.rangeRestrict xThe range-restricted continuous homomorphism evaluates to the image element together with its range-membership proof.
Show proof
rflProof. Work with open normal subgroups and finite quotients of the profinite or pro-\(C\) group. Finite quotients separate points, and continuous homomorphisms are determined by their compatible quotient-level maps. Continuity is checked by composing with all finite quotient projections; each composite is a continuous map between finite or profinite quotient spaces. Compatibility under refinement then assembles the finite-quotient data and proves the required profinite or pro-\(C\) statement. The quotient-level assertions are stable under passing to smaller open normal subgroups, so they define compatible data in the inverse system of finite quotients. For pro-\(C\) permanence, the construction uses only operations for which the chosen finite group class is closed. Hence the finite verification assembles to the desired profinite map, subgroup, or quotient statement. For categorical constructions such as products, pullbacks, and inverse limits, the universal property is checked by composing with the coordinate projections. The uniqueness part follows because any two candidate maps with the same finite quotient composites have the same value on every separating finite quotient. Existence is obtained by assembling the compatible coordinate maps supplied by the finite quotient construction. The topological assertion is checked by the initial topology of the inverse limit. After composing with each finite-stage projection, the relevant map is a continuous finite-stage homomorphism or an operation on a finite product; compactness, Hausdorffness, total disconnectedness, and profiniteness are then inherited from the finite stages by the standard inverse-limit argument. For pro-\(C\) claims, the finite quotient obtained from the construction remains in \(C\) by the relevant closure axiom, such as closure under subgroups, quotients, finite products, or extensions. The universal or lifting property is then checked on the prescribed generators, and uniqueness follows because the generators are dense or topologically generating.
□@[simp] theorem coe_rangeRestrict_apply (f : G →ₜ* H) (x : G) :
(f.rangeRestrict x : H) = f xCoercing the range-restricted homomorphism back to the codomain recovers the original homomorphism value.
Show proof
rflProof. Work with open normal subgroups and finite quotients of the profinite or pro-\(C\) group. Finite quotients separate points, and continuous homomorphisms are determined by their compatible quotient-level maps. Continuity is checked by composing with all finite quotient projections; each composite is a continuous map between finite or profinite quotient spaces. Compatibility under refinement then assembles the finite-quotient data and proves the required profinite or pro-\(C\) statement. The quotient-level assertions are stable under passing to smaller open normal subgroups, so they define compatible data in the inverse system of finite quotients. For pro-\(C\) permanence, the construction uses only operations for which the chosen finite group class is closed. Hence the finite verification assembles to the desired profinite map, subgroup, or quotient statement. For categorical constructions such as products, pullbacks, and inverse limits, the universal property is checked by composing with the coordinate projections. The uniqueness part follows because any two candidate maps with the same finite quotient composites have the same value on every separating finite quotient. Existence is obtained by assembling the compatible coordinate maps supplied by the finite quotient construction. The topological assertion is checked by the initial topology of the inverse limit. After composing with each finite-stage projection, the relevant map is a continuous finite-stage homomorphism or an operation on a finite product; compactness, Hausdorffness, total disconnectedness, and profiniteness are then inherited from the finite stages by the standard inverse-limit argument. For pro-\(C\) claims, the finite quotient obtained from the construction remains in \(C\) by the relevant closure axiom, such as closure under subgroups, quotients, finite products, or extensions. The universal or lifting property is then checked on the prescribed generators, and uniqueness follows because the generators are dense or topologically generating.
□theorem isClosed_ker [T1Space H] (f : G →ₜ* H) :
IsClosed ((f.toMonoidHom.ker : Subgroup G) : Set G)The kernel of a continuous homomorphism to a \(T_1\) group is closed.
Show proof
by
simpa [MonoidHom.mem_ker] using
(isClosed_singleton (x := (1 : H))).preimage f.continuous_toFunProof. Work with open normal subgroups and finite quotients of the profinite or pro-\(C\) group. Finite quotients separate points, and continuous homomorphisms are determined by their compatible quotient-level maps. Closed-subgroup and subgroup-permanence claims use ambient open-normal approximation: an open normal subgroup of the closed subgroup is refined by the intersection with an ambient open normal subgroup of \(G\). Continuity is checked by composing with all finite quotient projections; each composite is a continuous map between finite or profinite quotient spaces. Kernel and image statements are verified after quotienting by sufficiently small open normal subgroups, where they become ordinary finite group calculations. Compatibility under refinement then assembles the finite-quotient data and proves the required profinite or pro-\(C\) statement. The quotient-level assertions are stable under passing to smaller open normal subgroups, so they define compatible data in the inverse system of finite quotients. For pro-\(C\) permanence, the construction uses only operations for which the chosen finite group class is closed. Hence the finite verification assembles to the desired profinite map, subgroup, or quotient statement. For categorical constructions such as products, pullbacks, and inverse limits, the universal property is checked by composing with the coordinate projections. The uniqueness part follows because any two candidate maps with the same finite quotient composites have the same value on every separating finite quotient. Existence is obtained by assembling the compatible coordinate maps supplied by the finite quotient construction. The topological assertion is checked by the initial topology of the inverse limit. After composing with each finite-stage projection, the relevant map is a continuous finite-stage homomorphism or an operation on a finite product; compactness, Hausdorffness, total disconnectedness, and profiniteness are then inherited from the finite stages by the standard inverse-limit argument.
□theorem isClosed_range [CompactSpace G] [T2Space H] (f : G →ₜ* H) :
IsClosed ((f.toMonoidHom.range : Subgroup H) : Set H)The range of a continuous homomorphism from a compact space to a Hausdorff space is closed.
Show proof
by
have himage : IsCompact (f '' (Set.univ : Set G)) :=
isCompact_univ.image f.continuous_toFun
have hEq : f '' (Set.univ : Set G) = ((f.toMonoidHom.range : Subgroup H) : Set H) := by
ext y
constructor
· rintro ⟨x, _hx, rfl⟩
exact ⟨x, rfl⟩
· rintro ⟨x, rfl⟩
exact ⟨x, trivial, rfl⟩
exact (hEq ▸ himage).isClosedProof. Work with open normal subgroups and finite quotients of the profinite or pro-\(C\) group. Finite quotients separate points, and continuous homomorphisms are determined by their compatible quotient-level maps. Closed-subgroup and subgroup-permanence claims use ambient open-normal approximation: an open normal subgroup of the closed subgroup is refined by the intersection with an ambient open normal subgroup of \(G\). Continuity is checked by composing with all finite quotient projections; each composite is a continuous map between finite or profinite quotient spaces. Compatibility under refinement then assembles the finite-quotient data and proves the required profinite or pro-\(C\) statement. The quotient-level assertions are stable under passing to smaller open normal subgroups, so they define compatible data in the inverse system of finite quotients. For pro-\(C\) permanence, the construction uses only operations for which the chosen finite group class is closed. Hence the finite verification assembles to the desired profinite map, subgroup, or quotient statement. For categorical constructions such as products, pullbacks, and inverse limits, the universal property is checked by composing with the coordinate projections. The uniqueness part follows because any two candidate maps with the same finite quotient composites have the same value on every separating finite quotient. Existence is obtained by assembling the compatible coordinate maps supplied by the finite quotient construction. The topological assertion is checked by the initial topology of the inverse limit. After composing with each finite-stage projection, the relevant map is a continuous finite-stage homomorphism or an operation on a finite product; compactness, Hausdorffness, total disconnectedness, and profiniteness are then inherited from the finite stages by the standard inverse-limit argument.
□