A topic in the Open Knowledge Graph — a free, open map of 15,290 topics and the order to learn them in.

Concrete Categories

Graduate Depth 77 in the knowledge graph ☐ I know this ☆ Set as goal
24topics build on this
385prerequisites beneath it
See this on the map →
Categories and MorphismsFunctors+1 more→→Free Objects
concrete category forgetful functor faithful functor Set Grp Top

Core Idea

A concrete category is a category C equipped with a faithful functor U: C → Set, called the forgetful functor, that assigns to each object its underlying set and to each morphism the underlying function. Most familiar algebraic and topological categories are concrete: Grp (groups with homomorphisms), Top (topological spaces with continuous maps), Vect_k (vector spaces with linear maps), and Ring (rings with ring homomorphisms). The faithfulness of U means that morphisms in C are completely determined by their action on underlying sets, but the functor need not be full—not every set function is a group homomorphism, for instance.

How It's Best Learned

Pick three concrete categories (Grp, Top, Vect) and for each one explicitly identify the forgetful functor, verify it is faithful, and determine whether it is full. Then find an example of a non-concrete category (the homotopy category of topological spaces) and understand why no faithful functor to Set exists.

Common Misconceptions

Explainer

Most categories you've encountered — groups with homomorphisms, vector spaces with linear maps, topological spaces with continuous maps — come with an implicit understanding that their objects "have elements" and their morphisms "are functions" that preserve some structure. Concrete categories make this intuition precise in categorical language, using the functor machinery you've already developed.

A concrete category is not just a category C; it is a pair (C, U) where U: C → Set is a faithful functor, called the forgetful functor. "Forgetful" because U forgets the structure: it sends a group (G, ·) to its underlying set G, a topological space (X, τ) to the set X, a vector space V to the set of its elements — the algebraic or topological structure is discarded. Faithfulness (which you know means U is injective on each hom-set) captures the idea that the morphisms of C are completely determined by their underlying set-functions. Two distinct group homomorphisms must induce two distinct set functions; there are no "phantom morphisms" that look the same on elements but differ categorically.

The crucial asymmetry is that faithfulness does not imply fullness. Fullness of U: C → Set would mean every set function between underlying sets is a morphism in C — that every function between groups is a homomorphism, that every function between topological spaces is continuous. That is obviously false. Faithful-but-not-full is the generic situation for forgetful functors: morphisms in C must be structure-preserving functions, but not every function preserves the structure. The forgetful functor "sees" the morphisms correctly but sees more set functions than actually exist in C.

Concreteness is structure on a category, not an intrinsic property of the abstract category. The same abstract category can be concretized in multiple genuinely different ways: the category of groups can be concretized via U: Grp → Set (the standard forgetful functor), but also by sending each group to its set of subgroups, or to the set of its automorphisms. Different concretizations give different notions of "elements." Conversely, some categories cannot be made concrete at all. The homotopy category hoTop — whose morphisms are homotopy classes of continuous maps rather than the maps themselves — is a standard example: Freyd's theorem proves no faithful functor hoTop → Set exists, because the morphism sets are too "large" in a structurally inconsistent way. This non-concreteness reflects that homotopy classes are not faithfully represented by their action on points.

Practice Questions 5 questions

Prerequisite Chain

Understanding Zero → The Number Zero → Counting to Five → Counting to 10 → Counting to 20 → Counting a Set of Objects Up to 20 → Cardinality: The Last Number Counted → Matching Numerals to Quantities → Subitizing Small Quantities → Addition Within 10 → Number Bonds to 10 → Addition Within 20 → Doubles and Near Doubles → Doubles Facts Within 10 → Near Doubles Facts Within 20 → Mental Math Strategies for Addition → Mental Math: Adding and Subtracting Tens → Addition Within 100 → Repeated Addition as Multiplication → Multiplication as Equal Groups → Multiplication: Arrays → Basic Multiplication Facts (0s, 1s, 2s, 5s, 10s) → Multiplication Facts Within 100 → Division as Equal Sharing → Division as Grouping (Measurement Division) → Division: Grouping (Repeated Subtraction) Model → Division: Fair Sharing Model → Division as Equal Sharing → Division as Grouping → Basic Division Facts → Division Facts Within 100 → Multiplication and Division Fact Families → Relationship Between Multiplication and Division → Division Facts as Inverse of Multiplication → Remainders and Quotients in Division → Division Word Problems → Multi-Step Word Problems → Solving Multi-Step Word Problems → Multiplication Word Problems → Division Word Problems → Introduction to Long Division → Factors and Multiples → Prime and Composite Numbers → Equivalent Fractions → Relating Fractions and Decimals → Decimal Place Value → Integers and the Number Line → Comparing and Ordering Integers → Absolute Value → Adding Integers → Subtracting Integers → Multiplying Integers → Introduction to Exponents → Order of Operations → Integer Order of Operations → Variable Expressions → The Distributive Property → Variables and Expressions Review → Introduction to Polynomials → Adding and Subtracting Polynomials → Multiplying Polynomials → Factorial → Permutations → Combinations → Counting Principles: Addition and Multiplication Rules → Introduction to Graph Theory → Propositional Logic Foundations → Logical Equivalences → Set Operations: Union, Intersection, and Complement → Cartesian Products and Relations → Partial Orders → Binary Relations → Equivalence Relations → Injective, Surjective, and Bijective Functions → Categories and Morphisms → Functors → Full and Faithful Functors → Concrete Categories

Longest path: 78 steps · 385 total prerequisite topics

Prerequisites (3)

Leads To (1)