Module

ProfiniteBidual.lean

Nyll.ProCGroups.Abelian.ProfiniteBidual
7 declarations indexed from sourceView source ↗

Pontryagin biduality for profinite abelian groups

Every circle-valued character factors through a finite quotient, because the circle has no subgroup contained in a sufficiently small arc. Finite duality therefore solves any finite set of evaluation equations. Compactness solves all of them simultaneously. Finite quotients also prove injectivity, giving the actual topological bidual isomorphism, including finite torsion.

Declarations

ProCGroups.Duality.exists_openNormal_le_character_ker

A continuous circle-valued character on a profinite group kills an open normal subgroup.

Source context 5 commands

Surrounding namespaces, section variables, and local commands at this declaration.

noncomputable section
open ProCGroups.ProC
namespace ProCGroups.Duality
universe u
variable {G : Type u} [CommGroup G] [TopologicalSpace G]
  [IsTopologicalGroup G] [CompactSpace G] [TotallyDisconnectedSpace G]
theorem exists_openNormal_le_character_ker (χ : PontryaginDual G) :
    ∃ U : OpenNormalSubgroup G, (U : Subgroup G) ≤ χ.toMonoidHom.ker
ProCGroups.Duality.exists_openNormal_le_character_kers

A finite family of continuous characters factors through a common finite quotient.

Source context 5 commands

Surrounding namespaces, section variables, and local commands at this declaration.

noncomputable section
open ProCGroups.ProC
namespace ProCGroups.Duality
universe u
variable {G : Type u} [CommGroup G] [TopologicalSpace G]
  [IsTopologicalGroup G] [CompactSpace G] [TotallyDisconnectedSpace G]
theorem exists_openNormal_le_character_kers (s : Finset (PontryaginDual G)) :
    ∃ U : OpenNormalSubgroup G, ∀ χ ∈ s, (U : Subgroup G) ≤ χ.toMonoidHom.ker
ProCGroups.Duality.exists_finite_evaluation

Each finite family of bidual evaluation equations has a solution in the original group.

Source context 5 commands

Surrounding namespaces, section variables, and local commands at this declaration.

noncomputable section
open ProCGroups.ProC
namespace ProCGroups.Duality
universe u
variable {G : Type u} [CommGroup G] [TopologicalSpace G]
  [IsTopologicalGroup G] [CompactSpace G] [TotallyDisconnectedSpace G]
theorem exists_finite_evaluation (η : PontryaginDual (PontryaginDual G))
    (s : Finset (PontryaginDual G)) : ∃ g : G, ∀ χ ∈ s, χ g = η χ
ProCGroups.Duality.profinite_bidualEvaluation_surjective

Compactness turns finite evaluation solvability into surjectivity onto the actual bidual.

Source context 5 commands

Surrounding namespaces, section variables, and local commands at this declaration.

noncomputable section
open ProCGroups.ProC
namespace ProCGroups.Duality
universe u
variable {G : Type u} [CommGroup G] [TopologicalSpace G]
  [IsTopologicalGroup G] [CompactSpace G] [TotallyDisconnectedSpace G]
theorem profinite_bidualEvaluation_surjective :
    Function.Surjective (bidualEvaluation G)
ProCGroups.Duality.profinite_bidualEvaluation_injective

Finite quotient characters separate distinct elements of a profinite abelian group.

Source context 5 commands

Surrounding namespaces, section variables, and local commands at this declaration.

noncomputable section
open ProCGroups.ProC
namespace ProCGroups.Duality
universe u
variable {G : Type u} [CommGroup G] [TopologicalSpace G]
  [IsTopologicalGroup G] [CompactSpace G] [TotallyDisconnectedSpace G]
theorem profinite_bidualEvaluation_injective :
    Function.Injective (bidualEvaluation G)
ProCGroups.Duality.profiniteBidualEquiv

A profinite abelian group is canonically isomorphic, with its actual topology, to its Pontryagin double dual. This retains all torsion.

Source context 5 commands

Surrounding namespaces, section variables, and local commands at this declaration.

noncomputable section
open ProCGroups.ProC
namespace ProCGroups.Duality
universe u
variable {G : Type u} [CommGroup G] [TopologicalSpace G]
  [IsTopologicalGroup G] [CompactSpace G] [TotallyDisconnectedSpace G]
def profiniteBidualEquiv : G ≃ₜ* PontryaginDual (PontryaginDual G)
ProCGroups.Duality.profiniteBidualEquiv_apply

The bidual isomorphism is the canonical evaluation pairing.

Source context 5 commands

Surrounding namespaces, section variables, and local commands at this declaration.

noncomputable section
open ProCGroups.ProC
namespace ProCGroups.Duality
universe u
variable {G : Type u} [CommGroup G] [TopologicalSpace G]
  [IsTopologicalGroup G] [CompactSpace G] [TotallyDisconnectedSpace G]
theorem profiniteBidualEquiv_apply (g : G) (χ : PontryaginDual G) :
    profiniteBidualEquiv g χ = χ g