Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-13
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 conjugacy class in an index-two normal subgroup remains one class or splits into two equal classes, with a centralizer criterion

Statement

Let H⊴G have index 2, and let x∈H. The G-conjugacy class of x is either one H-conjugacy class or the disjoint union of two H-conjugacy classes of equal cardinality. It remains one class if and only if CG(x) contains an element outside H; equivalently, it splits if and only if CG(x)⊆H.

Facts & Assumptions

Given: A normal subgroup H⊴G of index 2 and x∈H.

[F1]

A normal subgroup is invariant under conjugation (Normal subgroup: invariance under conjugation).

[F2]

The conjugacy class and centralizer are {gxg−1:g∈G} and {g∈G:gx=xg} (The conjugacy class Cl⁡G(x) and centralizer CG(x) of an element).

[F3]

Index 2 means that the coset set has two elements (The coset set G/H and the index [G:H] of a subgroup).

Proof

technique · direct
1.1

Choose t∈G∖H. By [F3], G=H⊔tH.

F3choose
2.1

Let C be the H-class of x. Using [F1] and step 1.1, the G-class is C∪tCt−1; these are H-classes and therefore are equal or disjoint.

F1F2step 1.1algebra
3.1

Conjugation by t is a bijection C→tCt−1, so in the disjoint case the two classes have equal cardinality.

step 2.1algebra
3.2

The classes agree exactly when txt−1=hxh−1 for some h∈H, which is equivalent to h−1t∈CG(x). This element lies outside H.

F2step 1.1step 2.1algebra
3.3

Conversely, if c∈CG(x)∖H, then c=h−1t for some h∈H, and txt−1=hxh−1∈C; hence the two classes agree.

F2step 1.1step 2.1algebra
4.1

Steps 3.2--3.3 give the outside-centralizer criterion; negating it gives the equivalent containment criterion for splitting.

step 3.2step 3.3∎

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