Alphabeta Math
CounterexampleConstruction: AI-adaptedVerification: AI-generatedprecheck passaudited 2026-08-11
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 action of Z/2 on two disjoint two-point orbits is free but not transitive

Statement refuted

False claim. Every free group action is transitive.

Facts & Assumptions

Given: The additive group A=Z/2 and the set X=A×{0,1}, with a⋅(b,i)=(a+b,i).

[L1]

A left action satisfies the identity and composition laws and is transitive when one orbit is the whole set (Left group actions, transitive actions, and faithful actions).

[L2]

An action is free when a⋅x=x implies that a is the identity (A free group action has no nonidentity element fixing a point).

[L3]

The orbit of x is the set of all a⋅x (The orbit G⋅x and stabilizer Gx of a point in a group action).

Counterexample

technique · direct
1.1

The identity class satisfies 0⋅(b,i)=(b,i), and (a+c)⋅(b,i)=(a+c+b,i)=a⋅(c⋅(b,i)), so [L1] and [L4] give an action.

L1L4
2.1

If a⋅(b,i)=(b,i), then a+b=b in Z/2 and cancellation gives a=0; hence the action is free by [L2].

step 1.1L2L4L5
3.1

The second coordinate is unchanged by the action, so the two sets A×{0} and A×{1} are distinct orbits by [L3]. The action is not transitive, refuting the claim.

step 1.1L1L3∎

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

15 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