Alphabeta Math
CounterexampleConstruction: AI-adaptedVerification: AI-generatedSession-authored (Fable 5 assisted)precheck 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 natural action of S3S_3 on three points is faithful and transitive but not free

Statement refuted

False claim. Every faithful transitive group action is free.

Facts & Assumptions

Given: The symmetric group S3=Sym({1,2,3})S_3=\operatorname{Sym}(\{1,2,3\}) acting on X={1,2,3}X=\{1,2,3\} by evaluation.

[L1]

An action is transitive when every point can be carried to every other and faithful when only the identity fixes every point (Left group actions, transitive actions, and faithful actions).

[L2]

An action is free when no nonidentity element fixes any point (A free group action has no nonidentity element fixing a point).

[L3]

Stabilizers record the elements fixing a chosen point (The orbit GxG\cdot x and stabilizer GxG_x of a point in a group action).

Counterexample

technique · direct
1.1

Evaluation satisfies e(i)=ie(i)=i and (στ)(i)=σ(τ(i))(\sigma\tau)(i)=\sigma(\tau(i)), so [L4] and [L5] give an action of S3S_3 on XX.

L4L5
2.1

For any i,jXi,j\in X, a permutation carries ii to jj, so the action is transitive. If a permutation fixes all three points, it is the identity function, so the action is faithful.

step 1.1L1L4
3.1

The nonidentity transposition (23)(2\,3) fixes 11, so G1G_1 is nontrivial and the action is not free by [L2] and [L3]. Thus the false claim fails.

step 2.1L2L3

Depends on

Used by

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 16 results over 11 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.

Sources