Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-04
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.

A group extension splits exactly when it has a complement or a compatible semidirect-product model, and a kernel retraction forces a direct product

Statement

For a group extension

1→N→iE→πQ→1,

the following are equivalent:

  1. the extension splits;
  2. i(N) has a complement in E;
  3. the extension is equivalent to the standard extension 1→N→N⋊Q→Q→1 for some action of Q on N.

If there exists a retraction r:E→N of the kernel inclusion i, then ker⁡r is a complement to i(N), it centralizes i(N), and therefore E≅N×ker⁡r.

Facts & Assumptions

Given: The displayed group extension.

[L1]

For a group extension, having a homomorphic section, having a complement to the kernel, and being equivalent to a compatible semidirect-product extension are equivalent (Splitting lemma for groups: a section, a complement, and a semidirect-product decomposition are equivalent).

[L2]

Proof

technique · iff
1.1givenL1

By [L1], conditions 1, 2, and 3 are equivalent.

1.2givenalgebra

Suppose r:E→N is a retraction of i. For x∈i(N)∩ker⁡r, write x=i(n). Then 1=r(x)=r(i(n))=n, so x=i(1)=1. For any g∈E, the element i(r(g))−1g lies in ker⁡r because r(i(r(g))−1g)=r(g)−1r(g)=1. Therefore g=i(r(g))(i(r(g))−1g)∈i(N)ker⁡r, so E=i(N)ker⁡r and ker⁡r is a complement to i(N).

2.1L2step 1.2algebra

Let k∈ker⁡r and x=i(n)∈i(N). Because i(N) is normal in E by [L2], the conjugate kxk−1 still lies in i(N). Applying r gives r(kxk−1)=r(k)r(x)r(k)−1=n. Since r restricts to the inverse of i on i(N), this forces kxk−1=i(n)=x. Hence ker⁡r centralizes i(N), and step 1.2 upgrades the decomposition to a direct product E≅i(N)×ker⁡r≅N×ker⁡r.

3.1step 1.1step 1.2step 2.1∎

Step 1.1 is the splitting criterion, while steps 1.2 and 2.1 show that any kernel retraction forces a direct-product splitting.

Depends on

Used by

Dependency tree · two levels

9 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