Explore related knowledge and questions →

Question 23591: A Non-Hausdorff Compact Nonclosed Instance Blocks Deleting the Hypothesis

On this page
  1. Original question and givens
  2. Definition and scope
  3. Step-by-step derivation
  4. Reverse checks
  5. Result
  6. This question review and source binding

Return to catalogue page 118

← Question derivation index · Original question batch

R0046-23591 · q-20261014-advance-20261112-r03-compact-subset-closed-in-hausdorff-0091

Original question and givens

Use complete finite labeled carrier=[o15, u15], topology=[[o15, u15], [u15], []] in its original supplied open-set order, and compact_subset K=[u15]. Qualify the topology and every Hausdorff distinct-point pair. Finite K is compact; the general theorem still needs both ambient Hausdorffness and compactness. Give (points, compact_subset, complement, Hausdorff, compact, closed, boundary).

  • G001 — Use complete finite labeled carrier=[o15, u15], topology=[[o15, u15], [u15], []] in its original supplied open-set order, and compact_subset K=[u15]. Qualify the topology and every Hausdorff distinct-point pair. Finite K is compact; the general theorem still needs both ambient Hausdorffness and compactness. Give (points, compact_subset, complement, Hausdorff, compact, closed, boundary).

Definition and scope

Use the original question domain, assumptions and cited MKO definitions. This item has second-context mathematical and bilingual review, with the model, answer and every arithmetic step independently recomputed from the original parameters; the source question remains a candidate.

Step-by-step derivation

S001 · implies

Before

source operation=compactclosed-nonhausdorff-boundary;original snapshot and mathematics retained

After

explicit ordered source output fields=[points, compact_subset, complement, Hausdorff, compact, closed, boundary]

Conditions: none

Keep the source snapshot while listing ordered fields without JavaScript.Radius uses its original mode to select6 or11 fields without padding;distinguish nonclaims from actual negations.

Step identifiers and dependencies

Rule: source_ordered_interface_explicit_without_javascript · Uses: G001

S002 · implies

Before

ORIGINAL carrier order=[o15, u15];ORIGINAL open-list order=[[o15, u15], [u15], []];point=o15;ALL given sets containing it have indices=[0]

After

candidate N(o15)=intersection of ALL those sets=[o15, u15];no original open-list reordering

Conditions: none

Intersect every declared neighborhood to form a candidate,without yet assuming a topology.Retain the original open-list order;only set elements use UTF16 sorting.

Step identifiers and dependencies

Rule: compactclosed_ALL_given_neighborhood_intersection_candidates · Uses: G001, S001

S003 · implies

Before

ORIGINAL carrier order=[o15, u15];ORIGINAL open-list order=[[o15, u15], [u15], []];point=u15;ALL given sets containing it have indices=[0, 1]

After

candidate N(u15)=intersection of ALL those sets=[u15];no original open-list reordering

Conditions: none

Intersect every declared neighborhood to form a candidate,without yet assuming a topology.Retain the original open-list order;only set elements use UTF16 sorting.

Step identifiers and dependencies

Rule: compactclosed_ALL_given_neighborhood_intersection_candidates · Uses: G001, S002

S004 · implies

Before

ORIGINAL ordered open masks=[3, 2, 0];ALL neighborhood-containment [x,y,N(y)_subset_N(x)] rows=[[o15, o15, Yes], [o15, u15, Yes], [u15, u15, Yes]]

After

ALL carrier masks0..3 audited;EXACT qualifying U with every x in U having N(x) subset U=[0, 2, 3];given family equals this COMPLETE upset family

Conditions: none

In a finite topology,opens are exactly upsets of its minimal neighborhoods.Conversely,after comparing every carrier subset,upsets are closed under arbitrary unions and finite intersections and contain empty/full sets,so this is a topology with open N(x).This covers all closure obligations,not sampled pairs,without printing millions of pairs.

Step identifiers and dependencies

Rule: compactclosed_ALL_carrier_subsets_exact_neighborhood_upsets_topology · Uses: G001, S003

S005 · implies

Before

Compact-closed ORIGINAL pair index0-1:ORIGINAL distinct x=o15,y=u15;N(y)=[u15];open-list order=[[o15, u15], [u15], []]

After

ALL tested [U_index,U_intersect_N(y),disjoint_V_possible] rows=[[0, [u15], No]];for FIRST possible U,ALL tested [V_index,intersection,disjoint] rows=[];FIRST ORIGINAL witness=null

Conditions: none

If U meets N(y),every open containing y also meets U.If disjoint,N(y) itself is an available open,then search original V order for the first witness.This preserves exactly the original full U/V search result,not an alternate minimal-neighborhood answer.

Step identifiers and dependencies

Rule: compactclosed_FIRST_original_separator_with_complete_neighborhood_screen · Uses: G001, S004

S006 · implies

Before

ORIGINAL points=[o15, u15];ALL original-index distinct-pair witnesses=[[o15, u15, null]];actual K=[u15]

After

Hausdorff=No;K compact=Yes by finiteness:from ANY cover choose one member per K point;empty K needs no members;ambient complement=[o15],closed=No

Conditions: none

Finite K compactness does not replace ambient Hausdorffness.An empty pair domain is vacuous.Closedness tests the complement in this same ambient space,not a relative complement.

Step identifiers and dependencies

Rule: compactclosed_ALL_pairs_Hausdorff_and_finite_subset_compact_separate · Uses: G001, S005

Reverse checks

  • S006 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S005 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S004 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S003 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S002 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S001 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.

Result

([o15, u15], [u15], [o15], No, Yes, No, Sierpinski_type_space_shows_Hausdorff_hypothesis_cannot_be_removed_and_converse_is_not_claimed)

The full substitutions and premise checks give the original answer; source identity,format and status are unchanged.

This question review and source binding

Review date: 2026-10-26

Original questions, answers, step expressions, numeric ASTs and historical records are retained. Source candidate labels remain historical and are not overwritten as formal proof.

Source hashes and review receipts
  • input commit: 0f7be61e2c22317a4075561dc822c87d881a50db
  • original question SHA-256: 80ec198e74b304509898e1d6f34a49e55cf3d6921fd7d80636360e3d855dd687
  • candidate record SHA-256: df92b395174158140536825af97efb434c3304e3afcf57737be7e375caf616d1
  • semantic review receipt SHA-256: a7c0d888ade6d307703c4222c4137c78c0d2448babdcba2fa3446fe6fdd343c1
  • question-first witness SHA-256: c9571f97a37d503ad6a61034cc00108543a05c37ef246d1c4962f55136a3de02
  • Lean: NOT_RUN · human review: NOT_PERFORMED
Same-source full JSON