Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-22
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.

Aut(U_Q^<) is extremely amenable

Statement

Assume the Axiom of Choice (The Axiom of Choice). The group Aut(UQ<) of order-and-metric automorphisms of the rational ordered Urysohn metric space, with the topology of pointwise convergence on the underlying countable set given the discrete topology, is extremely amenable, and so is every finite point stabiliser required by the finite-support permutation model of Corson's ordered-rational permutation model.

Facts & Assumptions

Given: The age of UQ<, namely the finite ordered rational metric spaces, and a finite support E.

[A1]

The Axiom of Choice is assumed (The Axiom of Choice).

[F1]

Nešetřil's Ramsey theorem says that the class K of finite ordered rational metric spaces is a Ramsey class: for all A,BK and every positive integer k, there is CK such that C(B)kA. Thus every k-colouring of the copies of A in this extension C has a copy BB whose copies of A are monochromatic (Finite colourings of k-element subsets, monochromatic sets, and the arrow notations N(s,t)2 and N(r)ck). No self-arrow B(B)kA is asserted.

[F2]

The KPT correspondence: the automorphism group of a Fraïssé structure whose finite substructures are rigid and whose age is Ramsey is extremely amenable (Kechris--Pestov--Todorcevic, Theorem 4.7; Theorem 6.16 gives this ordered-rational-Urysohn instance). This is the external KPT theorem, not a conclusion of the BPI criterion. Its use is the literature prerequisite specified by this item’s manifest; it is verified against the source cited above.

[L1]

A finite ordered rational metric space is rigid: an isomorphism onto itself preserving the order and all distances is the identity, because the least point must be fixed, then the least remaining point, and so on through the finite order. The order alone suffices; the metric has the meaning of Metric space: d(x,y)=0 iff x=y, symmetry, and the triangle inequality; pseudometric and ultrametric.

Proof

technique · direct
1.1

The age of UQ< is the class of finite ordered rational metric spaces, and UQ< is its Fraïssé limit, since it is countable, universal and homogeneous for that class by Corson's ordered-rational permutation model. Encode rational distances by a binary relation for each rational value, together with the order relation; this is a countable relational language. Its automorphism group is closed in the permutation group of the underlying countable set: failure to preserve a relation is witnessed by a finite tuple and remains a failure on a basic neighbourhood.

given
2.1

Every finite ordered rational metric space is rigid by [L1], and the age is a Ramsey class by [F1]; hence the hypotheses of the KPT criterion [F2] hold for the Fraïssé limit UQ<, and Aut(UQ<) is extremely amenable.

step 1.1F1F2L1
3.1

Put G:=Aut(UQ<) and H:=fix(E). In the pointwise-convergence topology H is an open subgroup of G, since fixing the finitely many points of E is a basic identity neighbourhood.

givenstep 2.1
4.1

Let X be a nonempty compact Hausdorff H-flow. Inside the product XG, define the coinduced space Y:={Φ:GX:Φ(hg)=hΦ(g) for all hH,gG}. It is nonempty: AC chooses one representative of every left H-orbit in G; fix one x0X, assign that same value at every representative, and then the displayed rule extends it uniquely to that orbit.

givenA1step 3.1construct
5.1

The space Y is closed in XG: for fixed h,g, the equation Φ(hg)=hΦ(g) is an equaliser of two continuous coordinate maps and is closed because X is Hausdorff. Arbitrary intersections of these closed equalisers are closed. Hence [F3] makes Y compact with its subspace topology. It is Hausdorff: two distinct functions differ at some coordinate, where disjoint open neighbourhoods in X pull back to disjoint cylinder neighbourhoods in Y.

step 4.1F3L2
5.2

Define a G-action on Y by (aΦ)(g):=Φ(ga). The defining equivariance of Y is preserved, since Φ(hga)=hΦ(ga). It is a left action: a(bΦ) evaluated at g is Φ((ga)b)=Φ(g(ab)), and the identity acts trivially. This action is continuous. Indeed, at a0G and for each of finitely many output coordinates gi, openness of H gives a neighbourhood on which hi(a):=giaa01gi1H; then gia=hi(a)gia0 and Φ(gia)=hi(a)Φ(gia0). Continuity of hi, of the H-action, and the product topology at the finitely many fixed coordinates gia0 therefore give joint continuity.

step 3.1step 4.1L3
6.1

Extreme amenability of G from [step 2.1] gives a G-fixed ΦY. The right-translation action then makes Φ constant, since Φ(a)=(aΦ)(1)=Φ(1) for every aG. For hH, the defining equation for Y gives hΦ(1)=Φ(h)=Φ(1), so Φ(1) is an H-fixed point of X.

step 2.1step 4.1step 5.1step 5.2
7.1

Thus every nonempty compact Hausdorff H-flow has a fixed point, so H=fix(E) is extremely amenable. Since E was arbitrary and E= gives the whole group, the stated group and all required finite point stabilisers are extremely amenable.

step 3.1step 6.1

Remarks

The stabiliser conclusion supplies the hypothesis of Extreme amenability yields BPI in finite-support permutation models. That consumer proves BPI from extreme amenability and is not a source for the KPT correspondence.

Depends on

Used by

Dependency tree · two levels

50 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