Alphabeta Math
CorollaryStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-08-28
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.

Translation length is conjugacy invariant and homogeneous on powers

Statement

For automorphisms of a simplicial tree acting without inversions,

ℓ(hgh−1)=ℓ(g),ℓ(gn)=∣n∣ ℓ(g)(n∈Z).

Facts & Assumptions

Given: Tree automorphisms g,h without inversions.

[L1]

A tree automorphism without inversions is either elliptic with a fixed vertex or hyperbolic with a unique translation axis on which it translates by its translation length. (Tree automorphisms without inversions are either elliptic or hyperbolic)

Proof

technique · direct
1.1L1given

If g is elliptic, [L1] gives a fixed vertex, so every power gn fixes that same vertex and has translation length 0. Conjugating by h carries a fixed vertex of g to a fixed vertex of hgh−1, so conjugation preserves the elliptic case and its translation length.

2.1L1step 1.1algebra

If g is hyperbolic with axis Ag and translation length ℓ(g), then hgh−1 preserves the line hAg and translates it by the same distance, so ℓ(hgh−1)=ℓ(g). Also gn preserves Ag and shifts every vertex on it by ∣n∣ℓ(g), so ℓ(gn)=∣n∣ℓ(g) for n≠0.

3.1step 1.1step 2.1algebra∎

The case n=0 gives ℓ(1)=0, already covered by step 1.1, so the displayed formulas hold for every integer n.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

5 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