/-
Copyright 2026 The Formal Conjectures Authors.
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
-/
module
public import FormalConjecturesUtilConjecture 19.25
by B. Curtin, G. R. Pourgholi
Reference: The Kourovka Notebook
[vDJMM26] W. van Doorn, E. Judin, P. Monticone and D. Morrison, On Some Problems from the Kourovka Notebook, arXiv:2607.17477v1, Theorem 4.1.
@[expose] public sectionopen scoped Nat Groupnamespace Kourovka.«19.25»Let $G$ and $H$ be finite groups of the same order with $\sum_{g \in G} \phi(|g|) = \sum_{h \in H} \phi(|h|)$, where $\phi$ is the Euler totient function. Suppose that $G$ is simple. Is $H$ necessarily simple?
The answer is negative by [vDJMM26, Theorem 4.1]. The groups $G = \operatorname{PSU}(3,3)$ and $H = C_6 \times S_4 \times (C_7 \rtimes C_6)$ both have order $6048$ and totient sum $23984$, but only $G$ is simple. In the semidirect product, a generator of $C_6$ acts on $C_7$ by multiplication by $3$ modulo $7$.
@[category research solved, question, AMS 20]
theorem kourovka_19_25 :
¬ ∀ (G H : Type) [Group G] [Group H] [Fintype G] [Fintype H],
Fintype.card G = Fintype.card H →
∑ g : G, φ (orderOf g) = ∑ h : H, φ (orderOf h) →
IsSimpleGroup G → IsSimpleGroup H := ⊢ ¬∀ (G H : Type) [inst : Group G] [inst_1 : Group H] [inst_2 : Fintype G] [inst_3 : Fintype H],
Fintype.card G = Fintype.card H → ∑ g, φ (orderOf g) = ∑ h, φ (orderOf h) → IsSimpleGroup G → IsSimpleGroup H
All goals completed! 🐙end Kourovka.«19.25»