Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passaudited 2026-10-08
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 F=⟨a,b⟩ be the free group on a,b, given the discrete topology, and let A=⟨a⟩ and B=⟨b⟩. Then F=A∗B is the free product of two infinite cyclic groups, Comm⁡F(A)=A and Comm⁡F(B)=B, and for every g∈F, g−1Bg∩A={e}andg−1Ag∩B={e}.

Facts & Assumptions

Given: AC; the free group F on the basis {a,b}; its subgroups A=⟨a⟩ and B=⟨b⟩, with the discrete topology.

[F1]

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).

[F2]

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).

[F3]

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).

[F4]

For an open subgroup H of a topological group G, Comm⁡G(H) consists of those g for which H∩g−1Hg has finite index in both H and g−1Hg (Commensurator, unitary characters and monomial induced representations in the transversal model).

[F5]

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).

[F6]

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).

[F7]

AC says every family of nonempty sets has a choice function (The Axiom of Choice).

[F9]

The cyclic subgroup generated by g is exactly {gn:n∈Z}, and every cyclic subgroup is abelian (⟨g⟩={ gn:n∈Z }, and every cyclic group is abelian).

[F10]

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).

[F12]

A map f:X→Y is continuous at x iff, for every open V⊆Y with f(x)∈V, some open U⊆X contains x and satisfies f[U]⊆V (Continuity of a map of topological spaces at a point and globally).

[F13]

A topological group is a group whose multiplication and inversion are continuous (Topological group: multiplication and inversion are continuous).

Proof

technique · direct
1.1F1F2F3F5F6F8F9

For nonzero k∈Z, the reduced word for ak has length ∣k∣, so [F6] gives ak≠e; the same holds for bk. If am=an, then [F8] gives am−n=e, forcing m=n by the preceding fact; likewise the powers of b are distinct. By [F9], the power maps Z→A and Z→B are surjective, and they are injective by these distinctness arguments; [F8] makes them homomorphisms. Thus A and B are infinite cyclic. By [F5], their free product is free on the canonical copies of a,b. Let ϕ:A∗B→F be induced by the factor inclusions using [F2], and let ψ:F→A∗B send the free basis a,b to those copies using [F1]. The composite ϕψ fixes a,b, so it is idF by [F1]; the composite ψϕ restricts to the identity on each factor, so it is idA∗B by [F2]. Hence ϕ is an isomorphism and we identify F=A∗B. 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.

2.1F3step 1.1

Let g∉A. Its reduced syllable form, after removing an initial and terminal A-syllable when present, is g=a0wa1 with a0,a1∈A and a nonempty reduced word w beginning and ending in nonidentity B-syllables. For x∈A∖{e}, cyclicity of A gives g−1xg=a1−1w−1a0−1xa0wa1=a1−1w−1xwa1. The middle word w−1xw is reduced and contains B-syllables on both ends; multiplication by the outer A-elements cannot cancel those syllables. By [F3] this element is not in A. Therefore g−1Ag∩A={e} for every g∉A. Interchanging A and B gives g−1Bg∩B={e} for every g∉B.

2.2F2step 1.1

In the identification of step 1.1, let ρA:F=A∗B→A be the retraction which is the identity on A and trivial on B, supplied by the universal property [F2]. If g−1bkg=aℓ lies in g−1Bg∩A, then applying ρA gives e=aℓ, so the intersection element is e. Thus g−1Bg∩A={e} for every g. The retraction ρB:F→B proves g−1Ag∩B={e} for every g.

3.1F4F7F10F11F12F13step 1.1step 2.1step 2.2∎

By [F10], every singleton in F is open; by [F11], each singleton rectangle in F×F is open, so the product topology on F×F 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 F a topological group. Every subgroup of F is open by [F10], so the commensurator definition [F4] applies to both A and B. If g∈A, then g−1Ag=A, so both indices in [F4] are 1. If g∉A, step 2.1 gives A∩g−1Ag={e}, whose index in the infinite cyclic group A is infinite; hence g∉Comm⁡F(A). Therefore Comm⁡F(A)=A. The same argument with B gives Comm⁡F(B)=B, 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

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.

Sources