The Polish permutation group and its image-subgroup coset relations
DefinitionFSCofinalityCosets20261102The group is the actual group of permutations of the natural numbers. Its standard topology is represented by the permutation and inverse permutation coordinates in two copies of Baire space; Polishness and continuity of the group operations are proved. The sigma algebra is its native Borel sigma algebra. For any subgroup H, p and q are equivalent exactly when q inverse times p belongs to H. For a homomorphism from a subgroup, the image coset relation uses its actual algebraic range. No closedness, normality, or additional topology is imposed on that range by these definitions.
import Definitions.Def_FSCofinalityStructures20261102
import Mathlib.GroupTheory.Perm.Basic
import Mathlib.Topology.Algebra.Group.Basic
import Mathlib.Topology.MetricSpace.PiNat
set_option autoImplicit false
noncomputable section
open Set Topology TopologicalSpace Filter
namespace FSCofinality
/-- The full symmetric group of the natural numbers. -/
def PermutationGroup := Equiv.Perm ℕ
instance : Group PermutationGroup := inferInstanceAs (Group (Equiv.Perm ℕ))
/-- A permutation is coded by its function and inverse function. -/
def permutationCoordinates (p : PermutationGroup) : (ℕ → ℕ) × (ℕ → ℕ) :=
(p.toFun,p.invFun)
/-- The usual permutation topology: pointwise convergence of a permutation
and its inverse, as a subspace of two copies of Baire space. -/
instance : TopologicalSpace PermutationGroup :=
TopologicalSpace.induced permutationCoordinates inferInstance
instance : MeasurableSpace PermutationGroup := borel PermutationGroup
instance : BorelSpace PermutationGroup := ⟨rfl⟩
theorem continuous_permutationCoordinates : Continuous permutationCoordinates :=
continuous_induced_dom
theorem permutationCoordinates_injective : Function.Injective permutationCoordinates := by
intro p q h
apply Equiv.ext
intro n
exact congrFun (congrArg Prod.fst h) n
/-- Evaluation with a varying natural-number index is continuous. -/
theorem continuous_baire_evaluation :
Continuous (fun p : (ℕ → ℕ) × ℕ => p.1 p.2) := by
apply continuous_iff_continuousAt.mpr
intro p
have heq : ∀ᶠ q : (ℕ → ℕ) × ℕ in 𝓝 p, q.2 = p.2 :=
(continuous_snd.tendsto p).eventually ((isOpen_discrete {p.2}).mem_nhds rfl)
have h : ContinuousAt (fun q : (ℕ → ℕ) × ℕ => q.1 p.2) p :=
((continuous_apply p.2).comp continuous_fst).continuousAt
apply h.congr_of_eventuallyEq
filter_upwards [heq] with q hq
rw [hq]
def InversePairCondition (p : (ℕ → ℕ) × (ℕ → ℕ)) : Prop :=
(∀ n, p.1 (p.2 n) = n) ∧ (∀ n, p.2 (p.1 n) = n)
theorem isClosed_inversePairCondition :
IsClosed {p : (ℕ → ℕ) × (ℕ → ℕ) | InversePairCondition p} := by
have hf : ∀ n, Continuous (fun p : (ℕ → ℕ) × (ℕ → ℕ) => p.1 (p.2 n)) :=
fun n => continuous_baire_evaluation.comp
(continuous_fst.prodMk ((continuous_apply n).comp continuous_snd))
have hg : ∀ n, Continuous (fun p : (ℕ → ℕ) × (ℕ → ℕ) => p.2 (p.1 n)) :=
fun n => continuous_baire_evaluation.comp
(continuous_snd.prodMk ((continuous_apply n).comp continuous_fst))
have hleft : IsClosed {p : (ℕ → ℕ) × (ℕ → ℕ) | ∀ n, p.1 (p.2 n) = n} := by
simp only [setOf_forall]
exact isClosed_iInter (fun n => isClosed_eq (hf n) continuous_const)
have hright : IsClosed {p : (ℕ → ℕ) × (ℕ → ℕ) | ∀ n, p.2 (p.1 n) = n} := by
simp only [setOf_forall]
exact isClosed_iInter (fun n => isClosed_eq (hg n) continuous_const)
exact hleft.inter hright
theorem range_permutationCoordinates :
range permutationCoordinates = {p | InversePairCondition p} := by
ext p
constructor
· rintro ⟨q,rfl⟩
exact ⟨q.apply_symm_apply,q.symm_apply_apply⟩
· rintro ⟨hf,hg⟩
exact ⟨⟨p.1,p.2,hg,hf⟩,rfl⟩
instance : PolishSpace PermutationGroup := by
letI : PolishSpace (ℕ → ℕ) := {
toSecondCountableTopology := inferInstance
toIsCompletelyMetrizableSpace := inferInstance }
apply Topology.IsClosedEmbedding.polishSpace (f := permutationCoordinates)
exact ⟨permutationCoordinates_injective.isEmbedding_induced,
range_permutationCoordinates ▸ isClosed_inversePairCondition⟩
theorem continuous_permutation_mul :
Continuous (fun p : PermutationGroup × PermutationGroup => p.1 * p.2) := by
apply continuous_induced_rng.mpr
apply Continuous.prodMk
· apply continuous_pi
intro n
exact continuous_baire_evaluation.comp
(((continuous_permutationCoordinates.comp continuous_fst).fst).prodMk
((continuous_apply n).comp ((continuous_permutationCoordinates.comp continuous_snd).fst)))
· apply continuous_pi
intro n
exact continuous_baire_evaluation.comp
(((continuous_permutationCoordinates.comp continuous_snd).snd).prodMk
((continuous_apply n).comp ((continuous_permutationCoordinates.comp continuous_fst).snd)))
theorem continuous_permutation_inv : Continuous (fun p : PermutationGroup => p⁻¹) := by
apply continuous_induced_rng.mpr
exact continuous_permutationCoordinates.snd.prodMk continuous_permutationCoordinates.fst
instance : IsTopologicalGroup PermutationGroup where
continuous_mul := continuous_permutation_mul
continuous_inv := continuous_permutation_inv
/-- Left-coset equivalence, with the manuscript's orientation. -/
def CosetRelation (H : Subgroup PermutationGroup) (p q : PermutationGroup) : Prop :=
q⁻¹ * p ∈ H
def cosetRelation (H : Subgroup PermutationGroup) : CodedRelation where
Carrier := PermutationGroup
measurableSpace := inferInstance
rel := CosetRelation H
/-- Cosets of the actual algebraic image of a subgroup homomorphism. -/
def imageCosetRelation {G : Subgroup PermutationGroup} (π : G →* PermutationGroup) :
CodedRelation := cosetRelation π.range
end FSCofinality
Read-back
What the Lean code literally says, in plain math · Codex (GPT-6 family; exact runtime model identifier not exposed to auditor)
Blind read-back of Def_FSCofinalityCosets20261102.lean
Exact model identifier: unavailable in the auditor's exposed runtime context. This read-back uses only the target Lean file, its local import Def_FSCofinalityStructures20261102.lean, and the auditor instructions. All declarations below are in the namespace FSCofinality. Write for the natural numbers, including , and for the set of all bijections . Write with the product topology obtained from the discrete topology on each copy of ; has its product topology.
PermutationGroup. This defines the type to be the type of permutations of , that is, equivalences from to itself. Every element carries a forward function and a mutually inverse function on all natural numbers. There is no restriction to permutations with finite support, and there is no separately variable underlying set: the domain is always all of .
Group instance on PermutationGroup. The type receives the existing group structure on permutations of . For every , multiplication is function composition in the order for every ; the identity is the identity function and the group inverse is the inverse bijection. There are no hypotheses on or beyond membership in .
permutationCoordinates. For every , this defines its coordinates to be the ordered pair consisting of its forward function and its inverse function: . Both components are total functions on ; this declaration does not choose a code in a different countable or numerical space.
Topological-space instance on PermutationGroup. The topology on is the topology induced by : its open sets are preimages under of open sets in the product of the two function spaces. Consequently, both finitely many prescribed forward values and finitely many prescribed inverse values give the basic pointwise conditions used by this topology. The declaration uses the ordinary discrete topology on the natural-number coordinates and imposes no other topology on .
Measurable-space instance on PermutationGroup. The measurable sets of are defined to be the Borel -algebra of the topology induced by into . This is the -algebra generated by the open sets of that topology, with no measure specified.
Borel-space instance on PermutationGroup. The chosen measurable-space structure on is certified to equal the Borel -algebra of the chosen topology on . This is an equality of the measurable structure with that Borel structure; it is not a claim about the measurability of an arbitrary relation on .
continuous_permutationCoordinates. The map , , is continuous when has the topology induced by this map and each copy of has its product topology of discrete natural-number coordinates. There are no additional hypotheses.
permutationCoordinates_injective. For every , equality as ordered pairs of functions on implies as permutations. Thus the coordinate map is injective; there are no additional hypotheses or exceptional indices.
continuous_baire_evaluation. The evaluation map given by is continuous, where has its product topology, has its discrete topology, and the domain has the product topology. Both the function and the index vary over the entire indicated domain, including index ; no injectivity, surjectivity, or inverse-function hypothesis is imposed on .
InversePairCondition. For an arbitrary pair , this predicate means that both compositions are the identity on every natural number:
Both directions are required simultaneously, including at . The input functions are initially arbitrary total functions on ; satisfaction of this predicate makes them mutual inverses.
isClosed_inversePairCondition. In with the product topology of pointwise convergence on discrete , the subset of all pairs satisfying and for every is closed. The theorem ranges over the full ambient function-pair space through its set definition and has no additional hypotheses on a pair or on a restricted family of pairs.
range_permutationCoordinates. The image of is exactly the set of all mutually inverse function pairs:
Thus every permutation supplies such a pair, and every pair satisfying both displayed identities is the coordinate pair of a permutation. This is equality with the actual image, not with its closure, and the displayed identities apply to all natural numbers.
Polish-space instance on PermutationGroup. The type , with the topology induced by into , is a Polish space: its topology is second countable and admits a compatible complete metric. This instance supplies these topological properties without specifying a particular metric in the declaration. There are no subgroup hypotheses or restrictions on the allowed permutations. The underlying space is nonempty, since the identity permutation is an element.
continuous_permutation_mul. The group multiplication map , , is continuous, with both factors and the target carrying the induced permutation topology and the domain carrying the product topology. In forward-function coordinates this sends to the function ; its inverse-function coordinate is . The theorem holds on the entire product, with no restrictions on and .
continuous_permutation_inv. The map sending every permutation to its group inverse is continuous for the induced permutation topology. On the coordinates this map interchanges the two functions. There are no additional hypotheses.
Topological-group instance on PermutationGroup. The already specified permutation group and its already specified induced topology satisfy the topological-group axioms requiring joint continuity of multiplication and continuity of inversion . These are the operations of the inherited permutation group structure, and the continuity assertions apply to all elements. This declaration introduces no topology on any subgroup or coset quotient.
CosetRelation. For every subgroup of and every pair , this defines the proposition
With the inherited composition law this tests whether the permutation belongs to ; equivalently, it tests whether , or whether the left cosets and agree. The subgroup is an arbitrary algebraic subgroup, with no hypothesis of being closed, Borel, countable, or proper. In particular, the trivial subgroup gives equality of permutations, and the whole group gives a relation that holds on every pair. A subgroup contains the identity and therefore cannot be empty. This declaration is a predicate definition; it does not include separate theorem declarations proving reflexivity, symmetry, transitivity, or Borelness of its graph.
cosetRelation. For every subgroup of , this defines a bundled relation whose carrier is the entire permutation type , whose measurable structure is its Borel -algebra for the induced permutation topology, and whose relation on is . The bundle type used here, CodedRelation, consists only of a carrier type, a measurable-space structure on that carrier, and a two-place proposition on that carrier; it requires neither a Borel graph nor proofs that the proposition is an equivalence relation. No condition on beyond being a subgroup is imposed. The carrier consists of permutations themselves, not of cosets or representatives selected from cosets; for the trivial and whole subgroups, respectively, the bundled relation is equality and the universal relation on this same carrier.
imageCosetRelation. For every subgroup of and every group homomorphism , this defines a bundled relation with carrier , equipped with the Borel -algebra of the induced permutation topology, by using the algebraic image subgroup . Explicitly, for every its relation holds exactly when
Here elements of the domain of are permutations belonging to , with their subgroup group structure, and preserves the identity and multiplication as a group homomorphism. Neither nor is required to be closed, Borel, countable, or proper, and is not required to be continuous, measurable, injective, or surjective. The subgroup used is the actual image, without taking any topological closure. The image is nonempty because it contains the identity; if has trivial image, including when it is the trivial homomorphism, the relation is equality, while if is surjective the relation holds for every pair. As with cosetRelation, the bundle has no field asserting that this relation has a Borel graph, and its carrier is the entire permutation group rather than an image or a quotient.
Confirmed by the mission captain (proposal self-audit).