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

Arens space S2S_2 is sequential but not Fréchet–Urysohn

Example

Let S2={}{xn:nN}{xn,m:n,mN}S_2=\{\infty\}\cup\{x_n:n\in\mathbb N\}\cup\{x_{n,m}:n,m\in\mathbb N\}. The xn,mx_{n,m} are isolated; neighbourhoods of xnx_n contain a tail of its row; a neighbourhood of \infty contains neighbourhoods of all but finitely many xnx_n. Then S2S_2 is sequential, but is not Fréchet–Urysohn.

Facts & Assumptions

Given: The displayed topology on S2S_2 and A={xn,m:n,mN}A=\{x_{n,m}:n,m\in\mathbb N\}.

[A1]

Fréchet–Urysohn and sequential spaces have the closure and sequential-closed meanings in Fréchet–Urysohn spaces and sequential spaces.

[L2]

Finite subsets of N\mathbb N have maxima, nonempty subsets have least members, and recursion produces sequences from uniquely specified successive terms (Every nonempty finite set of reals has a maximum and a minimum, The well-ordering principle, The recursion theorem).

Verification

technique · constructive
1.1

Every neighbourhood of \infty meets AA, so A\infty\in\overline A by [L1]. No sequence in AA converges to \infty: if it visits a row infinitely often, a neighbourhood omitting that row defeats convergence. If it visits every row finitely, use [L2] to put the threshold on each visited row one above the maximum selected second coordinate, and threshold 00 on every unvisited row. The resulting neighbourhood omits the whole sequence.

L1L2construct
1.2

Let CC be sequentially closed. An isolated closure point lies in CC. If xnCx_n\in\overline C, then CC meets its nn-th row arbitrarily far out; recursion and least elements from [L2] give a sequence of row points in CC converging to xnx_n, so xnCx_n\in C. If C\infty\in\overline C, then infinitely many xnx_n lie in CC: otherwise omit the finitely many rows whose centres lie in CC. In every remaining row, the preceding conclusion shows that CC has only finitely many points; using their maximum as in [L2] gives a canonical tail disjoint from CC. These tails form a neighbourhood of \infty disjoint from CC, contradicting C\infty\in\overline C.

A1L1L2
2.1

Hence S2S_2 is not Fréchet–Urysohn.

step 1.1A1
2.2

The indices nn with xnCx_n\in C form an infinite subset of N\mathbb N; list them increasingly using [L2]. The resulting sequence of row centres converges to \infty, so sequential closedness puts \infty in CC. Thus every sequentially closed CC contains all its closure points and is closed. Therefore S2S_2 is sequential.

step 1.2A1L2
3.1

The two conclusions prove the example.

step 2.1step 2.2discharge-construct

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · next 3 levels

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