Solution
= Solution
A <large cardinal> axiom says that there is an uncountable <cardinal> with a strong closure, reflection, combinatorial or embedding property. Its interest is not merely the magnitude of the <cardinal>: it packages a universe-like portion of <set> theory, or a coherent way of comparing the universe with a proper <inner model>. Such axioms form a hierarchy extending ordinary <ZFC>, compared through <relative consistency> implications. The consistency qualifications are essential; an existence axiom is not a theorem of <ZFC> simply because its consequences are attractive.
The basic example is a <strongly inaccessible cardinal>: an uncountable <regular cardinal> $\kappa$ which is a <strong limit cardinal>, so
$$
\operatorname{cf}(\kappa)=\kappa,\qquad 2^\lambda<\kappa\quad(\lambda<\kappa).
$$
These conditions imply $|V_\alpha|<\kappa$ for every $\alpha<\kappa$. Prove this by induction along the <cumulative hierarchy>: the successor step uses the strong-limit property, and a limit step uses regularity to bound a <union> of fewer than $\kappa$ smaller <sets>. Thus every member of $V_\kappa$ has <cardinality> below $\kappa$.
Consequently \b[$V_\kappa$ is a <transitive model> of <ZFC>]. Pairing, <union>, <power set>, <separation>, <axiom of infinity> and <foundation> stay within the hierarchy. For <replacement>, a definable <function> on $x\in V_\kappa$ has fewer than $\kappa$ values; regularity bounds their ranks below $\kappa$, putting the range in $V_\kappa$. Ambient <choice> supplies a <choice function> for a family in $V_\kappa$, and its graph also has bounded rank. This verifies the substantial closure axiom rather than only saying that the rank is large. It also shows why inaccessible existence cannot be proved in a consistent <ZFC>: it would yield a <set> <first-order model> of <ZFC> and hence its consistency, contrary to the <Gödel second incompleteness theorem>.
An uncountable regular limit <cardinal> is a <weakly inaccessible cardinal>; requiring the strong-limit inequality is stronger without additional hypotheses. Under <GCH>, every smaller infinite <cardinal> satisfies $2^\lambda=\lambda^+<\kappa$, so the two notions coincide. This distinction separates cardinal-arithmetic assumptions from the regularity requirement.
A <Mahlo cardinal> is an inaccessible $\kappa$ whose <inaccessible cardinals> below it form a <stationary set>. Thus every <club set> meets those inaccessibles, which strengthens mere unboundedness. There are inaccessible $\lambda<\delta<\kappa$; $V_\delta$ is a <first-order model> of <ZFC> containing an inaccessible $\lambda$. Mahloness therefore supplies a consistency statement stronger than the bare existence of one inaccessible. Iterating the demand that smaller <cardinals> have the same reflection property leads to further levels of the hierarchy.
A <weakly compact cardinal> is a logical and combinatorial strengthening of inaccessibility. One standard characterization is an inaccessible $\kappa$ with
$$
\kappa\longrightarrow(\kappa)^2_2:
$$
every two-colouring of pairs has a homogeneous <subset> of size $\kappa$. Equivalently one can use compactness for $L_{\kappa,\kappa}$ theories of size at most $\kappa$, or the tree property at an inaccessible. These viewpoints explain the terminology: a local collection of compatible requirements has a global realization, and tall narrow trees cannot avoid cofinal branches. They are characterization statements; the elementary closure and measure arguments below are separate proofs of the consequences used here.
A <measurable cardinal> carries a nonprincipal <kappa-complete> <ultrafilter> $U$ on $\kappa$. Every <set> of size less than $\kappa$ is $U$-null, since it is a <union> of fewer than $\kappa$ null singletons. Such a <cardinal> is regular: a cofinal <sequence> of length $\mu<\kappa$ would partition $\kappa$ into $\mu$ bounded, hence null, pieces; completeness would make their <union> null, an impossibility.
It is also strong limit. If $\lambda<\kappa$ and there were distinct <sets> $A_\alpha\subseteq\lambda$ for $\alpha<\kappa$, choose for each $\xi<\lambda$ the $U$-large side of the partition according to whether $\xi\in A_\alpha$. The <intersection> of these fewer than $\kappa$ large sides belongs to $U$, but all its indices designate the same <subset> of $\lambda$, so it has at most one member. This contradicts nonprincipality. Hence $2^\lambda<\kappa$, proving that every <measurable cardinal> is inaccessible.
The measure gives an <ultrapower embedding>. Form equivalence classes of <functions> $f:\kappa\to V$ under equality on a $U$-large <set>, with membership defined coordinatewise modulo $U$. Induction on <first-order formulas> proves elementarity: Boolean operations use the <ultrafilter> laws, and the existential step chooses coordinate witnesses on a large <set>. Countable completeness makes the <ultrapower> <well-founded>. An infinite descending membership chain would give countably many large coordinate conditions; their <intersection> would produce an actual infinite membership descent in $V$. Collapse the <ultrapower> to a <transitive class> $M$, obtaining $j:V\to M$.
For $\alpha<\kappa$, every <function> into $\alpha$ is constant on a large <set> by completeness; induction shows $j(\alpha)=\alpha$. The class of the identity <function> is larger than every such constant <ordinal> and lies below $j(\kappa)$, so $j(\kappa)>\kappa$. Thus the <critical point of an elementary embedding> is $\kappa$. The measure viewpoint has become a precise self-similarity principle for the universe.
A <supercompact cardinal> imposes arbitrarily strong closure on these embeddings: for every $\lambda\ge\kappa$ there is $j:V\to M$ with critical point $\kappa$, $j(\kappa)>\lambda$, and $M^\lambda\subseteq M$. It implies measurability by the derived <ultrafilter>
$$
U=\{X\subseteq\kappa:\kappa\in j(X)\}.
$$
Elementarity makes this an <ultrafilter>; fixed <ordinals> below $\kappa$ show that singletons are null. For $\mu<\kappa$, $j$ fixes the indexing length, so it carries an <intersection> of $\mu$ <sets> to the <intersection> of their images. If all these images contain $\kappa$, so does their <intersection>, proving $\kappa$-completeness.
These examples illustrate three connected uses of <large cardinals>: obtaining <set> <first-order models> and stronger consistency statements, extending finite or countable compactness and partition phenomena to uncountable domains, and constructing <elementary embeddings> with controlled closure. They also interact with <inner models>: an inaccessible remains inaccessible in the <constructible universe>, since it cannot acquire a new short cofinal <sequence> there and there are fewer <subsets> of smaller <ordinals>. A <measurable cardinal>'s measure need not belong to that <inner model>, so preservation of the stronger property is a different issue. <Large cardinal> axioms are thus structured additional hypotheses, with carefully distinguishable consequences and relative-consistency claims, rather than a single claim that sufficiently big <cardinals> exist.