The short answer
A set of generators is a description of a subgroup, not a list of all its members. This distinction makes an elementary example useful before reading a general intersection bound.
Record comparison
Lists do not exhaust generated elements
Keep the historical record distinct from the stipulated model.
| Question | Record or stipulated input | Consequence and limit |
|---|---|---|
| Displayed lists | {a², b} and {a, b²} | No identical displayed generator. |
| Generated intersection | <a², b²> | Rank 2 by the original normal-form argument. |
| Bound evaluated | m=n=2 | N≤3; one example is not a general proof. |
Chronology
A timeline of the turning points
Addendum
The selected one-page correction was published.
A short historical addendum
Neumann’s one-page addendum credits A. G. Howson’s finite-generation proof and R. Baer’s observation. For subgroup ranks m, n and intersection rank N, it gives N≤2mn−2m−2n+3 without the earlier extra restriction.
The selected record is a compact correction to an argument, not the entire earlier paper or the later proof history of stronger bounds. The example below checks an instance and a misconception, not the theorem.
Sources for this section: [1]
An original normal-form example
Work in the free group F(a, b). A word is reduced by cancelling adjacent inverse pairs; no other relations are imposed. Define H=<a², b> and K=<a, b²>. Their displayed generator lists share no identical word. Yet a² and b² belong to both generated subgroups.
A reduced word lies in H exactly when every maximal run of a letters has an even exponent. It lies in K exactly when every maximal run of b letters has an even exponent. Explain these criteria using the displayed generators and cancellation.
Sources for this section: [1]
Reference answer and the intersection
Every product of a² and b has even a-runs after reduction; conversely, a reduced word with even a-runs can be written using a² and b and their inverses. The same argument with a and b exchanged applies to K.
Belonging to both therefore requires every a-run and b-run to have even exponent. Such words are exactly <a², b²>. The two generators are free: a nonempty alternating reduced word in their powers expands to a nonempty reduced word in F(a, b). The intersection consequently has rank 2, not rank 0.
Sources for this section: [1]
Compare the bound without proving it
Here m=n=2. Substitution into the displayed historical bound gives N≤8−4−4+3=3. Our intersection has N=2, satisfying that inequality. A valid example does not prove a universal bound, and a strict inequality here does not show the bound is optimal.
The useful outcome is a reading discipline grounded in actual algebra: generator presentations, subgroup membership and subgroup rank are different objects. Comparing two short strings is not an intersection algorithm for all their generated elements.
Sources for this section: [1]
Continue the chronology
Related history guides
Biography context
Explore Australia through connected lives
Connected biographies
The working life behind the record
Quick answers
Common questions
- Does the exercise prove Neumann’s bound?
- No. It proves the intersection for one explicit pair and substitutes its ranks into the stated inequality.
- Does a word disappear just because it is absent from the displayed generator list?
- No. Products and inverses create many additional subgroup elements.
Primary and institutional sources
How this history was checked
Selected records support the historical discussion. Invented inputs and original answers are labelled; no complete uninspected work is claimed. This article was reviewed on 31 October 2026.