Alphabeta Math
CorollaryStatement: AI-adaptedProof: AI-generatedSession-authored (Fable 5 assisted)precheck passverified 2026-08-09 (gpt-5.6-terra-codex-subscription)
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.

Assuming countable choice, perfect normality, and hence T6T_6, is hereditary

Statement

Assuming the Axiom of Countable Choice, perfect normality is hereditary. Consequently T6T_6 is hereditary.

Facts & Assumptions

Given: The Axiom of Countable Choice and a subspace SS of a perfectly normal space XX.

[L2]

A space is completely normal exactly when every one of its subspaces is normal; T1T_1 is hereditary (A space is completely normal if and only if every subspace is normal, T0T_0, T1T_1, and Hausdorffness are hereditary).

Proof

technique · direct
1.1

By [L1], XX is completely normal. Every subspace of SS is then a subspace of XX, hence normal by [L2]; applying [L2] to SS shows that SS is completely normal. The T1T_1 clause of [L2] also shows that SS is T1T_1 when XX is T6T_6.

A1L1L2
1.2

Let FF be closed in SS. Write F=CSF=C\cap S with CC closed in XX; perfect normality writes C=nNUnC=\bigcap_{n\in\mathbb N}U_n with every UnU_n open in XX.

F1
2.1

Then F=nN(UnS)F=\bigcap_{n\in\mathbb N}(U_n\cap S), a GδG_\delta of SS. Thus SS is perfectly normal, and with its inherited T1T_1 property it is T6T_6 when XX is T6T_6.

F1step 1.1step 1.2

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: 93 results over 19 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