OpenAI reports cyclic-length chromatic fixed-point loss

For every prime p, finite p-group G, subgroup H and height n≥0, the optimal chromatic fixed-point loss from H to G equals the shortest subnormal-chain length from H to G with cyclic quotients.

Sources for this record

What was already known

Sharp loss was known for finite abelian p-groups through the generator rank of G/H. Kuhn and Lloyd proposed cyclic-chain length as the general answer for possibly nonabelian p-groups.

AI involvement AI-led

OpenAI credits itself as manuscript author and states that its internal frontier model produced the results in this release. Individual human input is not detailed enough to establish task-only autonomy.

OpenAI is named as author on the manuscript, and its release attributes the results to an internal frontier model. The individual human input is not detailed enough to establish autonomy.

Importance Major

Resolves the Kuhn–Lloyd equality and makes the optimal loss independent of chromatic height.

Limitations

The embedded subgroup H matters, and the theorem includes height zero. The claim is for finite p-groups, not arbitrary finite groups.

Technical verification Reported

Reported is the default when evidence for a higher level is insufficient. The OpenAI-authored manuscript reports and argues the result, but the reviewed sources do not document a completed check of the full assessed claim.

Human understanding Few

Few is the default when evidence for a higher level is insufficient. No named person is documented as explaining the central argument for this assessed contribution.

Correction and publication history

2026-10-18 · publication

Primary manuscript, attribution, and prior-work review for non-notifying local inclusion; technical verification remains Reported.

Read this published revision