OCMEBilingual mathematics & derivations繁體中文

Explore related knowledge and questions →

Question 22927: One Exhaustively Failed Distinct Pair Proves Non-Hausdorffness

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 115

← Question derivation index · Original question batch

R0044-22927 · q-20261014-advance-20261111-r03-hausdorff-space-0052

Original question and givens

Use finite unique labeled points=[a1, b1, c1] and the complete canonical topology=[[a1, b1, c1], [a1, b1], [a1], []]. Every neighborhood witness must be a declared open set containing its assigned point; the two points must be distinct and the witnesses disjoint. The complete topology must qualify before a Hausdorff audit. Test x=a1, y=b1. Give (x, y, witness_or_null, separated, boundary).

  • G001 — Use finite unique labeled points=[a1, b1, c1] and the complete canonical topology=[[a1, b1, c1], [a1, b1], [a1], []]. Every neighborhood witness must be a declared open set containing its assigned point; the two points must be distinct and the witnesses disjoint. The complete topology must qualify before a Hausdorff audit. Test x=a1, y=b1. Give (x, y, witness_or_null, separated, 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=hausdorff-inseparable-pair;original snapshot and mathematics retained

After

explicit ordered source output fields=[x, y, witness_or_null, separated, boundary]

Conditions: none

Keep the historical interface marker and list ordered source fields without JavaScript.Tags are not additional evidence;fixed No markers retain their scope.The ordering helper supplies protocol order,not mathematical correctness.

Step identifiers and dependencies

Rule: source_ordered_interface_explicit_without_javascript · Uses: G001

S002 · implies

Before

ORIGINAL carrier order=[a1, b1, c1];source canonical open family=[[a1, b1, c1], [a1, b1], [a1], []];actual open index=0,U=[a1, b1, c1]

After

ALL [other_index,union,intersection] rows=[[0, [a1, b1, c1], [a1, b1, c1]], [1, [a1, b1, c1], [a1, b1]], [2, [a1, b1, c1], [a1]], [3, [a1, b1, c1], []]];empty/full present;family qualification passed with exact source English collation

Conditions: none

Retain labels and original carrier order.Sort elements and the family by the exact declared source conventions,not size or an alternate familiar convention.Check all open pairs;the empty carrier has topology[[]].

Step identifiers and dependencies

Rule: hausdorff_complete_labeled_topology_and_source_order · Uses: G001, S001

S003 · implies

Before

ORIGINAL carrier order=[a1, b1, c1];source canonical open family=[[a1, b1, c1], [a1, b1], [a1], []];actual open index=1,U=[a1, b1]

After

ALL [other_index,union,intersection] rows=[[0, [a1, b1, c1], [a1, b1]], [1, [a1, b1], [a1, b1]], [2, [a1, b1], [a1]], [3, [a1, b1], []]];empty/full present;family qualification passed with exact source English collation

Conditions: none

Retain labels and original carrier order.Sort elements and the family by the exact declared source conventions,not size or an alternate familiar convention.Check all open pairs;the empty carrier has topology[[]].

Step identifiers and dependencies

Rule: hausdorff_complete_labeled_topology_and_source_order · Uses: G001, S002

S004 · implies

Before

ORIGINAL carrier order=[a1, b1, c1];source canonical open family=[[a1, b1, c1], [a1, b1], [a1], []];actual open index=2,U=[a1]

After

ALL [other_index,union,intersection] rows=[[0, [a1, b1, c1], [a1]], [1, [a1, b1], [a1]], [2, [a1], [a1]], [3, [a1], []]];empty/full present;family qualification passed with exact source English collation

Conditions: none

Retain labels and original carrier order.Sort elements and the family by the exact declared source conventions,not size or an alternate familiar convention.Check all open pairs;the empty carrier has topology[[]].

Step identifiers and dependencies

Rule: hausdorff_complete_labeled_topology_and_source_order · Uses: G001, S003

S005 · implies

Before

ORIGINAL carrier order=[a1, b1, c1];source canonical open family=[[a1, b1, c1], [a1, b1], [a1], []];actual open index=3,U=[]

After

ALL [other_index,union,intersection] rows=[[0, [a1, b1, c1], []], [1, [a1, b1], []], [2, [a1], []], [3, [], []]];empty/full present;family qualification passed with exact source English collation

Conditions: none

Retain labels and original carrier order.Sort elements and the family by the exact declared source conventions,not size or an alternate familiar convention.Check all open pairs;the empty carrier has topology[[]].

Step identifiers and dependencies

Rule: hausdorff_complete_labeled_topology_and_source_order · Uses: G001, S004

S006 · implies

Before

Hausdorff ORIGINAL designated pair:ORIGINAL distinct carrier points x=a1,y=b1;source open order=[[a1, b1, c1], [a1, b1], [a1], []]

After

ALL tested [U_index,V_index,intersection,disjoint] rows=[[0, 0, [a1, b1, c1], No], [0, 1, [a1, b1], No], [1, 0, [a1, b1], No], [1, 1, [a1, b1], No], [2, 0, [a1], No], [2, 1, [a1], No]];FIRST source-order witness=null

Conditions: none

Use actual opens U containing x and V containing y.Search original U then V order for the first disjoint pair.Null means no witness in this complete finite domain,not a failed sample.

Step identifiers and dependencies

Rule: hausdorff_FIRST_actual_open_pair_or_EXHAUSTIVE_failure · 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

(a1, b1, null, No, one_failed_distinct_pair_proves_non_Hausdorff)

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: bcf44ae12349f12dedab45c8fb54cfa1cd50e569c4010c8116bdeb822e18be0d
  • candidate record SHA-256: adda06dbaefa1e7058eccd7b4a75f1adfc33b4308cd16f90010374ab87280b7e
  • semantic review receipt SHA-256: 89b8e810eced1a69dbfef28d4b112e829edf156c7905a86e39a3f4958cd75e81
  • question-first witness SHA-256: b2e8b769c463242f05172564ae96e310403eae151e1ec30bcb50be3ffe12cfc7
  • Lean: NOT_RUN · human review: NOT_PERFORMED
Same-source full JSON