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.
Arzelà--Ascoli for real under Countable Choice and Dependent Choice: compact closure iff equicontinuous and pointwise bounded
Statement
Assume the Axiom of Countable Choice (The Axiom of Countable Choice ()) and the Axiom of Dependent Choice (The axiom of dependent choice: a relation in which every element is related to something admits an -indexed chain). Let be a nonempty compact metric space and . Its closure in the supremum metric is compact if and only if is equicontinuous and pointwise bounded.
Facts & Assumptions
Given: The Axiom of Countable Choice, the Axiom of Dependent Choice, and a family .
Every open cover of the compact metric space has a finite subcover (Open cover, subcover, compact metric space, and compact subset of a metric space).
is complete in the supremum metric ( is complete in the supremum metric for every nonempty compact metric space ).
A subspace of a complete metric space is complete exactly when it is closed; assuming Countable Choice and Dependent Choice, in a metric space compactness is equivalent to completeness together with total boundedness (Closed subspaces of complete metric spaces are complete; the converse under countable choice, For a metric space, compact, countably compact, limit point compact, sequentially compact, and complete together with totally bounded are all equivalent, given countable choice and dependent choice).
Equicontinuity and pointwise boundedness are as defined in Equicontinuity, pointwise boundedness, and uniform boundedness for families in .
A continuous function on a compact metric space is uniformly continuous (Heine-Cantor: a continuous map from a compact metric space to any metric space is uniformly continuous).
Proof
If , its closure is empty and compact, while both family properties hold vacuously. Hence assume . Suppose first that is equicontinuous and pointwise bounded, and fix . Let contain every ball with , , and for all whenever . Equicontinuity makes an open cover without selecting a radius for every . By [L1] take a finite subcover , . Pointwise boundedness supplies finite bounds for the values . Partition the bounded box into finitely many boxes of coordinate diameter less than , and choose one member of from each box met by an evaluation vector . For any , a chosen in the same box satisfies for all ; if , the two equicontinuity bounds give . Thus these finitely many representatives form an -net. The closure is totally bounded as well, by using an -net for and approximating each point of its closure by a member of .
Conversely suppose the closure is compact. For , [L3] supplies a finite -net in the closure. By [L5], a common positive radius makes every vary by less than .
The closure of is closed in the complete space of [L2], hence complete by [L3]. It is totally bounded by step 1.1, so [L3] makes it compact.
For , choose within in supremum distance. The two uniform-distance bounds and step 1.2 give whenever is below the common radius.
The same finite net bounds at each fixed , so is pointwise bounded.
Step 2.1 proves the forward implication; steps 2.2 and 2.3 give equicontinuity and pointwise boundedness in the converse.
Depends on
- Open cover, subcover, compact metric space, and compact subset of a metric space
- $C(K,\mathbb{R})$ is complete in the supremum metric for every nonempty compact metric space $K$
- Closed subspaces of complete metric spaces are complete; the converse under countable choice
- For a metric space, compact, countably compact, limit point compact, sequentially compact, and complete together with totally bounded are all equivalent, given countable choice and dependent choice
- Equicontinuity, pointwise boundedness, and uniform boundedness for families in $C(K,\mathbb R)$
- Heine-Cantor: a continuous map from a compact metric space to any metric space is uniformly continuous
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
- The axiom of dependent choice: a relation in which every element is related to something admits an $\mathbb{N}$-indexed chain
Used by
- Every pointwise-bounded equicontinuous sequence in C(K,ℝ) has a uniformly convergent subsequence Corollary
- Real and finite-dimensional Euclidean Ascoli–Arzelà criteria Corollary
- Rudin's bounded rational spikes are not equicontinuous and have no uniformly convergent subsequence Counterexample
- Compactness of a bounded W^1,p sequence on an interval Example
- Continuous kernel integral operator is compact on c of an interval Example
- Under the Axiom of Countable Choice and the Axiom of Dependent Choice, the family x↦|x-a|, a∈[0,1], is compact in C([0,1]) Example
- A continuous kernel defines a compact integral operator on C of an interval Lemma
- Classical parabolic solvability by weak approximation and exterior-ball barriers Lemma
- Composite midpoint Nyström operators are collectively compact and consistent Lemma
- Mean-zero Poincare estimate on bounded connected extension domains below the dimension Lemma
- Stability, collective compactness, and consistency of half-order product integration Lemma
- The subcritical W0 one p embedding into L2 Lemma
- Closed bounded test function sets are compact Theorem
- Global Schauder estimate and classical Dirichlet solvability by the continuity method Theorem
- Higher-order Rellich--Kondrachov compactness Theorem
- Morrey--Rellich compactness for p>n Theorem
- The Fréchet–Kolmogorov compactness criterion in Lᵖ(ℝⁿ) Theorem
- The volume integral scattering operator is compact Theorem
Dependency tree · two levels
51 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- The Ascoli--Arzelà Theorem (MIT) (standard reference, not scraped)