When are Two Subgroups Independent?
Pith reviewed 2026-05-15 12:26 UTC · model grok-4.3
The pith
Two subgroups are independent exactly when any endomorphisms on each extend jointly to an endomorphism of the subgroup they generate.
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
Core claim
Two subgroups A and B are independent if and only if for every endomorphism of A and every endomorphism of B there exists an endomorphism of the subgroup generated by A and B that restricts to the given maps on A and on B respectively. This extension property is offered as the appropriate general definition of subgroup independence, with supporting results that separate it from mere almost-disjointness and that supply partial characterizations plus a practical decision procedure.
What carries the argument
The joint endomorphism extension property, which requires that arbitrary endomorphisms of each subgroup combine into a single endomorphism of the generated subgroup and thereby serves as the definition of independence.
If this is right
- Trivial intersection is necessary but not sufficient for independence.
- Distinct necessary conditions and sufficient conditions for the extension property can be stated in terms of the subgroups.
- A heuristic algorithm decides independence for many explicit groups and subgroup pairs.
- A complete characterization of independent subgroups remains an open question.
Where Pith is reading between the lines
- The definition may coincide with direct-product decompositions when the ambient group is abelian.
- It could be used to classify maximal independent sets of subgroups inside free groups or surface groups.
- Further checks in small non-abelian groups may produce concrete examples that refine the partial conditions.
- The property might interact with the structure of the full endomorphism monoid of the ambient group.
Load-bearing premise
The endomorphism extension property correctly captures the intended notion of independence for subgroups in general groups.
What would settle it
Explicit computation, in a concrete group such as the free group of rank two or the symmetric group S_3, of a pair of almost-disjoint subgroups together with endomorphisms on each that cannot be jointly extended.
read the original abstract
Rosenmann and Ventura asked "What is the right definition of dependence of subgroups for general groups?". Here we aim to answer this question. We consider a definition of subgroup independence which is a special case of a category-theoretic one. It is that: Two subgroups of a group are independent if and only if any two endomorphisms, one acting on each subgroup, can be extended to an endomorphism of the group generated by these subgroups. This definition helps to illuminate that the usual condition of almost disjointness of subgroups (two subgroups $A$ and $B$ are almost disjoint if and only if $A \cap B = \{e\}$, where $e$ is the identity element) is not enough to force independence and here we find necessary and (different) sufficient conditions for subgroup independence. The aim of this note is to introduce this general notion of subgroup independence to the group theory community and to pose the open question of its characterisation. We present the partial results known up to this point. Moreover, we use the progress made so far to give a heuristic algorithm that decides subgroup independence for many cases.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The manuscript introduces a category-theoretic definition of independence for two subgroups A and B of a group G: A and B are independent if and only if any endomorphisms of A and of B extend to an endomorphism of the subgroup they generate. It shows that trivial intersection (almost disjointness) is insufficient for independence, supplies necessary conditions and (distinct) sufficient conditions in restricted cases, presents partial results, describes a heuristic algorithm that decides independence in many instances, and leaves a full characterization as an open question.
Significance. If the partial results and algorithm hold, the work supplies a concrete, category-theoretic notion of subgroup independence that directly addresses the question posed by Rosenmann and Ventura. The explicit separation of necessary from sufficient conditions, together with the heuristic, provides usable tools for further investigation in specific classes of groups (e.g., free groups) and may stimulate classification efforts. The framing as a special case of a standard categorical notion is a clear strength.
major comments (2)
- [Abstract and algorithm section] Abstract and the section presenting the heuristic: the claim that the algorithm 'decides subgroup independence for many cases' is load-bearing for the paper's practical contribution, yet no termination proof, complexity bound, or explicit correctness argument is supplied; without these the utility statement cannot be evaluated.
- [Independence versus almost disjointness] The paragraph showing that almost disjointness does not imply independence: a concrete counter-example (with explicit subgroups and endomorphisms that fail to extend) is required to make the necessity of the new definition rigorous; the current statement remains illustrative rather than demonstrative.
minor comments (2)
- Standardize notation for the join of subgroups and for the extension property throughout; currently the same concept appears under varying symbols.
- [Introduction] Add an explicit citation to the Rosenmann-Ventura question in the introduction so that the motivation is traceable.
Simulated Author's Rebuttal
We thank the referee for the positive evaluation and the precise comments, which highlight areas where the manuscript can be strengthened. We address each major comment below and indicate the revisions we will make.
read point-by-point responses
-
Referee: [Abstract and algorithm section] Abstract and the section presenting the heuristic: the claim that the algorithm 'decides subgroup independence for many cases' is load-bearing for the paper's practical contribution, yet no termination proof, complexity bound, or explicit correctness argument is supplied; without these the utility statement cannot be evaluated.
Authors: We agree that the presentation of the algorithm requires clarification. The algorithm is explicitly described as a heuristic derived from the partial necessary and sufficient conditions established in the paper; it is not claimed to be a complete decision procedure. In the revised manuscript we will (i) state more explicitly that termination and correctness are not guaranteed in general (as that would solve the open characterization problem), (ii) supply concrete examples of group classes (e.g., free groups of small rank) where the procedure succeeds and terminates, and (iii) remove any phrasing that could be read as asserting a general complexity bound. These changes will make the practical scope of the heuristic transparent without overstating its theoretical guarantees. revision: partial
-
Referee: [Independence versus almost disjointness] The paragraph showing that almost disjointness does not imply independence: a concrete counter-example (with explicit subgroups and endomorphisms that fail to extend) is required to make the necessity of the new definition rigorous; the current statement remains illustrative rather than demonstrative.
Authors: We accept this criticism. The current paragraph only sketches why almost disjointness is insufficient; a concrete counter-example will render the argument rigorous. In the revised version we will insert an explicit pair of subgroups A and B of a concrete group G (for instance, suitable subgroups of the free group of rank 2) together with endomorphisms of A and of B that cannot be jointly extended to an endomorphism of the subgroup they generate, while A ∩ B = {e}. This example will be placed immediately after the definition and will be accompanied by a short verification. revision: yes
Circularity Check
No significant circularity identified
full rationale
The paper explicitly introduces a new definition of subgroup independence as a special case of a standard category-theoretic notion (endomorphism extension to the join) and frames the general characterization as an open question. It supplies necessary conditions, separate sufficient conditions in restricted cases, and a heuristic algorithm, without any derivation that reduces by construction to fitted parameters, self-referential equations, or load-bearing self-citations. The central claim is the definition itself plus partial results, all presented as independent of the target characterization.
Axiom & Free-Parameter Ledger
axioms (1)
- domain assumption The category-theoretic definition via endomorphism extension supplies the right notion of subgroup independence.
Lean theorems connected to this paper
-
IndisputableMonolith/Foundation/AbsoluteFloorClosure.leanabsolute_floor_iff_bare_distinguishability unclear?
unclearRelation between the paper passage and the cited Recognition theorem.
A∩N_B={e} and B∩N_A={e} are necessary but not sufficient for independence
What do these tags mean?
- matches
- The paper's claim is directly supported by a theorem in the formal canon.
- supports
- The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
- extends
- The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
- uses
- The paper appears to rely on the theorem as machinery.
- contradicts
- The paper's claim conflicts with a theorem or certificate in the canon.
- unclear
- Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.