Frattini Subgroup¶

The intersection of all maximal proper subgroups of a group, detecting generation redundancy in finite groups.

Version: v1 · 2026-10-03 · History
Domain-specific #: 13249
Aliases: Frattini Group, Phi of G

Core Idea¶

The Frattini subgroup Φ(G) is the intersection of all maximal proper subgroups of a group G. If there are no maximal subgroups, it is defined as G. Automorphisms preserve this intersection, so it is a characteristic, hence normal, subgroup. In a finite group, its elements are exactly the non-generators: adding one to a set cannot be the step that makes that set generate the whole group.[^{ref-0932f2fb01cc][}ref-e6e25b055ff5]

Scope of Application¶

The intersection definition applies to arbitrary groups. For finite groups, a set generates G exactly when its images generate G/Φ(G). For finite p-groups, more is true: Φ(P)=P^p[P,P], the quotient is a vector space over F_p, and its dimension is the minimum number of generators. The p-group formula and vector-space conclusion should not be extended to every finite group.[^ref-0932f2fb01cc]

Clarity¶

A non-generator may appear in a generating set; it is simply never indispensable to that set's generation of finite G. The word does not mean “not in any generating set.” For S₃, all maximal proper subgroups intersect only in {e}, so Φ(S₃) is trivial. Its Frattini quotient is still nonabelian S₃, not an F_p-space. The construction is also different from Frattini's argument, a separate theorem about normalizers.[^ref-0932f2fb01cc]

Manages Complexity¶

The quotient G/Φ(G) removes elements that cannot independently supply missing generating power. In a finite p-group, this can turn a generator-count problem into the dimension of a vector space. That compression preserves the yes/no test for finite-group generation, not every feature of G such as its element orders or full subgroup lattice.[^ref-0932f2fb01cc]

Abstract Reasoning¶

Identify every maximal proper subgroup and intersect them. For finite G, test a proposed generating set in G/Φ(G); a proper generated subgroup would lie in a maximal subgroup also containing Φ(G), so a set that generates the quotient must already generate G. If G is a finite p-group, use P^p[P,P] and count quotient-basis vectors. For example, C₈=⟨a⟩ has unique maximal ⟨a²⟩, so Φ(C₈)=⟨a²⟩ and the one-dimensional quotient correctly reports one required generator.[^ref-0932f2fb01cc]

Knowledge Transfer¶

The named construction transfers across groups because the same ambient-group, maximal-subgroup and intersection roles recur. Its finite quotient test works for both C₈ and S₃, while only the former has the finite-p-group linearization. Generic “shared obstruction” or “redundant input” language outside group theory is an analogy, not a literal Frattini subgroup.

[^ref-0932f2fb01cc]: Ulrich Meierfrankenfeld, Group Theory I: Lecture Notes for MTH 912, Michigan State University, 2018, §2.2, PDF pp. 45–48, especially Definition 2.2.2 and Lemmas 2.2.4–2.2.11. Original author-written notes directly inspected. [^ref-e6e25b055ff5]: Mathlib, GroupTheory.Frattini, original formal library documentation, definition and theorems frattini_characteristic, frattini_nongenerating (with coatomic hypothesis), and frattini_nilpotent (finite). Directly inspected.

Relationships to Other Abstractions¶

Current abstraction Frattini Subgroup Domain-specific

Parents (1) — more general patterns this builds on

Frattini Subgroup presupposes Group Prime

The Frattini construction presupposes an ambient group and its subgroup and generation relations.

Neighborhood in Abstraction Space¶

Frattini Subgroup sits in a sparse region of the domain-specific corpus (68^th percentile for distinctiveness): few abstractions share its structure, so a faithful description tends to retrieve it precisely.

Family — Algebraic Substructures & Closures (12 abstractions)

Nearest neighbors

Computed from structural-signature embeddings · 2026-10-08