LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-16

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.

Actions changed by automorphisms of the kernel and complement give isomorphic semidirect products

Statement

Let $α, β : H \to Aut (N)$ be actions. If $u \in Aut (N)$ and $v \in Aut (H)$ satisfy

$β_{v (h)} = u α_{h} u^{- 1} (h \in H),$

then

$N ⋊_{α} H ≅ N ⋊_{β} H$

by $(n, h) \mapsto (u (n), v (h))$ .

Facts & Assumptions

Given: Actions $α, β$ and automorphisms $u, v$ satisfying the displayed compatibility.

[L1]

The multiplication in $N ⋊_{α} H$ is $(n, h) (n^{'}, h^{'}) = (n α_{h} (n^{'}), h h^{'})$ ( The external semidirect product $N ⋊_{α} H$ ).

[L2]

Both semidirect products are groups ( The semidirect-product multiplication makes $N \times H$ a group).

[L3]

A bijective homomorphism is an isomorphism (Group isomorphisms, automorphisms and the set $Aut (G)$ ).

Proof

technique · direct

1.1L1algebra

Let $F (n, h) = (u (n), v (h))$ . Then $F ((n, h) (n^{'}, h^{'})) = (u (n) u (α_{h} (n^{'})), v (h) v (h^{'}))$ . The compatibility gives $u α_{h} = β_{v (h)} u$ , so this is $F (n, h) F (n^{'}, h^{'})$ under the $β$ multiplication. Thus $F$ is a homomorphism.

2.1step 1.1L2L3∎

The map $(m, k) \mapsto (u^{- 1} (m), v^{- 1} (k))$ is the set-theoretic inverse of $F$ . Therefore $F$ is bijective and is an isomorphism by [L2] and [L3].

Depends on

Used by

Dependency tree · two levels

8 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

Keith Conrad, Semidirect Products (standard reference, not scraped)