Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-14
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.

Countable compactness closes in the bidual

Statement

Assume the ultrafilter lemma, the Axiom of Dependent Choice (DC), and HB. Let X be a real or complex Banach space and let AX be relatively weakly countably compact: every sequence in A has a weak cluster point in X. Then A is norm bounded and

JX(A)wJX(X)X.

Here the closure uses σ(X,X). The conclusion does not assert that the cluster point or the representing point belongs to A.

Facts & Assumptions

Given: the three stated principles, X, and A as in the statement.

[F1]

Relative weak countable compactness means that every sequence in the set has a cluster point in the ambient weak space, with "cluster" requiring every neighborhood to contain arbitrarily late terms (Relative weak compactness and three sequential notions).

[F2]

The weak and weak-star topologies are the initial topologies of their evaluation maps; basic weak-star neighborhoods impose only finitely many evaluation inequalities (Weak topology on a normed space, The weak-star topology from finite evaluations, Basic weak star neighborhoods).

[F3]

Assuming the ultrafilter lemma, the dual unit ball is weak-star compact (Banach–Alaoglu), and arbitrary products of compact Hausdorff spaces are compact (Assuming the ultrafilter lemma, an arbitrary product of compact Hausdorff spaces is compact).

[F4]

Under HB the canonical map JX:XX is an isometry, for both scalar fields (Relative Hahn–Banach makes the canonical bidual map an isometry). HB is the named relative dominated-extension principle (The real dominated-extension principle as an additional hypothesis over ZF).

[F5]

Assuming DC, a pointwise bounded family of bounded operators on a Banach space is uniformly norm bounded (Uniform boundedness principle). If the target is Banach, the bounded-operator space is Banach (If (Y) is Banach then (\mathcal B(X,Y)) is Banach).

[F6]

DC supplies a sequence following any entire relation from a specified initial state (The axiom of dependent choice: a relation in which every element is related to something admits an N-indexed chain).

[F10]

On the scalar field put ρ(s,t)=min{1,st}. This bounded metric induces the usual scalar topology, since its balls of radius less than 1 are the usual balls. It is complete: a ρ-Cauchy sequence is Cauchy for the usual metric by testing tolerances below 1, and its usual scalar limit is also its ρ-limit. The standard weighted metric on a countable product of complete metrics bounded by 1 therefore applies to copies of (K,ρ) and induces the product topology; metric spaces are Hausdorff (The standard weighted metric on a countable product of bounded complete metric spaces is complete, The reals are complete, The complex plane is complete, and convergence is equivalent to convergence of real and imaginary parts, Distinct points of a metric space have disjoint balls around them, The product set iIXi of functions choosing a point in each factor, the projections, the box topology, and the product topology as the initial topology of the projections; the empty product is a one-point space).

[F12]

A nonempty at-most-countable set can be enumerated by a sequence, finite Cartesian products of countable sets are countable, the natural numbers are cofinal in the reals, and 1/n is eventually smaller than every positive real (A nonempty set is at most countable iff it is a surjective image of N, A product of two at most countable sets is at most countable, Every complete ordered field is Archimedean, For every ε>0 in a complete ordered field there is a natural n1 with 1/n<ε).

Proof

Proof technique: the Grothendieck pointwise-compactness argument, with each countable selection implemented by DC.

1.1

If A=, it is norm bounded and JX(A)= has empty weak-star closure, so both conclusions hold. Hence assume A.

given
1.2

Put K=BX with its weak-star topology and define Φ:XKK by Φ(x)(u)=u(x). Each Φ(x) is continuous on K by [F2], so Φ(X)C(K). The space K is compact by [F3] and Hausdorff because distinct members of X differ at some xX, whose evaluation separates them in the Hausdorff scalar field. By [F4], Φ(x)=x and Φ is injective. Since every uX is zero or a scalar multiple of a member of K, [F2] shows that the pointwise topology on Φ(X) is exactly the weak topology transported from X.

F2F3F4
1.3

For each uX the scalar set u(A) is bounded. Otherwise every set En={aA:u(a)>n}, n1, is nonempty. Apply DC to finite valid histories, starting with the empty history and extending the nth stage by an element of En+1; this gives (an) with u(an)>n+1. Let a be a weak cluster. The weak neighborhood u(xa)<1 contains arbitrarily late an, while [F12] lets us take such an n with n+1>u(a)+1. Then u(an)u(a)+1<n+1, a contradiction.

F1F2F6F12
1.4

We shall repeatedly use this choice-free consequence of compactness. If (zn) is a sequence in a compact space, then the closed sets CN={zn:nN} are nonempty, nested, and have the finite-intersection property. By [F8] some z lies in every CN; by the closure characterization, every neighborhood of z contains terms with arbitrarily large indices. Thus z is a cluster point of the sequence.

F8
2.1

Every sequence in M:=Φ(A) has a pointwise cluster in Φ(X). Indeed, injectivity gives its unique lift (an) in A; [F1] gives a weak cluster aX, and the topology identification in step 1.2 makes Φ(a) a pointwise cluster.

F1step 1.2
2.2

The dual X=B(X,K) is Banach: the real and complex scalar fields are Banach and [F5] applies to the bounded-operator space. The family {JX(a):aA}B(X,K) is pointwise bounded by step 1.3, so UBP under the assumed DC gives R:=supaAJX(a)<.

F5step 1.3
3.1

The HB isometry [F4] gives a=JX(a)R for every aA. Thus A, and equivalently M in the supremum norm, is norm bounded.

F4step 1.2step 2.2
4.1

Let B=Mp be the closure in the full product KK. For each tK, step 3.1 gives h(t)R for hM. The scalar disk DR={z:zR} is compact Hausdorff by [F9], including R=0; hence DRK is compact by [F3]. It is closed in KK, so BDRK, and B is closed in that product. Therefore B is compact by [F8].

F3F8F9step 3.1
5.1

We prove BC(K). Suppose instead that gB is discontinuous at yK. Then for some ε>0, every neighborhood of y meets Z={zK:g(z)g(y)ε}. This is exactly the negation of continuity at y into the metric scalar field, written with one failed positive tolerance. Notice yZ.

F10step 4.1assume-contra
6.1

Put U0=K and ηn=ε/(n+1) for n1. DC on finite valid histories constructs hnM, open neighborhoods Un of y, and xnK such that hn(y)g(y)<ηn/2 and hn(xm)g(xm)<ηn/2 for m<n, while yUnUnUn1{z:hn(z)hn(y)<ηn} and xnUnZ. At stage n, the approximation is possible because g is in the pointwise closure of M; the set to be shrunk is an open neighborhood of y because hn is continuous; [F7] supplies Un; and step 5.1 makes UnZ nonempty. Thus the relation extending a finite valid history is entire, exactly the hypothesis of DC.

F2F6F7step 5.1construct
7.1

By step 2.1, (hn) has a pointwise cluster h=Φ(a)Φ(X). By step 1.4, (xn) has a cluster xK. The nesting in step 6.1 gives xmUn whenever mn, so the closure characterization gives xUn for every n.

F8step 1.4step 2.1step 6.1
8.1

Hence hn(x)hn(y)<ηn and hn(y)g(y)<ηn/2. Since ηn0 by [F12], hn(x)g(y). But h is a pointwise cluster of (hn), so h(x) is a cluster of the convergent scalar sequence (hn(x)); scalar Hausdorffness forces h(x)=g(y).

F10F12step 6.1step 7.1
9.1

For fixed m, step 6.1 gives hn(xm)g(xm) as n. The same cluster-and-uniqueness argument gives h(xm)=g(xm). Since xmZ, we therefore have h(xm)h(x)=g(xm)g(y)ε for every m.

F10F12step 5.1step 6.1step 7.1step 8.1
10.1

The function h=Φ(a) is continuous on K. Thus {z:h(z)h(x)<ε/2} is a neighborhood of the cluster x and must contain arbitrarily late xm, contradicting step 9.1. Therefore every gB is continuous and BC(K).

F1F2step 1.2step 7.1step 9.1discharge-contradiction: step 5.1
11.1

Fix gB. For positive integers r,s and hM, define Vhr,s={(t1,,tr)Kr:h(tj)g(tj)<1/s for 1jr}. These sets are open because g,hC(K) by step 10.1, and they cover Kr because g lies in the pointwise closure of M. The finite power Kr is compact by [F3], so some nonempty finite list of members of M has the corresponding Vhr,s covering Kr.

F2F3step 4.1step 10.1
12.1

Pair the positive integer indices (r,s) using [F12]. Apply DC to finite histories of choices of the finite subcovers from step 11.1; the extension relation is entire. Thus obtain one finite list Fr,sM for every pair. Their union M0 is at most countable: retain the finite-list order, pad each nonempty list by its first term, and enumerate the pairs of natural indices using [F12]. No member of an uncountable family has been selected.

F6F12step 11.1
13.1

The point g lies in the pointwise closure of M0: for finitely many points and tolerance δ>0, repeat points if needed to form a positive-length tuple and choose s with 1/s<δ; a member of Fr,s gives all the inequalities. Let P=M0p. Then gPB; P is closed in compact B, hence compact by [F8], and it is separable because the at-most-countable M0 is dense in it.

F8F12step 4.1step 12.1
14.1

We record the compact-cluster argument of Haase's Lemma E.1. Let (qn)K, qK, and let (vj) be pointwise dense in P. If vj(qn)vj(q) for every j, then v(qn)v(q) for every vP. Indeed, let C be the intersection of the closures of all tails of (qn); it is nonempty by step 1.4. For zC, continuity and the assumed scalar convergence give vj(z)=vj(q) for every j. Pointwise density then gives v(z)=v(q) for every vP: otherwise the two-coordinate neighborhood of v at z,q with radius v(z)v(q)/3 would contain no vj. If v(qn) failed to converge to v(q), least-index recursion would give a subsequence staying some fixed positive distance away. Its closed tail closures have a common point zC by [F8], while continuity of v at z contradicts both v(z)=v(q) and that fixed separation.

F2F8step 1.4step 10.1step 13.1
14.2

The compact separable pointwise space P is nonempty because it contains g. Enumerate a nonempty pointwise-dense subset as (vj) using [F12]. On the countable product of the bounded scalar metrics ρ use the standard weighted product metric D from [F10], and pull it back along q(vj(q))j to a continuous pseudometric d on K.

F10F12step 13.1
15.1

For each positive integer n, the open d-balls of radius 1/n cover K, so compactness gives a nonempty finite list of centers. DC, applied to finite histories of such lists, chooses one list for each n. Pad every list by its first center and use the countable pairing in [F12] to enumerate the union as (qm). For each qK and each n, take the first center in the nth list whose ball contains q; the resulting sequence qmn satisfies d(qmn,q)<1/n, hence vj(qmn)vj(q) for every j.

F3F6F10F12step 14.2
16.1

The evaluations at (qm) separate P. If v,wP agree at every qm, then for arbitrary qK use the sequence from step 15.1. Step 14.1 gives v(qmn)v(q) and w(qmn)w(q); equality term by term and scalar Hausdorffness give v(q)=w(q). Thus v=w.

F10step 14.1step 15.1
17.1

The evaluation map E:PKN, E(v)=(v(qm))m, is continuous for the pointwise and product topologies by [F2] and injective by step 16.1. Its corestriction to E(P) is a continuous bijection from compact P to a metric, hence Hausdorff, space. By [F11] it is a homeomorphism. Pulling back the restriction of the weighted metric built from ρ therefore metrizes the pointwise topology of P.

F2F10F11step 13.1step 16.1
18.1

Enumerate M0 as (wk), with repetitions allowed. Since it is dense in the metric space P, for each n1 there is a k with dP(wk,g)<1/n; take the least such k. This defines, without choice, a sequence (wkn) in M0 converging to g pointwise.

F12step 13.1step 17.1
19.1

Lift this sequence uniquely to (an) in A. By [F1] it has a weak cluster aX, so Φ(a) is a pointwise cluster of (wkn) by step 1.2. Every scalar coordinate of that sequence converges to the corresponding coordinate of g by step 18.1; uniqueness of scalar cluster points gives g=Φ(a). Since gB was arbitrary, BΦ(X).

F1F2F10step 1.2step 18.1
20.1

Let xJX(A)w and restrict it to K: g(t)=x(t). Every finite pointwise neighborhood of g on K is the restriction of a basic weak-star neighborhood of x in X, so it meets JX(A) by [F2]. Hence gB, and step 19.1 gives aX with g(t)=t(a) for every tK.

F2step 1.2step 4.1step 19.1
21.1

For arbitrary uX, the equality is immediate if u=0; otherwise u/uK, and linearity gives x(u)=ug(u/u)=u(a)=JX(a)(u). Thus x=JX(a)JX(X). Together with step 3.1 and the empty case of step 1.1 this proves both assertions. The ultrafilter lemma is spent in steps 1.2, 4.1 and 11.1 through compactness; HB is spent only in the isometry in steps 1.2 and 3.1; DC is spent in UBP at step 2.2 and in the explicit finite-history constructions of steps 1.3, 6.1, 12.1 and 15.1.

F3F4F5F6step 1.1step 3.1step 20.1

Source notes

Haase's Lemma E.1 and Theorems E.2, E.3 and E.14, printed pp. 345–347 and 354–355, supply the complete compact-cluster, metrization, countable-reduction, and pointwise-closure arguments. The proof above changes Haase's phrase "take gx" to a cover indexed by every available function and uses DC only to choose countably many finite subcovers; this avoids an unrecorded choice over all tuples. It also supplies the dual-completeness premise needed by UBP and uses closed tail closures, rather than a metric compactness theorem, to obtain cluster points in the possibly nonmetrizable space K.

Depends on

Used by

Dependency tree · two levels

136 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