Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generatedjudge pass (gpt-6-luna)verified 2026-10-22 (gpt-6.1-sol)
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.

PTFA groups satisfy the finite Folner condition without a choice hypothesis

Statement

Every group admitting a finite subnormal series with torsion-free abelian factors satisfies the left Folner condition: for each finite subset S and each ε>0 there exists a finite nonempty subset F with ∣sF△F∣<ε∣F∣ for every s∈S. This assertion requires no countability or finite-generation hypothesis and no choice axiom. More generally the finite Folner condition is preserved by arbitrary group extensions whose kernel and quotient satisfy it.

Facts & Assumptions

Given: The finite Folner condition and a finite PTFA subnormal series.

[F1]

The finite Folner condition is precisely the finite-set and symmetric-difference condition in the Statement (Folner sets and the Folner condition).

[F2]

Finitely generated torsion-free abelian groups are finite-rank free abelian groups (Finite torsion-free abelian freeness by explicit rational coordinates without choice).

[F3]

A PTFA series has each successive subgroup normal in the next, with torsion-free abelian quotient; normality in the final group is not required (Poly-torsion-free abelian groups).

Proof

Given: A finite test set and a positive error tolerance whenever the Folner condition is tested.

1.1F1F2givenconstructalgebra

A torsion-free abelian group satisfies [F1]. Indeed the subgroup generated by a finite test set is isomorphic to Zr by [F2]. For r=0 use the singleton identity set. For r>0 bound every test vector's coordinates in absolute value by M≥0 and take the integer cube En=[−n,n]r∩Zr, with n≥M. A translate by any test vector has intersection with En of cardinality at least (2n+1−M)r, whereas both sets have cardinality (2n+1)r. Thus its relative symmetric difference is at most 2[1−(1−M/(2n+1))r], which tends to zero. The transported cube witnesses the required condition in the original group. All choices concern a single finitely generated subgroup and a finite test set.

1.2F1givenconstruct

Suppose 1→H→G→πQ→1 is any group extension and both H,Q satisfy [F1]. Fix finite S⊆G and ε>0. Choose a finite nonempty (π(S),ε/2)-Folner set E⊆Q. For the finite set E∪π(S)E, choose lifts tq∈G. For each s∈S and q∈E with π(s)q∈E, put hs,q=tπ(s)q−1stq∈H. This is a finite collection of elements of H. Choose a finite nonempty set B⊆H with ∣hs,qB△B∣<(ε/2)∣B∣ for all of them, and let F=⋃q∈EtqB. Its cosets are disjoint, so ∣F∣=∣E∣∣B∣.

2.1F1step 1.2algebra

For s∈S, the cosets present in exactly one of sF,F contribute ∣π(s)E△E∣∣B∣ elements to the symmetric difference. On a common coset indexed by π(s)q, the two subsets are tπ(s)qhs,qB and tπ(s)qB, whose difference has cardinality ∣hs,qB△B∣. There are at most ∣E∣ common cosets. Therefore ∣sF△F∣≤∣π(s)E△E∣∣B∣+∑q∈E, π(s)q∈E∣hs,qB△B∣<ε∣E∣∣B∣=ε∣F∣. This proves the extension assertion for an arbitrary extension; the lifts were not required to form a homomorphism or a global transversal.

3.1F1F3step 1.1step 2.1algebra∎

The trivial group satisfies [F1] using its singleton set. Induct up the given finite subnormal series. At each stage the kernel is the previous subgroup and the quotient is torsion-free abelian, so step 1.1 supplies the quotient condition and step 2.1 supplies the extension condition. This proves [F1] for every PTFA group in the full subnormal convention of [F3]. The construction uses only finitely many witnesses at each of finitely many stages. It constructs finite sets directly, without invariant means, ultrafilters or simultaneous choices over a family of tests, and hence adds no choice hypothesis.

Depends on

Used by

Dependency tree · two levels

8 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