Alphabeta Math
CounterexampleConstruction: AI-adaptedVerification: AI-adaptedprecheck 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.

The Cayley graphs of Z/2 for {1} and of Z for {−1,1} are trees, and neither generating set is free

Statement refuted

Whenever a Cayley graph is a tree, the chosen generating set is a free basis.

Facts & Assumptions

Given: The proposed claim together with the witness named in the Statement refuted.

[F1]

The Cayley graph of a group G with respect to a subset S has vertex set G and edge set {{g,gs}:g∈G, s∈(S∪S−1)∖{e}} (The Cayley graph of a group with respect to a subset).

[L1]

A cycle is a closed walk of length at least three with distinct vertices apart from its endpoints; a forest is a simple graph with no cycle and a tree is a connected forest (Cycles, trees and forests in a simple graph on an arbitrary vertex set).

[L2]

If no product of two members of a generating set is the identity and the Cayley graph is a tree, the set is a free basis (If no product of two members of a generating set is the identity and the Cayley graph is a tree, the set is a free basis).

[L3]

The subset B is a free basis of F if (F,i) is a free group on the set B in the sense of. (A free basis of a group).

[L4]

If G=⟨g⟩ is cyclic, then exactly one of the following applies: (Every cyclic group is isomorphic to (Z,+) or to (Z/n,+) for its finite order n≥1).

Counterexample

technique · constructive
1.1F1L1L4construct

The Cayley graph of the group of order two for its nonidentity element is a single edge, a tree, and that group is not free.

2.1F1L1L4step 1.1

The Cayley graph of the integers for the generating set {−1,1} is the line, a tree, and that set is not a free basis.

3.1L2L3step 1.1step 2.1discharge-construct∎

In both cases a product of two members of the generating set is the identity, which is exactly the hypothesis the converse theorem adds.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

24 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