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.
Nagata Cp theorem remains topological
Statement
For Tychonoff spaces and , an isomorphism of topological rings , where carries the topology of pointwise convergence inherited from and , implies .
This result is recorded, not proved here, and it is distinct from the ring-only description of the Stone–Čech compactification: the local Gelfand–Kolmogorov theorem identifies the maximal ideals of set-theoretically with the points of and detects which of those ideals are fixed (Gelfand-Kolmogorov for rings of continuous functions), but does not assert that the ring alone reconstructs the topology of . Nagata's theorem instead includes the pointwise topology as part of the data and recovers itself. The catalogue target is Nagata's theorem: the topological ring determines ‡, and it stays a Recorded result.
Remarks
- Orientation only. No item on this page depends on this statement; it is not a supplier, and it is excluded from every proof path.
- Open obligation for the catalogue. Full-text verification of the exact statement, hypotheses and the pointwise-topology convention is an open repair obligation on the catalogue target, not a fact established here.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
6 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.