Alphabeta Math
PropositionStatement: AI-adaptedProof: AI-adaptedSession-authored (Fable 5 assisted)precheck passjudge pass (deepseek-v4-pro + 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.

Order, centre and derived subgroup of a central product

Statement

Let G and H be groups with central subgroups Z1Z(G) and Z2Z(H) and an isomorphism α:Z1Z2, and write gˉ,hˉ for the canonical images in P=GαH. Then:

  1. if G and H are finite, P=GHZ1;
  2. Z(P)={gˉhˉ:gZ(G), hZ(H)}, the image of Z(G)×Z(H);
  3. [P,P]={cd:c[G,G], d[H,H]}, the image of [G,G]×[H,H].

Facts & Assumptions

Given: Groups G,H, central subgroups Z1Z(G) and Z2Z(H), an isomorphism α:Z1Z2, the quotient map π:G×HP, and the canonical images gˉ=π(g,e), hˉ=π(e,h).

[F1]

For groups G,H with central subgroups Z1Z(G), Z2Z(H) and an isomorphism α:Z1Z2, the central product GαH is the quotient of G×H by N={(z,α(z)1):zZ1} (The central product GαH of two groups along an isomorphism of central subgroups).

[F2]

Z(G):={zG:zg=gz for every gG} (The center Z(G) of a group).

[F3]

For g,hG the commutator is [g,h]:=ghg1h1, and [G,G] is the subgroup generated by all commutators (Commutators [g,h]=ghg1h1 and the commutator subgroup [G,G]).

[L1]

The canonical maps GGαH and HGαH are injective homomorphisms whose images commute elementwise, generate GαH, and meet in the image of Z1 (The two canonical maps into a central product are injective homomorphisms whose images commute, generate it, and meet in the identified centre).

[L2]

If G and H are finite groups, then their external direct product is finite and has order G×H=GH (For finite groups G and H, G×H=GH).

[L3]

For a finite group G and HG, G=[G:H]H (Lagrange's theorem: G=[G:H]H for every subgroup H of a finite group G).

[L5]

The subgroup N={(z,α(z)1):zZ1} of G×H is central, hence normal (The identified subgroup used to form a central product is central, hence normal).

Proof

technique · direct
1.1

The map z(z,α(z)1) is a bijection from Z1 onto N, so N=Z1; with G×H=GH and Lagrange applied to NG×H, the number of cosets is GH/Z1, which is the order of P.

F1L2L3L5algebra
1.2

The images of G and of H in P commute elementwise, generate P, and each canonical map is injective.

L1
2.1

Let gˉhˉ be central in P and let gG. Then hˉ commutes with g, so gˉ commutes with g, hence [g,g]=ggg1g1 is trivial; injectivity of the canonical map gives [g,g]=e, so gZ(G), and symmetrically hZ(H).

F2F3step 1.2
2.2

Conversely, if gZ(G) and hZ(H) then gˉhˉ commutes with every g and with every h, and those elements generate P, so gˉhˉ is central.

F2step 1.2
2.3

Because the two images commute elementwise, [gˉ1hˉ1,gˉ2hˉ2]=[gˉ1,gˉ2][hˉ1,hˉ2]=[g1,g2] [h1,h2] for all giG and hiH.

F3step 1.2
3.1

Every element of P is gˉhˉ by step 1.2, so steps 2.1 and 2.2 identify Z(P) as the image of Z(G)×Z(H); and by step 2.3 the commutators of P are exactly the products [g1,g2] [h1,h2], whose generated subgroup is the image of [G,G]×[H,H].

F3L4step 1.1step 2.1step 2.2step 2.3

Remarks

Clause 1 needs both factors finite; clauses 2 and 3 do not, since they use only that the two images commute and generate. The order formula divides by Z1 and not by Z12: one copy of the identified subgroup survives inside the product, and it is the image described in the intersection clause of the canonical-maps proposition.

Depends on

Used by

Dependency tree · two levels

31 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