1 · The essentials
The manuscript connects a change in topological information with a way of counting steps inside a finite group. Starting with a subgroup of a finite group whose order is a power of a prime, it considers the loss when passing between two fixed-point constructions. Its claimed answer is the smallest number of allowed steps from to . At each step, the smaller group must be normal in the next, and the group describing the difference must be cyclic. Every such step counts once, regardless of the size of that cyclic group. The manuscript states that this answer works at every prime and every nonnegative height, the parameter used to measure the topological information. The repository summary also states that finite spectra witness that the bound cannot be improved. The main result is not formalized in Lean and has not been formally verified.
A picture to help (an imperfect image, not to be taken literally)
As an imperfect image, imagine climbing from one landing to another using only permitted flights of stairs, counting each flight once regardless of how many stairs it contains. The claim is that the smallest possible flight count exactly measures a particular loss of topological information; the image does not explain the fixed-point constructions themselves.
Why it matters
The claimed equality turns an optimal topological loss into a concrete question about chains of subgroups. It also says that the same chain count works at every nonnegative height, rather than requiring a different count at each height. The abstract describes this as a positive resolution of an equality proposed by Kuhn and Lloyd.
2 · Going further
Fix a prime , a finite -group , and a subgroup . The problem is to determine the optimal chromatic loss when passing from geometric -fixed points to geometric -fixed points. The manuscript claims that, at every nonnegative height, this loss equals the shortest length of a subnormal chain with cyclic quotients.
Concretely, the group-theoretic quantity is the minimum number of steps in a chain for which every quotient is cyclic. Each quotient contributes one step, independently of its order. The repository summary states that finite spectra witness sharpness, so the claimed value is an optimum, not merely a bound.
The abstract identifies the equality as one proposed by Kuhn and Lloyd and states that it holds at every prime and every nonnegative height. It does not describe the argument establishing the equality, so no proof mechanism can be extracted from the supplied text. Only the main manuscript is supplied; no companion manuscripts or relationships to them are described.
Useful notions
- Finite groups, subgroups, and prime-power order
- Normal subgroups and quotient groups
- Cyclic groups and subnormal chains
- Geometric fixed points and spectra
- Chromatic height
What was known before / what is new
Before
The abstract attributes the proposed equality to Kuhn and Lloyd. The supplied text does not describe earlier bounds, special cases, or methods.
New
The manuscript claims the equality for every subgroup of every finite -group, at every prime and every nonnegative height. The repository summary emphasizes that cyclic quotients count once regardless of order and that finite spectra witness sharpness.
Limits and assumptions
The stated scope is a subgroup of a finite -group , at nonnegative chromatic heights. The supplied text makes no claim for more general finite groups or other settings and does not identify remaining open questions. It supplies neither an argument nor details of the finite spectra witnessing sharpness. The main result is not formalized in Lean and has not been formally verified.
Mini glossary
- Finite p-group —
- A finite group whose order is a power of a prime p.
- Subnormal chain —
- A chain of subgroups in which each subgroup is normal in the next.
- Cyclic quotient —
- A quotient group generated by a single element.
- Cyclic length —
- Here, the shortest length of a subnormal chain from H to G with cyclic quotients.
- Sharpness —
- The assertion that the stated loss cannot be improved, with finite spectra serving as witnesses in the repository summary.
Keywords : Chromatic fixed-point loss · Cyclic length · Finite p-groups
AI-generated explanation based on the manuscript. Unofficial. Refer to the manuscript for the authoritative version.
3 · Technical details and sources
Claim made in the manuscript (source text)
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.
To be verified: the proof is written in the manuscript, but no software has checked it and no validation by independent mathematicians is established. It may contain errors.
Manuscripts in this family
Cyclic length and chromatic fixed-point loss
24/09/2026For 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.