How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
The two cyclic basis factors of the rank-two free group are self-commensurating with trivial cross-conjugate intersections
Statement
Assume the Axiom of Choice. Let be the free group on , given the discrete topology, and let and . Then is the free product of two infinite cyclic groups, and , and for every ,
Facts & Assumptions
Given: AC; the free group on the basis ; its subgroups and , with the discrete topology.
A free group on a set has the universal property that each map from its basis to a group extends uniquely to a homomorphism (Free group on a set of generators).
A free product has the universal property for homomorphisms from each factor into a common group (The free product of an arbitrary family of groups).
Every element of a free product has a unique reduced syllable expression; the identity has the empty word and no nonempty reduced word is the identity (Normal form theorem for free products).
For an open subgroup of a topological group , consists of those for which has finite index in both and (Commensurator, unitary characters and monomial induced representations in the transversal model).
A free product of infinite cyclic groups is a free group on one generator from each factor (A free product of copies of the infinite cyclic group is a free group).
In a free group with a free basis, the word length is the length of the reduced word (With respect to a free basis, the word length of an element is the length of its reduced word).
AC says every family of nonempty sets has a choice function (The Axiom of Choice).
Integer powers in a group satisfy and for integers (Powers : natural exponents in a monoid and integer exponents in a group, with , Exponent laws in a group: and for all , and when and commute).
The cyclic subgroup generated by is exactly , and every cyclic subgroup is abelian (, and every cyclic group is abelian).
The discrete topology on a set consists of all its subsets, so every subset is open (The discrete, indiscrete, cofinite, cocountable, particular-point and Sierpinski topologies).
In the binary product topology, products of open sets are basic open sets (The product set of functions choosing a point in each factor, the projections, the box topology, and the product topology as the initial topology of the projections; the empty product is a one-point space).
A map is continuous at iff, for every open with , some open contains and satisfies (Continuity of a map of topological spaces at a point and globally).
A topological group is a group whose multiplication and inversion are continuous (Topological group: multiplication and inversion are continuous).
Proof
For nonzero , the reduced word for has length , so [F6] gives ; the same holds for . If , then [F8] gives , forcing by the preceding fact; likewise the powers of are distinct. By [F9], the power maps and are surjective, and they are injective by these distinctness arguments; [F8] makes them homomorphisms. Thus and are infinite cyclic. By [F5], their free product is free on the canonical copies of . Let be induced by the factor inclusions using [F2], and let send the free basis to those copies using [F1]. The composite fixes , so it is by [F1]; the composite restricts to the identity on each factor, so it is by [F2]. Hence is an isomorphism and we identify . The factor maps are injective because each nonidentity factor element is a nonempty reduced word by [F3], which also gives the reduced syllable normal form.
Let . Its reduced syllable form, after removing an initial and terminal -syllable when present, is with and a nonempty reduced word beginning and ending in nonidentity -syllables. For , cyclicity of gives . The middle word is reduced and contains -syllables on both ends; multiplication by the outer -elements cannot cancel those syllables. By [F3] this element is not in . Therefore for every . Interchanging and gives for every .
In the identification of step 1.1, let be the retraction which is the identity on and trivial on , supplied by the universal property [F2]. If lies in , then applying gives , so the intersection element is . Thus for every . The retraction proves for every .
By [F10], every singleton in is open; by [F11], each singleton rectangle in is open, so the product topology on is discrete. For either multiplication or inversion, every open set containing the image of a point has an open preimage containing that point, because the domain is discrete; [F12] therefore gives continuity. Thus [F13] makes a topological group. Every subgroup of is open by [F10], so the commensurator definition [F4] applies to both and . If , then , so both indices in [F4] are . If , step 2.1 gives , whose index in the infinite cyclic group is infinite; hence . Therefore . The same argument with gives , and step 2.2 gives the two cross-factor intersections in the statement. AC is the stated inherited assumption [F7]; the proof steps use no further choice.
Remarks
- Bekka–de la Harpe, Example 1.F.14(1), states the self-commensurator conclusion but leaves its verification implicit. The normal-form argument above proves the required same-factor malnormality, while the two cross-factor claims use separate retractions.
- The general monomial representation criterion in Theorem 1.F.16 is context; it does not establish the free-group normal-form or cross-factor claims.
Depends on
- Free group on a set of generators
- The free product of an arbitrary family of groups
- Normal form theorem for free products
- Commensurator, unitary characters and monomial induced representations in the transversal model
- A free product of copies of the infinite cyclic group is a free group
- With respect to a free basis, the word length of an element is the length of its reduced word
- The Axiom of Choice
- Powers $g^{n}$: natural exponents in a monoid and integer exponents in a group, with $g^{0} = e$
- Exponent laws in a group: $g^{m+n} = g^{m}g^{n}$ and $(g^{m})^{n} = g^{mn}$ for all $m, n \in \mathbb{Z}$, and $(gh)^{n} = g^{n}h^{n}$ **when $g$ and $h$ commute**
- $\langle g \rangle = \{\, g^{n} : n \in \mathbb{Z} \,\}$, and every cyclic group is abelian
- The discrete, indiscrete, cofinite, cocountable, particular-point and Sierpinski topologies
- The product set $\prod_{i \in I} X_i$ of functions choosing a point in each factor, the projections, the box topology, and the product topology as the initial topology of the projections; the empty product is a one-point space
- Continuity of a map of topological spaces at a point and globally
- Topological group: multiplication and inversion are continuous
Used by
Dependency tree · two levels
63 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.