Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-generatedSession-authored (Fable 5 assisted)precheck passjudge pass (z-ai/glm-5.2)audited 2026-07-29
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.

A sequence converges in the topology of pointwise convergence exactly when it converges at every point

Statement

Let XX be a set, let (Y,TY)(Y, \mathcal{T}_Y) be a topological space, and give YXY^{X} the topology of pointwise convergence (The topology of pointwise convergence on YXY^{X}, which is the product topology, and its restriction to C(X,Y)C(X,Y)). Let (fk)(f_k) be a sequence in YXY^{X} and let fYXf \in Y^{X}. Then

fkf in YXfk(x)f(x) in Y for every xX,f_k \to f \text{ in } Y^{X} \qquad \Longleftrightarrow \qquad f_k(x) \to f(x) \text{ in } Y \text{ for every } x \in X ,

convergence being that of Convergence and cluster points of a sequence in a topological space, sequential continuity, and the sequential closure on both sides.

No uniqueness of limits is asserted on either side. In a general topological space a sequence may converge to several points, and the equivalence above is between two conditions on the pair ((fk),f)((f_k), f), not between two values (Convergence and cluster points of a sequence in a topological space, sequential continuity, and the sequential closure). No choice principle is used: the only selection made below is of a least natural number and of a maximum among finitely many.

Facts & Assumptions

Given: A set XX, a topological space (Y,TY)(Y,\mathcal{T}_Y), the space YXY^{X} with the topology of pointwise convergence, a sequence (fk)(f_k) in YXY^{X} and a point fYXf \in Y^{X}; ι\iota is the canonical natural of R\mathbb{R} (The canonical natural ι(n)=n1F\iota(n) = n \cdot 1_F of a field).

[L1]

For xXx \in X and VTYV \in \mathcal{T}_Y the set πx1[V]={gYX:g(x)V}\pi_x^{-1}[V] = \{\, g \in Y^{X} : g(x) \in V \,\} is open in YXY^{X}, and the sets {gYX:g(xj)Vj for every j<n}\{\, g \in Y^{X} : g(x_j) \in V_j \text{ for every } j < n \,\}, for nNn \in \mathbb{N}, points x0,,xn1Xx_0, \dots, x_{n-1} \in X and open V0,,Vn1YV_0, \dots, V_{n-1} \subseteq Y, form a basis for the topology of pointwise convergence (The topology of pointwise convergence on YXY^{X}, which is the product topology, and its restriction to C(X,Y)C(X,Y), The product set iIXi\prod_{i \in I} X_i 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, A family is a basis for a unique topology iff it covers the set and every point of an intersection of two members lies in a member inside that intersection; finite intersections of any subbasis form a basis).

[L2]

A set NN is a neighbourhood of a point pp exactly when there is an open UU with pUNp \in U \subseteq N; in particular an open set containing pp is a neighbourhood of pp (Neighbourhood of a point and neighbourhood base, with this library's convention that a neighbourhood need not be open).

[L3]

gkgg_k \to g in a topological space means: for every neighbourhood NN of gg there is KNK \in \mathbb{N} with gkNg_k \in N for every kKk \ge K (Convergence and cluster points of a sequence in a topological space, sequential continuity, and the sequential closure).

[L4]

If B\mathcal{B} is a basis for a topology and NN is a neighbourhood of gg, then there is BBB \in \mathcal{B} with gBNg \in B \subseteq N (Neighbourhood of a point and neighbourhood base, with this library's convention that a neighbourhood need not be open, Basis and subbasis for a topology, and the topology generated by a family of sets).

[L5]

Every nonempty subset of N\mathbb{N} has a least element (The well-ordering principle).

[L6]

For n1n \ge 1 and natural numbers k0,,kn1k_0, \dots, k_{n-1} there is an index j<nj^{\ast} < n with kjkjk_j \le k_{j^{\ast}} for every j<nj < n: the nonempty finite set of reals {ι(k0),,ι(kn1)}\{\iota(k_0), \dots, \iota(k_{n-1})\} has a maximum, attained at some index, and ι\iota is strictly increasing on N\mathbb{N}, hence reflects the order (Every nonempty finite set of reals has a maximum and a minimum, Maximum and minimum of a set, Canonical naturals are positive and strictly increasing, The canonical natural ι(n)=n1F\iota(n) = n \cdot 1_F of a field).

Proof

technique · direct
1.1

Suppose fkff_k \to f in YXY^{X}; fix xXx \in X and a neighbourhood NN of f(x)f(x) in YY, and fix an open VYV \subseteq Y with f(x)VNf(x) \in V \subseteq N.

assume-hypL2choose
1.2

Suppose instead that fk(x)f(x)f_k(x) \to f(x) in YY for every xXx \in X, and let NN be a neighbourhood of ff in YXY^{X}.

assume-hypL2
2.1

Under the assumption of step 1.1: πx1[V]\pi_x^{-1}[V] is open in YXY^{X} and contains ff, hence is a neighbourhood of ff, so there is KNK \in \mathbb{N} with fkπx1[V]f_k \in \pi_x^{-1}[V] for every kKk \ge K, that is fk(x)VNf_k(x) \in V \subseteq N for every kKk \ge K.

step 1.1L1L2L3
2.2

Under the assumption of step 1.2: there are nNn \in \mathbb{N}, points x0,,xn1Xx_0, \dots, x_{n-1} \in X and open V0,,Vn1YV_0, \dots, V_{n-1} \subseteq Y such that fBNf \in B \subseteq N, where B:={gYX:g(xj)Vj for every j<n}B := \{\, g \in Y^{X} : g(x_j) \in V_j \text{ for every } j < n \,\}.

step 1.2L1L4choose
3.1

Since NN was an arbitrary neighbourhood of f(x)f(x) and xx an arbitrary point of XX, step 2.1 says exactly that fk(x)f(x)f_k(x) \to f(x) in YY for every xXx \in X; this is the forward implication.

step 2.1L3
3.2

If n=0n = 0 in step 2.2 then BB is the empty intersection YXY^{X}, so fkBNf_k \in B \subseteq N for every kNk \in \mathbb{N}.

step 2.2L1
3.3

If n1n \ge 1 in step 2.2 then for each j<nj < n the set Aj:={mN:fk(xj)Vj for every km}A_j := \{\, m \in \mathbb{N} : f_k(x_j) \in V_j \text{ for every } k \ge m \,\} is nonempty, because fBf \in B gives f(xj)Vjf(x_j) \in V_j with VjV_j open, hence VjV_j is a neighbourhood of f(xj)f(x_j), and fk(xj)f(xj)f_k(x_j) \to f(x_j); put Nj:=minAjN_j := \min A_j.

step 1.2step 2.2L2L3L5
4.1

If n1n \ge 1: there is j<nj^{\ast} < n with NjNjN_j \le N_{j^{\ast}} for every j<nj < n, and then every kNjk \ge N_{j^{\ast}} satisfies kNjk \ge N_j for every j<nj < n, so fk(xj)Vjf_k(x_j) \in V_j for every j<nj < n, that is fkBNf_k \in B \subseteq N.

step 2.2step 3.3L6
5.1

By steps 3.2 and 4.1 there is in either case a KNK \in \mathbb{N} with fkNf_k \in N for every kKk \ge K, namely K=0K = 0 when n=0n = 0 and K=NjK = N_{j^{\ast}} when n1n \ge 1; as NN was an arbitrary neighbourhood of ff, this says fkff_k \to f in YXY^{X}, which is the converse implication.

step 3.2step 4.1L3
6.1

Steps 3.1 and 5.1 are the two implications, so the two conditions are equivalent.

step 3.1step 5.1

Remarks

Depends on

Used by

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 82 results over 21 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