Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)
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.

Linear isoperimetry implies uniformly thin geodesic bigons

Statement

Assume the Axiom of Choice. For a finite presentation with relator lengths at most L0 and Area(w)Kw for every null word, K0, the geometric Cayley graph has uniformly slim geodesic triangles, with a constant depending only on K,L. Consequently its geodesic bigons are uniformly thin. The assertion uses the toolkit's labelled unit-edge realization, retaining loops and parallel edges.

In fact, if δ0(K,L) is the common slimness bound for the simple unit-edge Cayley realizations supplied by the uniform filling lemma, then 12δ0(K,L)+8 is a bound for these labelled realizations. No explicit numerical formula for δ0 is asserted.

Facts & Assumptions

Given: The finite presentation, nonnegative K,L, the stated inequality for every null word, and AC.

[F1]

The finite presentation and algebraic relator area mean the quotient by the normal closure and least number of conjugated relators, respectively (Group presentation by generators and relations, Algebraic relator area and the Dehn function of a finite presentation).

[F2]

Under AC the simple unit-edge realization has the common triangle-minsize bound A(K,L)P+7+B(L) by Linear algebraic relator area implies slim Cayley triangles, and the point-wedge argument supplies a common finite slimness bound δ0(K,L) by Filling constants give a uniform slimness bound.

[F3]

The simple realization is geodesic and induces the vertex word metric by Algebraic relator area controls coarse filling area. The labelled realization, including loops and parallel edges, is geodesic and has the same vertex metric by Hg toolkit hyperbolic group and stable length. These metric constructions do not require hyperbolicity as an input.

[F4]

Slimness δ0 implies the product inequality with constant 3δ0 by Slim triangles imply the gromov product inequality. The product and four-point conditions have the same constant by The gromov product inequality implies the four point condition, and a geodesic space with four-point constant κ has 4κ-slim triangles by The four point condition implies slim triangles.

[F5]

AC has the family-of-nonempty-sets meaning of The Axiom of Choice. Its uses in F2 are free-ultrafilter extension, the representative side and violating-triangle selections in the cone criterion, and the countable presentation selection in the uniformity proof.

Proof

1.1

Write X0 for the simple realization and X for the labelled realization of the same presented group and generating alphabet. In X0, identity letters are constant paths and parallel labels share a single edge; in X all prescribed labelled edges are retained. F1 is the identical word/relator convention for both. The inequalities in F2 therefore apply to X0, with the same fixed K,L for every presentation. They give a number δ0=δ0(K,L)0 bounding all its chosen triangles. The common bound, rather than merely a separate bound for each presentation, is exactly the uniformity conclusion of F2 under F5.

F1F2F3F5given
2.1

By F4, X0 satisfies the four-point condition with κ0=3δ0. Since both spaces induce the same word metric on their common vertex set by F3, all vertex quadruples in X satisfy that identical condition. Equivalently, each of their three opposite-pair sums is at most the maximum of the other two plus 2κ0; for a sum that is not largest this is automatic, and for a largest sum it is the four-point hypothesis.

step 1.1F3F4algebra
3.1

For arbitrary points a,b,c,dX, choose a nearest endpoint vertex a^,b^,c^,d^ on each of their unit edges, and use the point itself if it is already a vertex. Each distance to the selected vertex is at most 1/2, including loop edges; these are four finite choices. The triangle inequality yields dX(u,v)dX(u^,v^)1 for each pair. Consequently corresponding opposite-pair sums differ by at most 2. Denote the three sums for the original points by Si and the corresponding vertex sums by S^i, 1i3. For each i, step 2.1 gives SiS^i+2maxjiS^j+2κ0+2maxjiSj+2κ0+4. Thus the largest sum is at most the second-largest plus 2(κ0+2), including ties. This proves the four-point condition on all of X with constant κ0+2.

step 2.1F3algebra
4.1

The geodesicity of X in F3 and F4 now make every chosen triangle in X 4(κ0+2)=12δ0+8-slim. This depends only on K,L, even if many labels represent the same generator or the identity; rounding at a loop uses its shorter half-interval and needs no map collapsing that loop.

step 3.1step 2.1F3F4algebra
5.1

For two specified geodesics from x to y, regard them as two sides of a triangle with vertices x,y,x and with third side the constant segment at x. Step 4.1 places every point of either side within 12δ0+8 of the other side together with x; since x already lies on that other side, their Hausdorff distance is at most this same constant. This includes x=y, constant sides, an empty generating alphabet (a one-vertex group), empty relator sets, K=0 and L=0. All added realization-comparison choices were finite; the assumed AC is used only through F2's explicitly named cone and uniformity selections.

step 4.1F2F3F5given

Depends on

Used by

Dependency tree · two levels

30 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