1 · The essentials
The question is whether equations built from a group's elements can be solved by allowing new elements. A group is a collection with a rule for combining elements and undoing those combinations. The main result says that any finite collection of these equations has a shared solution in a larger group, provided a specific independence test is satisfied. That test counts how often each unknown appears in each equation, with appearances of its inverse counted negatively. The larger group retains the original group without identifying elements that were originally different. The manuscript presents this as resolving Howie's conjecture, and the main result has a Lean formalization. A companion manuscript shows that adding one new generator and one relation cannot collapse a nontrivial group to the group containing only its identity.
A picture to help (an imperfect image, not to be taken literally)
As an imperfect image, imagine expanding a construction kit so that several assembly instructions can all be carried out, while keeping the original pieces distinct. The theorem supplies such an expansion when the instructions pass its independence test; this image does not capture the exact rules of group equations.
Why it matters
The main result applies to arbitrary coefficient groups, rather than imposing a restriction on the starting group. It connects a condition on an equation-counting matrix with the existence of solutions in a larger group. The companion result concerns a related preservation question: whether a single added relation can destroy all nontriviality after one generator is added.
2 · Going further
A system of equations over a group uses unknowns together with fixed elements of that group, called coefficients. The precise hypothesis is that the system is finite and its exponent-sum matrix has full row rank over . Each matrix entry records the total signed exponent of one unknown in one equation. Full row rank means that the rows are linearly independent over the rational numbers; the source calls such a system nonsingular.
The main result states that every such system has a simultaneous solution in an overgroup. The repository summary also states that the coefficient group embeds in the presented quotient: imposing the equations in this construction does not identify distinct elements of the original group. The main manuscript describes this as resolving Howie's conjecture on nonsingular systems. Its abstract states the conclusion but gives no argument or construction details, so the supplied text does not support a more specific account of the proof strategy.
The companion manuscript addresses Kervaire's conjecture. Its statement is that, for a nontrivial group and an infinite cyclic group , no single element normally generates the free product . Equivalently in the repository's description, adjoining one generator and one relation cannot trivialize a nontrivial group. Both manuscripts concern what survives when generators and relations are added, but the supplied abstracts do not describe a derivation of one result from the other.
Useful notions
- Groups and inverses
- Equations with group coefficients
- Matrices and rational linear independence
- Group embeddings and quotients
- Free products and normal generation
What was known before / what is new
Before
The source identifies the nonsingular-systems question as Howie's conjecture. It identifies the one-generator, one-relation nontriviality question as Kervaire's conjecture. No earlier partial results or historical details are supplied.
New
The main manuscript states that every finite nonsingular system over an arbitrary group can be solved simultaneously in an overgroup, with the coefficient group embedding in the presented quotient. The main result has a Lean formalization. The companion manuscript shows the asserted positive resolution of Kervaire's conjecture.
Limits and assumptions
The main theorem requires finitely many equations and full row rank of the exponent-sum matrix over the rational numbers; it asserts solutions in an overgroup, not necessarily in the original group. The source makes no general assertion for systems failing these hypotheses. The main result has a Lean formalization, but the supplied material does not specify its detailed scope or establish that the companion result is formalized. The companion statement requires a nontrivial starting group and concerns one added generator and one relation. No remaining open questions are specified.
Mini glossary
- Overgroup —
- A larger group containing the original group as a subgroup.
- Exponent-sum matrix —
- The matrix whose entry for an equation and an unknown is that unknown's total signed exponent in the equation.
- Nonsingular system —
- A system whose exponent-sum matrix has linearly independent rows over the rational numbers.
- Embedding —
- A map preserving the group operation that sends distinct elements to distinct elements.
- Free product —
- A group combining two groups without adding relations between them beyond their own group relations.
- Normally generated by one element —
- A group is normally generated by one element if the smallest normal subgroup containing that element is the whole group.
Keywords : Group equations · Howie's conjecture · Kervaire's conjecture
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)
Proves that every finite system of equations over an arbitrary group whose exponent-sum matrix has full row rank over ℚ has a simultaneous solution in an overgroup, resolving Howie's conjecture. The coefficient group embeds in the presented quotient. A companion proves Kervaire's conjecture: adjoining one generator and one relation cannot trivialize a nontrivial group.
Verified by Lean: the Lean software checked the part of the reasoning described below, sometimes only part of the manuscript. This does not mean independent mathematicians have validated the result.
Manuscripts in this family
Nonsingular systems of equations over arbitrary groups
05/10/2026Every finite nonsingular system of equations over an arbitrary group has a simultaneous solution in an overgroup. This proves Howie's conjecture on nonsingular systems.
The Kervaire theorem for groups
24/09/2026We prove that no free product of a nontrivial group with an infinite cyclic group is normally generated by one element. This resolves the Kervaire conjecture positively.