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 is sequential but not Fréchet–Urysohn
Example
Let . The are isolated; neighbourhoods of contain a tail of its row; a neighbourhood of contains neighbourhoods of all but finitely many . Then is sequential, but is not Fréchet–Urysohn.
Facts & Assumptions
Given: The displayed topology on and .
Fréchet–Urysohn and sequential spaces have the closure and sequential-closed meanings in Fréchet–Urysohn spaces and sequential spaces.
Closure is characterized by meeting every neighbourhood, and convergence by eventual membership in every neighbourhood (A point lies in the closure of iff every basic neighbourhood of it meets ; the closure is the smallest closed superset and equals together with its derived set, Convergence and cluster points of a sequence in a topological space, sequential continuity, and the sequential closure).
Finite subsets of 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
Every neighbourhood of meets , so by [L1]. No sequence in converges to : 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 on every unvisited row. The resulting neighbourhood omits the whole sequence.
Let be sequentially closed. An isolated closure point lies in . If , then meets its -th row arbitrarily far out; recursion and least elements from [L2] give a sequence of row points in converging to , so . If , then infinitely many lie in : otherwise omit the finitely many rows whose centres lie in . In every remaining row, the preceding conclusion shows that has only finitely many points; using their maximum as in [L2] gives a canonical tail disjoint from . These tails form a neighbourhood of disjoint from , contradicting .
Hence is not Fréchet–Urysohn.
The indices with form an infinite subset of ; list them increasingly using [L2]. The resulting sequence of row centres converges to , so sequential closedness puts in . Thus every sequentially closed contains all its closure points and is closed. Therefore is sequential.
The two conclusions prove the example.
Depends on
- Fréchet–Urysohn spaces and sequential spaces
- Convergence and cluster points of a sequence in a topological space, sequential continuity, and the sequential closure
- A point lies in the closure of $A$ iff every basic neighbourhood of it meets $A$; the closure is the smallest closed superset and equals $A$ together with its derived set
- Every nonempty finite set of reals has a maximum and a minimum
- The well-ordering principle
- The recursion theorem
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
- Arens' space (Wikipedia) (standard reference, not scraped)
- D. Ma, A note about the Arens space (Dan Ma's Topology Blog) (standard reference, not scraped)
- D. Ma, Sequential spaces, I (Dan Ma's Topology Blog) (standard reference, not scraped)