Alphabeta Math
ExampleConstruction: AI-adaptedVerification: Not suppliedjudge 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.

A worked preservation table for subspaces and products of the standard, cofinite, and ordinal topologies

Example

The discrete topology is T1, Hausdorff, regular, normal, completely regular, and completely normal: singleton complements and singleton sets give all required separating opens, and every function to [0,1] is continuous. Its subspaces and products keep the positive properties listed in T0, T1, T2, regularity, T3, complete regularity, and Tychonoffness are hereditary and T0, T1, T2, regularity, T3, complete regularity, and Tychonoffness are productive.

For an infinite set with the cofinite topology of The discrete, indiscrete, cofinite, cocountable, particular-point and Sierpinski topologies, every singleton is closed, so the space is T1; two nonempty open sets intersect, so it is not Hausdorff. This displays why the positive table does not infer a higher axiom from T1 alone. An ordinal with the order topology of The order topology on an ordinal, with the half-open intervals (α,β] and the initial segments [0,β] as a basis supplies the contrasting clopen order intervals used by the deleted-plank construction.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

30 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