LemmaStatement: AI-adaptedProof: AI-generatedprecheck passaudited 2026-08-26

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.

Metric properness agrees with proper discontinuity on proper discrete metric spaces

Statement

Let $G$ act isometrically on a proper discrete metric space $X$ . Then the metric-properness condition of Isometric, proper, and cobounded actions on metric spaces is equivalent to the usual proper-discontinuity condition that for every finite subset $F \subseteq X$ , the set ${g \in G : (g \cdot F) \cap F \neq \emptyset}$ is finite.

Equivalently, it is enough to require that for every $x \in X$ and every $R \geq 0$ , the set ${g \in G : d (x, g \cdot x) \leq R}$ be finite.

Facts & Assumptions

Given: An isometric action of $G$ on a proper discrete metric space $X$ .

[L1]

The action is proper when, for every bounded subsets $B, C \subseteq X$ , the transporter set ${g \in G : (g \cdot B) \cap C \neq \emptyset}$ is finite (Isometric, proper, and cobounded actions on metric spaces).

[L2]

In a proper discrete metric space, bounded subsets are finite. [given]

Proof

technique · direct

1.1L1L2

If the action is proper in the metric sense, then [L2] turns every finite set into a bounded set. So for every finite $F \subseteq X$ , the set ${g \in G : (g \cdot F) \cap F \neq \emptyset}$ is finite by [L1].

1.2L1L2

Conversely, suppose the finite-set condition holds. Let $B, C \subseteq X$ be bounded. By [L2], the union $F : = B \cup C$ is finite. If $(g \cdot B) \cap C \neq \emptyset$ , then certainly $(g \cdot F) \cap F \neq \emptyset$ , so the transporter of $B$ into $C$ is contained in the finite set supplied for $F$ . Hence the action is proper in the metric sense.

2.1step 1.1step 1.2algebra∎

The finite-set condition implies the pointwise bound by taking $F : = \overset{ˉ}{B} (x, R)$ ; and the pointwise bound implies the finite-set condition because a finite set lies in some ball $\overset{ˉ}{B} (x, R)$ . Thus all three formulations are equivalent.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

9 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

C. Löh, Geometric Group Theory, Sections 4.4 and 5.1 (standard reference, not scraped)
C. Drutu and M. Kapovich, Lectures on Geometric Group Theory, Chapter 5 (standard reference, not scraped)