Alphabeta Math
ExampleConstruction: AI-adaptedVerification: AI-adaptedSession-authored (Fable 5 assisted)precheck passaudited 2026-08-17
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.

Sylow p-subgroups of Aut((Z/p)2): np=p+1

Example

For Ep=(Z/p)2, the Sylow p-subgroups of Aut(Ep) have order p and number p+1. Distinct ones meet trivially, and their union contains exactly p21 nonidentity elements. See For prime p, Aut((Z/p)×(Z/p))=(p21)(p2p).

Facts & Assumptions

Given: The hypotheses and objects in the Example.

[L1]

For every prime p, Aut((Z/p)×(Z/p))=(p21)(p2p).. (For prime p, Aut((Z/p)×(Z/p))=(p21)(p2p)).

[L2]

Let G be a finite group, let p be prime, and write G=pam with aN and pm. A subgroup PG is a Sylow p-subgroup when P=pa. Equivalently, its order is the largest power of p dividing G. This is a property of a subgroup and does not presume that such a subgroup exists; existence is proved in thm-sylow-first-theorem. (Sylow p-subgroups of a finite group).

[L3]

For a finite group G and a prime p, let Sylp(G) be the set of Sylow p-subgroups (def-sylow-p-subgroup). Define np(G):=Sylp(G). This cardinal is defined even before existence is proved because Sylp(G) is a subset of the finite power set of G; thm-sylow-first-theorem later shows it is nonzero. (The number np(G) of Sylow p-subgroups).

[L4]

If P is a Sylow p-subgroup of a finite group G, then np(G)=[G:NG(P)].. (Sylow III*: np(G)=[G:NG(P)]).

[L5]

For every prime p, the operations of addition and multiplication on Z/p make it a field (def-field). (For every prime p, the two operations on Z/p make it a field).

[L6]

Let G be a finite group and HG. Then G=[G:H]H. Consequently, under the canonical embedding ι:NZ, H divides G. (Lagrange's theorem: G=[G:H]H for every subgroup H of a finite group G).

Verification

technique · direct
1.1

For Ep=(Z/p)2, the maps ut(x,y)=(x+ty,y) satisfy usut=us+t, so P={ut:tZ/p} has order p. Because Aut(Ep)=p(p1)2(p+1), it is a Sylow p-subgroup.

L1L2L3L4L5L6givenalgebra
2.1

The common fixed subgroup of P is L={(x,0)}, since ut(x,y)=(x,y) for every t exactly when y=0. A normalizer preserves L; conversely, a coordinate automorphism preserving L conjugates each ut to another element of P.

step 1.1givenalgebra
3.1

Such an automorphism has the form (x,y)(ax+by,dy) with a,d0, giving p(p1)2 choices. The normalizer-index formula therefore gives np=p+1.

step 2.1givenalgebra
4.1

Two distinct order-p subgroups meet trivially, so their nonidentity elements are disjoint and number (p+1)(p1)=p21. At p=2, the normalizer has order 2 in a group of order 6, giving three Sylow subgroups and three nonidentity elements. This proves the stated claim.

step 1.1step 3.1givenalgebra

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 103 results over 18 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