Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicableSession-authored (Fable 5 assisted)judge 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.

Internal central products of a finite family of subgroups

Definition

Let G be a group and let G1,,Gr be subgroups of G, where rN (Subgroup). Subgroups G1,,Gr of G form an internal central product when they generate G and [Gi,Gj]=1 for ij, where is the generated subgroup of The subgroup S generated by a subset, the cyclic subgroup g, and cyclic groups and [Gi,Gj] is the subgroup commutator of Subgroup commutators and the lower central series. The empty family is an internal central product of the trivial group.

Since the factors commute pairwise, G=G1G2Gr as a set of products, and for ij every element of GiGj commutes with both Gi and Gj, so GiGjZ(Gi)Z(Gj) (The center Z(G) of a group).

Remarks

The condition differs from that of an internal direct product (Internal direct products of finitely many normal subgroups) in exactly one place: there the factors are required to intersect trivially, here they are allowed to share a central subgroup. An internal direct product of normal subgroups is in particular an internal central product, since distinct factors of a direct product commute elementwise.

No hypothesis is placed on the intersections beyond what the commuting condition already forces. That is deliberate: the intersections are what the recognition theorem computes, rather than data prescribed in advance.

Depends on

Used by

Dependency tree · two levels

13 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