Maximum Theorem¶
Guarantee continuity of a parametric optimum's value and upper hemicontinuity of its maximizer correspondence when objective and compact feasible correspondence vary continuously.
Core Idea¶
The Maximum Theorem, commonly called Berge's Maximum Theorem, gives stability conditions for a parameterized optimization problem. Let \(X\) and \(\Theta\) be suitable topological spaces, let \(f:X\times\Theta\to\mathbb{R}\) be continuous, and let \(C:\Theta\rightrightarrows X\) be a nonempty compact-valued correspondence that is both upper and lower hemicontinuous. Define the value function \(v(\theta)=\max_{x\in C(\theta)} f(x,\theta)\) and the argmax correspondence \(M(\theta)=\{x\in C(\theta):f(x,\theta)=v(\theta)\}\). Then \(v\) is continuous, while \(M\) is nonempty, compact-valued, and upper hemicontinuous.
Scope of Application¶
The Maximum Theorem supports comparative statics and existence arguments wherever feasible sets and objectives vary with parameters.
- Consumer theory. Establishing continuity and upper hemicontinuity of demand under changing prices and wealth.
- Game theory. Proving best-response correspondence regularity before a fixed-point argument.
- Optimal control. Studying how value and optimal-control sets vary with state or model parameters.
- General equilibrium. Supplying continuity properties needed for equilibrium existence machinery.
- Statistical decision theory. Controlling parameterized minimizers after changing sign or loss convention.
- Numerical optimization. Distinguishing stable objective values from unstable or set-valued optimizers.
Clarity¶
Specify the topology on parameter and choice spaces. Define upper and lower hemicontinuity using one consistent convention. State that the feasible correspondence has nonempty compact values, not merely a closed graph. Use maximum rather than supremum only after attainment is secured. Keep the value function and argmax correspondence typographically distinct. Do not call the argmax continuous unless lower hemicontinuity or single-valued conditions are separately established.
Manages Complexity¶
Parametric optimization composes two varying objects: a payoff surface and a feasible set. Taking a maximum is nonlinear, and choosing an optimizer can magnify tiny parameter changes. The theorem decomposes this complexity into separate topological obligations. Upper hemicontinuity prevents feasible mass from appearing remotely; lower hemicontinuity prevents existing choices from disappearing without nearby approximants; compactness traps maximizing sequences; objective continuity transports payoff comparisons. These components yield a continuous scalar value even when the solution remains set-valued.
Abstract Reasoning¶
- Define parameter, choice, objective, and feasible correspondence with their topologies. 2. Verify nonemptiness and compactness for every feasible set in the relevant parameter domain. 3. Prove upper hemicontinuity and lower hemicontinuity of the feasible correspondence separately. 4. Verify joint continuity, or the appropriate semicontinuity halves, of the objective. 5. Use compactness to replace supremum by maximum and establish nonempty compact argmax values. 6. Prove upper and lower semicontinuity of the value and combine them into continuity.
Knowledge Transfer¶
The strict parent is Continuity. The theorem identifies topologies on inputs and outputs, controls closeness of feasible sets through two hemicontinuities, and proves that optimization preserves no-jump behavior of the value while giving a precise weaker continuity property for maximizers. The transferable lesson is to track stability of both a score and its optimizing states after a nonlinear extremization. Compact-valued correspondences, argmax sets, and quasiconcavity are domain-specific mathematical accent.
Relationships to Other Abstractions¶
Current abstraction Maximum Theorem Domain-specific
Parents (1) — more general patterns this builds on
-
Maximum Theorem is a kind of Continuity Prime
Continuity is the strict parent because Berge's theorem establishes precisely when small parameter changes produce small value changes and controlled set-valued changes of optimizers.
Hierarchy paths (2) — routes to 2 parentless roots
- Maximum Theorem → Continuity → Neighborhood → Topology
- Maximum Theorem → Continuity → Invariance
Neighborhood in Abstraction Space¶
Maximum Theorem sits in a sparse region of the domain-specific corpus (86th percentile for distinctiveness): few abstractions share its structure, so a faithful description tends to retrieve it precisely.
Family — Unclustered & Miscellaneous (1565 abstractions)
Nearest neighbors
- Feasible Region — 0.82
- Space-Filling Curve — 0.81
- Bauer Maximum Principle — 0.80
- Well-posed problem — 0.79
- Approximation Algorithm — 0.79
Computed from structural-signature embeddings · 2026-09-08