Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-6.1-sol)audited 2026-10-08
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.

The Markov-Kakutani fixed point theorem for abelian affine actions

Statement

Assume the Axiom of Choice. Let G be an abelian topological group, and let X be a nonempty compact convex subset of a Hausdorff locally convex real or complex topological vector space V. Suppose G acts continuously on X; write gx for the action, with ex=x and (gh)x=g(hx). Each action map is affine in the finite-combination sense: for x0,…,xn∈X and real ti≥0 with ∑i=0nti=1, g(∑i=0ntixi)=∑i=0nti(gxi). Then there exists x0∈X with gx0=x0 for every g∈G.

Facts & Assumptions

Given: The Axiom of Choice, an abelian topological group G, a Hausdorff locally convex topological vector space V, a nonempty compact convex subset X⊆V, and the continuous affine action in the Statement.

[A1]

Under the Axiom of Choice, the real dominated-extension theorem proves the relative Hahn-Banach principle HB (The Axiom of Choice, Hahn-Banach dominated extension theorem for real vector spaces, The real dominated-extension principle as an additional hypothesis over ZF).

[F1]

Addition and scalar multiplication in V are continuous; convexity is defined by finite convex combinations (Topological vector spaces over the real and complex fields, Local convexity, convex and balanced sets, and the continuous dual).

[F3]

In a Hausdorff locally convex space, HB implies that the continuous dual separates distinct points by the real part of a functional (The continuous dual separates points in a Hausdorff locally convex space).

[F5]

For a vector sequence, define its finite sums recursively by S0=v0 and Sk+1=Sk+vk+1; vector-space axioms and induction give distributivity and reindexing of finite sums. Real finite sums obey additivity, scaling, and telescoping. The canonical natural n+1 is positive, its reciprocal is positive, and reciprocals decrease as positive denominators increase (Vector space over a field, The recursion theorem, The principle of mathematical induction, Finite sums and finite products, by recursion, Laws of finite sums and finite products, The natural numbers N (von Neumann), Canonical naturals are positive and strictly increasing, Inverses of positives are positive, and reciprocation reverses order).

[F6]

For every real ε>0 there is a natural n≥1 with 1/n<ε (For every ε>0 in a complete ordered field there is a natural n≥1 with 1/n<ε).

Proof

technique · direct
1.1F1F5given

For g∈G and n∈N, define g0x=x, gi+1x=g(gix), and An(g)x:=1n+1∑i=0ngix, with vector-valued finite sums as in [F5]. Since 1/(n+1)>0 and the sum of the n+1 equal coefficients is (n+1)/(n+1)=1, convexity makes An(g) a self-map of X. The action iterates are continuous and affine by induction. For any finite convex combination y=∑ℓtℓyℓ, their affine identities and finite sum distributivity give An(g)y=1n+1∑i∑ℓtℓgiyℓ=∑ℓtℓAn(g)yℓ; hence An(g) is affine. Continuity follows from the TVS addition and scalar-multiplication maps and the continuity of the action iterates.

2.1F1F5step 1.1givenalgebra

Let Γ be the monoid of finite compositions of the maps An(g), including the identity. For g,h∈G, affinity and the action law give An(g)Am(h)x=1(n+1)(m+1)∑i=0n∑j=0mgihjx and Am(h)An(g)x=1(n+1)(m+1)∑j=0m∑i=0nhjgix. Because G is abelian, gihj=hjgi; associativity and commutativity of vector addition and scalar distributivity reorder the finite sums, so the two maps commute. Therefore Γ is abelian, and every member is a continuous self-map of X.

3.1F2step 2.1

For every γ∈Γ, the image γ(X) is nonempty and compact by [F2], hence closed in X by [F2]. Given a nonempty finite list γ1,…,γk∈Γ, their composition γ:=γ1⋯γk lies in Γ; commutativity lets us write γ=γi∘γi′ for each i with γi′ the composition of the other factors, using the identity when k=1. Thus the nonempty set γ(X) lies in every γi(X). The empty finite intersection is X≠∅, so {γ(X):γ∈Γ} has the finite intersection property, and compactness of X gives x0∈⋂γ∈Γγ(X).

4.1A1F3F4step 3.1

Fix g∈G and suppose v:=x0−gx0≠0. By [A1] and [F3], choose a continuous linear functional φ∈V′ whose real part ψ:=Re⁡φ satisfies ψ(v)≠0. The continuous real-valued function ψ is bounded on compact X by [F4]; fix C≥0 with ∣ψ(y)∣≤C for every y∈X.

5.1F5F6step 4.1algebra∎

For every n∈N, membership x0∈An(g)(X) gives some x∈X with x0=An(g)x. Affinity of the action and real-linearity of ψ yield ψ(v)=(ψ(x)−ψ(gn+1x))/(n+1) by telescoping, so ∣ψ(v)∣≤2C/(n+1). This bound is valid for every n; no sequence of preimages is chosen. If C=0, the bound gives ψ(v)=0 directly. If C>0, then for any ε>0, [F6] applied to ε/(2C)>0 gives n≥1 with 1/n<ε/(2C). Since n+1>n>0, [F5] gives 1/(n+1)<1/n, hence ∣ψ(v)∣≤2C/(n+1)<ε. As this holds for every positive ε, ψ(v)=0, contradicting step 4.1. Therefore gx0=x0. Since g was arbitrary, x0 is fixed by all of G.

Depends on

Used by

Dependency tree · two levels

86 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