Cyclic length and chromatic fixed-point loss

What OpenAI claims

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.

Paper

1. Cyclic length and chromatic fixed-point loss

   24 September 2026 · Preprint, not peer reviewed · PDF

   OpenAI's abstract 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.

Status

Preprint. The paper has not been independently reviewed. Treat the result as OpenAI's claim until other mathematicians have checked it. If a video exists, it illustrates the statement; it is not the proof.