Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedSession-authored (Fable 5 assisted)precheck passaudited 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.

Barycentric subdivision removes edge inversions while preserving the tree

Statement

Let G act on a simplicial tree T. Form the barycentric subdivision T by inserting one new midpoint vertex on each geometric edge of T and replacing every geometric edge by the two half-edges meeting that midpoint. Then the action extends to T, the graph T is again a simplicial tree, and the extended action is without inversions.

Facts & Assumptions

Given: An action of a group G on a simplicial tree T.

[L1]

An action is without inversions exactly when no element sends an oriented edge to its reverse. (Edge inversions and actions without inversions)

[L2]

A simplicial tree is a connected oriented graph with no nontrivial reduced closed path. (A simplicial tree)

Proof

technique · direct
1.1

Every automorphism of T permutes geometric edges, so it sends the midpoint of an edge to the midpoint of its image edge. Hence the original action extends uniquely to the subdivided graph T.

L1L2givenconstruct
2.1

The graph T is connected because each original edge has only been split in two. A reduced closed path in T would project, after deleting midpoint backtracks, to a nontrivial reduced closed path in T, contradicting [L2]. So T is again a simplicial tree.

L2step 1.1algebra
3.1

In T, every half-edge joins an original vertex to a midpoint vertex. Its reverse joins a midpoint vertex to an original vertex, so an automorphism cannot send a half-edge to its reverse without swapping the two vertex types. That cannot happen in the extended action. Therefore the action on T is without inversions in the sense of [L1].

L1step 1.1step 2.1algebra

Depends on

Used by

Dependency tree · two levels

4 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