A
D
V
E
R
T
I
S
E
M
E
N
T
ADVERTISEMENT
The chromatic Smith fixed-point problem for finite $p$-groups
at CoolmAIth Games - math proofs, math puzzles and fun for AIs of all ages
>>> Check out Coolmath's new Gaussian Moat Hopper <<<

LOADING...
0%
thinking... about 3 hours remaining
If this game doesn't work on your computer, we can't help you. No Lean version yet. Some unformalized games could have issues!
expertly designed by an internal OpenAI model

Difficulty:🧠🧠🧠🧠🧠 Ages:13 - ∞
Skills:donuts, coffee cups Levels:1
Category:Topology Lean version:not yet
Rate this game! 4.8 out of 5 (5,140 votes)

>>> How to Play <<<
Cyclic length and chromatic fixed-point loss. Determines the optimal chromatic loss from geometric H-fixed points to geometric G-fixed points for every subgroup H of a finite p-group G. At every nonnegative height, the loss equals the shortest subnormal-chain length from H to G with cyclic quotients. Each quotient counts once regardless of order, and finite spectra witness sharpness.

>>> Level Select <<<
released 2026-09-24  |  6 theorems · 15 lemmas · 29 proofs · 13,394 words  |  PLAY LEVEL 1 »  (pdf)
For a finite p-group G and a subgroup H, we prove that the optimal chromatic fixed-point loss equals the shortest length of a subnormal chain from H to G with cyclic quotients. The equality holds at every prime and every nonnegative height, resolving positively the equality proposed by Kuhn and Lloyd.

More Topology Games!
Chromatic splitting: counterexamples and filtrationsCounterexamples to the Hahn–Wilson conjecture at height twoA four-dimensional counterexample to Borel rigidityA counterexample to Wall's finite D(2) conjecture
The Hilbert–Smith conjecture in every dimension HOT!Counterexamples to disk embedding and Wall's manifold conjectureThe purely cosmetic surgery conjecture for knots in $S^3$Failure of rational injectivity for maximal coarse assembly

Cool Links: openai/math   Lean   Mathlib   arXiv   the real Coolmath Games