group_is_complete_mapping
def
A complete mapping of a group G is a permutation θ of G such that x ↦ xθ(x) is also a permutation of G.
Statement
def group_is_complete_mapping {G : Type*} [Group G] (θ : G → G) : Prop
- Defined in
- arXiv:2610.17631 (Complete mappings stabilizing Sylow 2-subgroups in central quotients of special linear groups), Sec. 1 (definition of a complete mapping).
- Verified
- 16 Oct 2026
- Axioms
- none listed
- Used by 6
- group_is_complete_mapping_id_zmod_threeIn the cyclic group of order 3 the identity map is a complete mapping (x ↦ x² is a bijection in odd order).
- cayley_table_graph_exists_complete_mapping_of_transversalIf the Cayley table graph of a finite group G contains a transversal of cardinality |G|, then G admits a complete mapping.
- group_cayley_table_chromatic_number_ne_succFor every finite group G, the chromatic number of its Cayley table Latin square graph is not equal to |G| + 1.
- exists_complete_mapping_stabilizing_sylow_two_of_normalLet G be a finite group, N a normal subgroup and P a Sylow 2-subgroup of G. If N has a complete mapping stabilizing P ∩ N and G/N has a…
- quaternion_odd_has_no_complete_mappingFor every natural number n, the generalized quaternion group QuaternionGroup (2 * n + 1) has no complete mapping.
- cayley_table_graph_chromatic_number_le_card_of_complete_mappingIf a finite group G admits a complete mapping, then the chromatic number of its Cayley table graph is at most |G|.
Lean source view module on GitHub
/-- A complete mapping: `θ` and `x ↦ x * θ x` are both bijections of `G`. -/ def group_is_complete_mapping {G : Type*} [Group G] (θ : G → G) : Prop := Function.Bijective θ ∧ Function.Bijective fun x => x * θ x