Skip to content

Bernstein–Zelevinsky classification

In mathematics, the Bernstein–Zelevinsky classification, introduced by and , classifies the irreducible complex smooth representations of a general linear group over a local field in terms of cuspidal representations.

Version
v1 · 2026-09-28 · History
Domain-specific #
8166
Domain group
Formal Sciences
Origin domain
Mathematics
Subdomain
Representation Theory → Mathematics

Core Idea

Bernstein–Zelevinsky classification is treated here as the recurring mathematicslogicstatistics identity summarized by this source-grounded definition: In mathematics, the Bernstein–Zelevinsky classification, introduced by and , classifies the irreducible complex smooth representations of a general linear group over a local field in terms of cuspidal representations. In mathematics, the Bernstein–Zelevinsky classification, introduced by and , classifies the irreducible complex smooth representations of a general linear group over a local field in terms of cuspidal representations. In mathematics, the Bernstein–Zelevinsky classification, introduced by and , classifies the irreducible complex.

How would you explain it like I'm…

 

No faithful explanation at this level. All three generators agree: a five-year-old picture reduces to "big things are built by snapping small pieces together", which teaches that irreducible representations are sums of cuspidal ones, whereas irreducibles cannot be split and cuspidal representations only label or parametrize them.

Labeling Unsplittable Actions

Some mathematicians study the different ways a big family of number-grid moves (called a group) can act on things. Some of these actions are 'unsplittable', meaning they can't be broken into smaller actions. The Bernstein–Zelevinsky classification is a complete labeling system: it gives every unsplittable action of one important kind of group a label written using a list of special basic actions called cuspidal ones. Two actions get the same label only if they are really the same.

Labeling Irreducibles by Cuspidals

A representation is a way for a group to act by linear transformations on a vector space; an irreducible one has no smaller invariant piece. The Bernstein–Zelevinsky classification deals with the general linear group GL_n (invertible n×n matrices) with entries in a local field, such as the p-adic numbers. It classifies all irreducible complex smooth representations of this group, meaning it lists them without repeats, by describing each in terms of cuspidal representations, which are the basic ones not obtainable from smaller general linear groups. So instead of studying each irreducible representation from scratch, you can describe it by the cuspidal data it is built from.

 

The Bernstein–Zelevinsky classification concerns the category of smooth complex representations of G = GL_n(F), with F a local field. Smoothness means every vector is fixed by some open subgroup, which is the natural continuity condition for these totally disconnected groups. Within that category, cuspidal representations are the ones that do not occur via induction from proper parabolic subgroups, so they act as the basic building data of the theory. The classification describes every irreducible smooth representation of GL_n(F) in terms of cuspidal representations of smaller general linear groups. Irreducible representations are not sums of cuspidals; rather, cuspidal data parametrize them. The result is a structural statement about GL_n over a local field specifically, and its value lies in reducing questions about all irreducibles to questions about cuspidal ones.

Scope of Application

  • Documented setting. In mathematics, the Bernstein–Zelevinsky classification, introduced by and , classifies the irreducible complex smooth representations of a general linear group over a local field in terms of cuspidal representations.

  • Documented setting. In mathematics, the Bernstein–Zelevinsky classification, introduced by and , classifies the irreducible complex smooth representations of a general linear group over a local field in terms of cuspidal representations.

  • Documented setting. In mathematics, the Bernstein–Zelevinsky classification, introduced by and , classifies the irreducible complex smooth representations of a general linear group over a local field in terms of cuspidal representations.

  • Documented setting. In mathematics, the Bernstein–Zelevinsky classification, introduced by and , classifies the irreducible complex smooth representations of a general linear group over a local field in terms of cuspidal representations.

  • Documented setting. In mathematics, the Bernstein–Zelevinsky classification, introduced by and , classifies the irreducible complex smooth representations of a general linear group over a local field in terms of cuspidal representations.

Clarity

A clear use of Bernstein–Zelevinsky classification names the carrier, the operative relation, and the conditions under which the source treats the identity as present. The minimal definition is In mathematics, the Bernstein–Zelevinsky classification, introduced by and , classifies the irreducible complex smooth representations of a general linear group over a local field in terms of cuspidal representations.

Manages Complexity

Bernstein–Zelevinsky classification compresses multiple mathematicslogicstatistics details into a stable diagnostic relation. The source shows both the central mechanism—in mathematics, the Bernstein–Zelevinsky classification, introduced by and , classifies the irreducible complex smooth representations of a general linear group over a local field in terms of cuspidal representations.—and the practical consequence—in mathematics, the Bernstein–Zelevinsky classification, introduced by and , classifies the irreducible complex smooth representations of a general.

Abstract Reasoning

  1. Type the carrier. Identify the mathematicslogicstatistics entities to which the claim applies.
  2. State the relation. Use the source-grounded identity: In mathematics, the Bernstein–Zelevinsky classification, introduced by and , classifies the irreducible complex smooth representations of a general linear group over a local field in terms of cuspidal representations.
  3. Check operation and conditions. In mathematics, the Bernstein–Zelevinsky classification, introduced by and , classifies the irreducible complex smooth representations of a general linear group over a local field in terms of cuspidal representations.
  4. Demand recognition evidence.

Knowledge Transfer

Within the home domain. Knowledge about Bernstein–Zelevinsky classification transfers literally when a new case preserves the same carrier type, relation, and recognition test. In mathematics, the Bernstein–Zelevinsky classification, introduced by and , classifies the irreducible complex smooth representations of a general linear group over a local field in terms of cuspidal representations. In mathematics, the Bernstein–Zelevinsky classification, introduced by and , classifies the irreducible.

Relationships to Other Abstractions

Local relationship map for Bernstein–Zelevinsky classificationParents appear above the current abstraction, mutual partners to the right, and children below. Node labels state whether each abstraction is prime or domain-specific; colors identify relation types.Bernstein–ZelevinskyclassificationDOMAINPrime abstraction: Classification — is a kind ofClassificationPRIME

Current abstraction Bernstein–Zelevinsky classification Domain-specific

Parents (1) — more general patterns this builds on

  • Bernstein–Zelevinsky classification is a kind of Classification Prime

    Bernstein–Zelevinsky classification is a strict kind of Classification: its frozen identity entails the parent's defining structure while adding domain-specific restrictions.

Hierarchy path (1) — routes to 1 parentless root

Neighborhood in Abstraction Space

Bernstein–Zelevinsky classification sits in a moderately populated region (44th percentile for distinctiveness): it has near-neighbors but no dense thicket of look-alikes.

Family — Algebraic Structures, Groups & Operators (42 abstractions)

Nearest neighbors

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