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.

Boundary products have controlled representative and basepoint dependence

Statement

Suppose X satisfies the product condition with constant κ0, and use its Gromov-sequence boundary. For any representing sequences xξ,yη, write Po(x,y)=lim infn,m(xnym)o and Bo(ξ,η)=(ξη)o. If finite, these satisfy Bo(ξ,η)2κPo(x,y)Bo(ξ,η). Infinite value for either is equivalent to ξ=η, and then both are infinite for every pair of representatives. Products at basepoints o,o differ by at most d(o,o), understood as two inequalities in the extended nonnegative reals. Moreover Bo(ξ,ζ)min{Bo(ξ,η),Bo(η,ζ)}3κ. For real R put UR(ξ)={η:Bo(ξ,η)>R}. Declare O open when each ξO has some UR(ξ)O. This gives a Hausdorff topology, independent of the basepoint and of replacing supremal products by any supplied representative products. Each UR(ξ) is a neighbourhood, though it need not be open.

Facts & Assumptions

Given: The product inequality with constant κ, and the preceding definitions of joint liminf and supremal boundary product.

[F1]

Gromov-sequence equivalence and its basepoint independence are proved in Asymptotic gromov sequences form an equivalence relation.

Proof

1.1

For representatives xx and yy, two applications of the product inequality give (xnym)omin{(xnxi)o,(xiyj)o,(yjym)o}2κ. Fix any finite A<Po(x,y). By joint liminf, all three entries exceed A when all four indices are sufficiently large: for the first and third use F1 equivalence and for the second use the tail infimum definition. Fix i,j at that common cutoff and let n,m vary over its tail. Then Po(x,y)A2κ. Letting A increase to a finite Po(x,y) gives Po(x,y)Po(x,y)2κ; if the latter is infinite, every finite threshold holds and Po(x,y) is infinite. Interchanging the pairs proves the reverse comparison.

F1givenalgebra
1.2

At two basepoints, expanding products gives (xnym)o(xnym)oD=d(o,o) by the two reverse triangle inequalities. Taking each tail infimum, then its supremum, preserves both inequalities; taking the supremum over the same representing classes does so again. F1 identifies those classes at both basepoints. Thus BoBo+D and BoBo+D, including infinite values.

F1givenalgebra
2.1

Taking the supremum over x,y in step 1.1 yields the displayed 2κ estimate whenever the supremum is finite. If the supremum is infinite, for each finite T some representative pair has product greater than T+2κ; the same comparison forces the fixed pair's product at least T. Thus its product is infinite. Infinite joint liminf is exactly mixed divergence, hence by F1 equality of the classes. Conversely equality of the classes is mixed divergence for every representative pair and gives infinite product. This proves all extended-value assertions without subtracting infinities.

step 1.1F1given
3.1

Fix three representatives x,y,z. For finite A<Po(x,y) and E<Po(y,z), a common cutoff and one fixed bridge index give (xnzm)o>min{A,E}κ on the whole tail. Therefore Po(x,z)min{Po(x,y),Po(y,z)}κ, interpreted through all finite thresholds if necessary. Step 2.1 bounds the two products on the right below by their supremal products minus 2κ. Since Bo(ξ,ζ)Po(x,z), the displayed boundary inequality follows with C=3κ. The same finite-threshold argument handles two infinite entries.

step 2.1givenalgebra
4.1

Write B=Bo and C=3κ. We have ξUR(ξ) and US(ξ)UR(ξ) for SR by step 2.1. If ηUR+C+1(ξ) and ζUR+C+1(η), step 3.1 gives B(ξ,ζ)>R, so UR+C+1(η)UR(ξ). The declared open sets include the empty set and whole boundary, are closed under arbitrary unions, and under finite intersections by using the larger threshold at each point. Thus they form a topology.

step 2.1step 3.1given
5.1

To verify that threshold sets really are neighbourhoods, let V be any set and put V={η:some UT(η)V}. This is a subset of V. If UT(η)V, step 4.1 shows that every ζUT+C+1(η) has UT+C+1(ζ)UT(η)V, so UT+C+1(η)V. Thus V is open. Take V=UR(ξ). Step 4.1 shows UR+C+1(ξ)VUR(ξ). This proves the asserted neighbourhood and interior refinement.

step 4.1
6.1

If ξη, step 2.1 gives B(ξ,η)<. Choose R>B(ξ,η)+C. No point belongs to both UR(ξ) and UR(η), since step 3.1 would force B(ξ,η)>RC. Step 5.1 supplies disjoint open neighbourhoods inside these two sets. Hence the topology is Hausdorff.

step 2.1step 3.1step 5.1
7.1

By step 1.2, UR+Do(ξ)URo(ξ) and the symmetric inclusion holds. These cofinal inclusions show that exactly the same sets are open at either basepoint. For any supplied representatives define VR(ξ) using their mixed liminf. Step 2.1 gives UR+2κ(ξ)VR(ξ)UR(ξ), with equality of the infinite-value cases. This again yields the same open-set criterion in both directions. No simultaneous representative selection is needed for these assertions: they hold for every selection if one is supplied. Empty and singleton boundaries satisfy the same construction, and κ=0 causes no exceptional division.

step 2.1step 1.2step 5.1step 6.1

Depends on

Used by

Dependency tree · two levels

3 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