Alphabeta Math
CounterexampleConstruction: AI-adaptedVerification: AI-generatedSession-authored (Fable 5 assisted)precheck passjudge pass (gpt-5.6-terra)audited 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 square-affine group of F_7 is 2-homogeneous but not 2-transitive

Statement refuted

Every 2-homogeneous action is 2-transitive.

Facts & Assumptions

Given: The subgroup G:={xax+b:a{1,2,4}, bF7} of the affine group of F7.

[L1]

A 2-homogeneous action sends any 2-element subset to any other, while a 2-transitive action sends any ordered pair of distinct points to any other ordered such pair (k-transitive and k-homogeneous actions).

Counterexample

technique · direct
1.1

The nonzero squares in F7 are {1,2,4}, and every nonzero element is either a square or the negative of a square. So for any distinct x,y,u,vF7, after possibly swapping u and v there is a{1,2,4} with a(yx)=vu. Then the affine map za(zx)+u lies in G and sends {x,y} to {u,v}. Thus the action is 2-homogeneous.

L1algebra
1.2

Every element of G multiplies differences by a square: if g(z)=az+b, then g(y)g(x)=a(yx) with a{1,2,4}. Since 1 is a square and 3 is not, no element of G sends the ordered pair (0,1) to (0,3). So the action is not 2-transitive.

L1algebra
2.1

Step 1.1 gives 2-homogeneity while step 1.2 denies 2-transitivity, refuting the statement.

step 1.1step 1.2

Depends on

Used by

Dependency tree · two levels

2 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