Alphabeta Math
RemarkRemark: Literature-sourcedProof: Not applicablePipeline-generatedprecheck passjudge pass (gpt-6-sol)audited 2026-09-27
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.

Frobenius kernel closure is the content of the theorem

Statement

Let G be a finite Frobenius group with complement H and let

N=(G∖⋃x∈GxHx−1)∪{1}

be the associated candidate kernel set (Frobenius kernel set, Frobenius complement and frobenius group). Then N is defined by a membership condition on individual elements: g∈N means that g=1 or that g lies in no conjugate of H. Nothing in the definition asserts that N is closed under products, and the counting statement ∣N∣=[G:H], N∩H={1} of Frobenius kernel cardinality likewise says nothing about products of elements of N.

The remark. The passage from this candidate set to a subgroup is not formal; it is the content of the Frobenius kernel theorem (Frobenius kernel theorem), which proves that N is a normal subgroup of G by character-theoretic means. In particular, the theorem is not a consequence of the cardinality computation, and a proof of the kernel theorem must somewhere use more than the definition of N and the orbit-counting identities.

Remarks

The reason no product closure is available for free is that N is described by a negative condition on conjugation, while a product gg′ of two elements avoiding every conjugate of H need not avoid them; the subgroups Hx=xHx−1 are numerous and the description of N quantifies over all of them. This is visible already in the smallest case G=S3 with H=⟨(0 1)⟩, where the kernel is A3 (S3 as a Frobenius group): the two nonidentity elements of A3 are 3-cycles, and the product of either one with itself is the other, while their mutual product is the identity, so closure holds there — but this is a computation in one group, not a general structural reason.

Conversely, the reverse implication is immediate: if a normal subgroup K with K≤N, G=KH and K∩H={1} is exhibited by other means, then K is the Frobenius kernel by the uniqueness statement of Frobenius semidirect product decomposition. The character-theoretic theorem is exactly the tool that produces such a K from the Frobenius condition alone.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

14 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