Alphabeta Math
CorollaryStatement: AI-adaptedProof: AI-generatedprecheck 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 T6, is hereditary

Statement

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

Facts & Assumptions

Given: The Axiom of Countable Choice and a subspace S of a perfectly normal space X.

[A1]

The Axiom of Countable Choice (The Axiom of Countable Choice (ACω)).

[L2]

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

Proof

technique · direct
1.1

By [L1], X is completely normal. Every subspace of S is then a subspace of X, hence normal by [L2]; applying [L2] to S shows that S is completely normal. The T1 clause of [L2] also shows that S is T1 when X is T6.

A1L1L2
1.2

Let F be closed in S. Write F=C∩S with C closed in X; perfect normality writes C=⋂n∈NUn with every Un open in X.

F1
2.1

Then F=⋂n∈N(Un∩S), a Gδ of S. Thus S is perfectly normal, and with its inherited T1 property it is T6 when X is T6.

F1step 1.1step 1.2∎

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

35 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