How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced — the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted — a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated — a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Maximum and minimum of a set
Definition
Let and .
- is a maximum (or greatest element) of if and for every .
- is a minimum (or least element) of if and for every .
A set has at most one maximum: if and are both maxima then gives and gives , so by antisymmetry of the order, which is immediate from the trichotomy axiom of an ordered field (Ordered field, Complete ordered field (least-upper-bound property)). The same argument applies to minima, so we may write and .
Remarks
- A maximum is precisely an upper bound of (Complete ordered field (least-upper-bound property)) that happens to lie in ; a minimum is a lower bound of (Lower bound, bounded below, bounded set) that lies in . In particular a set with a maximum is bounded above and a set with a minimum is bounded below.
- The empty set has neither a maximum nor a minimum, because the requirement cannot be met.
- The membership requirement is exactly what separates a maximum from a supremum, and it is the theme of this page. A supremum is a bound on the set and is not asked to belong to it; a maximum is an element of the set. The two agree exactly when the supremum happens to be attained (The supremum is attained exactly when a maximum exists), and they genuinely differ in general (FALSE: the supremum of a set belongs to the set).
- Every nonempty finite subset of has both a maximum and a minimum (Every nonempty finite set of reals has a maximum and a minimum), which is what licenses the notation . Infinite sets need not: the failure of attainment is an infinitary phenomenon.
Depends on
Used by
- A continuous real function on a compact subset of ℝ is bounded Corollary
- Every continuous function on an interval has a primitive; two primitives differ by a constant; and ∫ₐᵇ f = G(b)-G(a) for any primitive G Corollary
- If f,g are integrable on [a,b] then so are | f|, f², fg, max(f,g) and min(f,g), and |∫ₐᵇ f| ≤ ∫ₐᵇ| f| Corollary
- The image of an interval under a continuous real function is order-convex, hence an interval, and the image of a closed bounded interval is a closed bounded interval Corollary
- [0,1) is neither open nor closed in ℝ Counterexample
- A function differentiable on [0,1] whose derivative is unbounded, hence not Riemann integrable Counterexample
- A function that is not Riemann integrable although | f| is Counterexample
- A supremum need not belong to its set: sup(0,1) = 1 ∉ (0,1) Counterexample
- An upper semicontinuous function on [0,1] that is bounded below and attains no minimum, so the semicontinuous extreme value theorem is genuinely one-sided Counterexample
- Continuous triangular spikes on [0,1] converge pointwise to zero but not uniformly when monotonicity is absent Counterexample
- ℕ with the discrete metric is bounded and is not totally bounded Counterexample
- On (0,∞) the metrics |x-y| and |1/x - 1/y| have the same topology and are not uniformly equivalent Counterexample
- On (0,∞) the metrics |x-y| and |1/x - 1/y| share their topology and not their Cauchy sequences Counterexample
- On (0,1) the identity is bounded with no greatest value and x ↦ 1/x is continuous and unbounded, so the extreme value theorem needs compactness and not merely boundedness of the domain Counterexample
- On ℕ with d(m,n) = 1 + 1/(m+n) for m ≠ n the sets {n, n+1, …} are nested, closed, bounded and complete with empty intersection Counterexample
- On ℝ the metrics |x-y| and min(|x-y|,1) are uniformly but not Lipschitz equivalent Counterexample
- Refuted: a pointwise bounded family of continuous functions is equicontinuous. The spikes are bounded by 1 everywhere and are not equicontinuous at 0 Counterexample
- Refuted: C(X,Y) is closed in the topology of pointwise convergence. The ramps on [0,1] converge pointwise to a discontinuous limit Counterexample
- Refuted: convergence uniformly on every compact subset of ℝ implies uniform convergence. The maps x ↦ x/(n+1) separate the two Counterexample
- The cover {(1/k, 1)} of (0,1) has no finite subcover, so (0,1) is not compact Counterexample
- The Dirichlet function on [0,1] has lower Darboux integral 0 and upper Darboux integral 1, so it is bounded and not Riemann integrable Counterexample
- The hyperbola {(x,y) : xy = 1} is closed in ℝ² and its image under the first projection is ℝ ∖ {0}, which is not closed Counterexample
- The identity on (0,1) is bounded with no greatest value, and on [0,∞) it is continuous and unbounded Counterexample
- The identity on [0,1] attains its maximum at 1 and its minimum at 0 with derivative 1 at both, so Fermat's theorem genuinely needs the extremum to be at an interior point Counterexample
- The indicator of the Smith-Volterra-Cantor set is discontinuous exactly on a nowhere dense set, and is not Riemann integrable, because that set does not have measure zero Counterexample
- The open interval (0,1) is totally bounded and not compact, the cover by the intervals (1/(k+2), 1) having no finite subcover Counterexample
- Two copies of ℝ glued along ℝ ∖ {0} give a non-Hausdorff quotient of a metrizable space, by an open quotient map Counterexample
- x ↦ 1/x is continuous on (0,1) and sends the Cauchy sequence (1/(k+2))_k ≥ 0 to an unbounded one Counterexample
- ℤ and {n + 1/n : n ≥ 2} are disjoint closed subsets of ℝ at distance 0, so the set-to-set distance is not a metric Counterexample
- ℤ is closed and not compact, and (0,1) is bounded and not compact: neither hypothesis of Heine-Borel can be dropped Counterexample
- Grid partitions of a rectangle in ℝᵐ, their cells, refinements and mesh Definition
- Local (relative) maximum and minimum of f : A → ℝ at a point, the strict forms, and what it means for the point to be interior to A Definition
- Metric space: d(x,y) = 0 iff x = y, symmetry, and the triangle inequality; pseudometric and ultrametric Definition
- Open subset of ℝ (every point has a neighbourhood inside it), closed subset (complement open), and clopen Definition
- Partition of [a,b] as a finite strictly increasing list a = t₀ < t₁ < … < tₙ = b, its subintervals and their lengths, its mesh, refinement, and the common refinement of two partitions Definition
- The p-norms ‖ x‖ₚ for rational p ≥ 1, and ‖ x‖_∞ Definition
- The topology of compact convergence on C(X,Y) for metric X and Y: uniform convergence on each compact subset of X Definition
- (0,1) + (2,3) = (2,4), with supremum 4 = sup(0,1) + sup(2,3) Example
- {1/k : k ≥ 1} ∪ {0} is compact while {1/k : k ≥ 1} is not closed Example
- ∫₀¹ x² = 1/3, computed from the Darboux definition with uniform partitions and the closed form ∑_k<n k² = n(n-1)(2n-1)/6 Example
…and 120 more results.
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 3 results over 3 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.
Sources
- Maximum and minimum (Wikipedia) (standard reference, not scraped)
- W. Rudin, Principles of Mathematical Analysis, 3rd ed., Ch. 1 (standard reference, not scraped)
- David H. Ernst, An Introduction to Proof via Inquiry-Based Learning, Section 5.1 (standard reference, not scraped)