Skip to main content
QUICK REVIEW

[Paper Review] A note on ampleness in the theory of non abelian free groups

Rizos Sklinos|arXiv (Cornell University)|May 21, 2012
Geometric and Algebraic Topology5 references3 citations
TL;DR

This paper provides a simpler, primitive-element-based sequence that witnesses $n$-ampleness in the theory of non-abelian free groups for all $n < \omega$, offering an alternative to the construction in Ould Houcine-Tent (2012). By leveraging JSJ decompositions, algebraic closure, and forking independence, the authors construct a recursive sequence of primitive elements satisfying the full $n$-ampleness conditions, confirming the theory's $n$-ampleness uniformly.

ABSTRACT

Recently Ould Houcine-Tent (see arXiv:1205.0929v2 [math.GR]) proved that the theory of non abelian free groups is $n$-ample for any $n

Motivation & Objective

  • To provide an alternative, simpler witnessing sequence for $n$-ampleness in the theory of non-abelian free groups compared to Ould Houcine-Tent (2012).
  • To demonstrate that $n$-ampleness holds for all $n < \omega$ using only primitive elements, avoiding complex triples.
  • To streamline the proof by relying on geometric tools like JSJ decompositions and known results on algebraic closure and forking in free groups.
  • To establish a self-contained, accessible construction that verifies all conditions of $n$-ampleness via explicit recursive definition.

Proposed method

  • Define a recursive sequence $a_0 = e_1$, $a_{i+1} = a_i[e_{2i+2}, e_{2i+3}]$ using free group generators $e_j$.
  • Use JSJ decompositions relative to the subgroups generated by $a_0, \dots, a_i$ to analyze algebraic closure and forking independence.
  • Apply known results on algebraic closure in free groups: $acl^{eq}(g) = \text{conjugacy classes in } \langle g \rangle$.
  • Verify forking independence via free factorizations: $\mathbb{F}_{2i+3} = \langle e_2, \dots, e_{2i}, e_{2i+1} \rangle * \langle a_i \rangle * \langle e_{2i+2}, e_{2i+3} \rangle$.
  • Confirm that $acl^{eq}(a_0, \dots, a_{i-1}, a_i) \cap acl^{eq}(a_0, \dots, a_{i-1}, a_{i+1}) = acl^{eq}(a_0, \dots, a_{i-1})$ using JSJ-based conjugacy class descriptions.
  • Leverage Theorem 3.7 and Theorem 3.8 to reduce the equality of $eq$-algebraic closures to equality of conjugacy classes in the corresponding subgroups.

Experimental results

Research questions

  • RQ1Can a simpler, primitive-element-based sequence be constructed to witness $n$-ampleness in the theory of non-abelian free groups?
  • RQ2How do JSJ decompositions relative to subgroups generated by initial segments of the sequence help verify the conditions of $n$-ampleness?
  • RQ3To what extent can the algebraic closure and forking independence of primitive elements be characterized in free groups using geometric group theory tools?
  • RQ4Is it possible to replace the complex triples used in Ould Houcine-Tent (2012) with a recursive sequence of primitive elements while preserving $n$-ampleness?

Key findings

  • The sequence $a_0 = e_1$, $a_{i+1} = a_i[e_{2i+2}, e_{2i+3}]$ satisfies all conditions of $n$-ampleness for any $n < \omega$.
  • The construction relies only on primitive elements, making it significantly simpler than the triple-based sequence in Ould Houcine-Tent (2012).
  • Forking between $a_0$ and $a_n$ is verified by showing that the commutator product $[e_2,e_3]\cdots[e_{2n},e_{2n+1}]$ is not generic, hence not primitive.
  • Forking independence over $a_i$ is confirmed via free factorizations that separate $a_{i+1}$ from $a_0, \dots, a_{i-1}$.
  • The intersection of $acl^{eq}$-closures at step $i$ is exactly $acl^{eq}(a_0, \dots, a_{i-1})$, verified using JSJ decompositions and conjugacy class characterizations.
  • The theory of non-abelian free groups is $n$-ample for all $n < \omega$, as established by this new, explicit, and elementary sequence.

Better researchstarts right now

From reading papers to final review, dramatically reduce your research time.

No credit card · Free plan available

This review was created by AI and reviewed by human editors.