Explore related knowledge and questions →

Question 19021: A Bijection Must Still Pass Both Continuity Directions

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 96

← Question derivation index · Original question batch

R0037-19021 · q-20261014-advance-20261105-r05-homeomorphism-0046

Original question and givens

Use source and target on Fin(5)={0,…,4}, with complete source_topology=[[], [0], [0, 1], [0, 1, 2], [0, 1, 2, 3], [0, 1, 2, 3, 4], [0, 1, 2, 4], [0, 1, 3], [0, 1, 3, 4], [0, 1, 4], [0, 2], [0, 2, 3], [0, 2, 3, 4], [0, 2, 4], [0, 3], [0, 3, 4], [0, 4], [1], [1, 2], [1, 2, 3], [1, 2, 3, 4], [1, 2, 4], [1, 3], [1, 3, 4], [1, 4], [2], [2, 3], [2, 3, 4], [2, 4], [3], [3, 4], [4]], target_topology=[[], [0, 1, 2, 3, 4]] and total candidate bijection map=[0, 4, 2, 1, 3], in source-index order. Check both complete topology axioms, bijection, every target-open-set preimage and every source-open-set inverse preimage separately. A continuous bijection alone need not have continuous inverse. Give (source_topology_valid, target_topology_valid, bijection, forward_continuous, inverse_continuous, homeomorphism, boundary).

  • G001 — Use source and target on Fin(5)={0,…,4}, with complete source_topology=[[], [0], [0, 1], [0, 1, 2], [0, 1, 2, 3], [0, 1, 2, 3, 4], [0, 1, 2, 4], [0, 1, 3], [0, 1, 3, 4], [0, 1, 4], [0, 2], [0, 2, 3], [0, 2, 3, 4], [0, 2, 4], [0, 3], [0, 3, 4], [0, 4], [1], [1, 2], [1, 2, 3], [1, 2, 3, 4], [1, 2, 4], [1, 3], [1, 3, 4], [1, 4], [2], [2, 3], [2, 3, 4], [2, 4], [3], [3, 4], [4]], target_topology=[[], [0, 1, 2, 3, 4]] and total candidate bijection map=[0, 4, 2, 1, 3], in source-index order. Check both complete topology axioms, bijection, every target-open-set preimage and every source-open-set inverse preimage separately. A continuous bijection alone need not have continuous inverse. Give (source_topology_valid, target_topology_valid, bijection, forward_continuous, inverse_continuous, homeomorphism, 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=homeo-continuous-bijection-boundary;original snapshot and mathematics retained

After

explicit ordered source output fields=[source_topology_valid, target_topology_valid, bijection, forward_continuous, inverse_continuous, homeomorphism, boundary]

Conditions: none

Retain the historical interface marker in the original snapshot while listing ordered source fields here,without JavaScript or external lookup.Field names are not mathematical evidence,and No retains the operation's specific claim scope.

Step identifiers and dependencies

Rule: source_ordered_interface_explicit_without_javascript · Uses: G001

S002 · implies

Before

original complete carrier Fin(5);original TOTAL source-indexed candidate map=[0, 4, 2, 1, 3]

After

all target values distinct and complete;explicit inverse=[0, 3, 2, 4, 1];inverse(map(x))=x and map(inverse(y))=y for EVERY carrier point

Conditions: none

Accept a bijection only when every target appears exactly once in the complete source list.Build the inverse by original indices and retain both inverse identities rather than trusting a family name.

Step identifiers and dependencies

Rule: homeo_complete_bijection_not_name_assumption · Uses: G001, S001

S003 · implies

Before

source topology:complete original supplied topology family=[[], [0], [0, 1], [0, 1, 2], [0, 1, 2, 3], [0, 1, 2, 3, 4], [0, 1, 2, 4], [0, 1, 3], [0, 1, 3, 4], [0, 1, 4], [0, 2], [0, 2, 3], [0, 2, 3, 4], [0, 2, 4], [0, 3], [0, 3, 4], [0, 4], [1], [1, 2], [1, 2, 3], [1, 2, 3, 4], [1, 2, 4], [1, 3], [1, 3, 4], [1, 4], [2], [2, 3], [2, 3, 4], [2, 4], [3], [3, 4], [4]];carrier Fin(5)

After

internally sorted subsets without deduplication=[[], [0], [0, 1], [0, 1, 2], [0, 1, 2, 3], [0, 1, 2, 3, 4], [0, 1, 2, 4], [0, 1, 3], [0, 1, 3, 4], [0, 1, 4], [0, 2], [0, 2, 3], [0, 2, 3, 4], [0, 2, 4], [0, 3], [0, 3, 4], [0, 4], [1], [1, 2], [1, 2, 3], [1, 2, 3, 4], [1, 2, 4], [1, 3], [1, 3, 4], [1, 4], [2], [2, 3], [2, 3, 4], [2, 4], [3], [3, 4], [4]];canonical whole-family key order retained;empty and FULL carrier present

Conditions: none

Normalize indices within each subset as the source does,without deduplication or reordering the original family.The family must already have the required key order and no duplicates.This is the complete topology candidate,not a selected good subfamily.

Step identifiers and dependencies

Rule: homeo_whole_topology_signature_no_missing_opens · Uses: G001, S002

S004 · implies

Before

source topology:left open index=0;left set=[];ALL right open indices in source family order0..31

After

ordered [union_open_index,intersection_open_index] for EVERY right open=[[0, 0], [1, 0], [2, 0], [3, 0], [4, 0], [5, 0], [6, 0], [7, 0], [8, 0], [9, 0], [10, 0], [11, 0], [12, 0], [13, 0], [14, 0], [15, 0], [16, 0], [17, 0], [18, 0], [19, 0], [20, 0], [21, 0], [22, 0], [23, 0], [24, 0], [25, 0], [26, 0], [27, 0], [28, 0], [29, 0], [30, 0], [31, 0]]

Conditions: none

For every right open compute the actual union and intersection and locate each in the same complete table.The indices refer to the opens listed above;the entire row is checked rather than sampled closure.

Step identifiers and dependencies

Rule: homeo_every_binary_open_union_intersection_exact_table · Uses: G001, S003

S005 · implies

Before

source topology:left open index=1;left set=[0];ALL right open indices in source family order0..31

After

ordered [union_open_index,intersection_open_index] for EVERY right open=[[1, 0], [1, 1], [2, 1], [3, 1], [4, 1], [5, 1], [6, 1], [7, 1], [8, 1], [9, 1], [10, 1], [11, 1], [12, 1], [13, 1], [14, 1], [15, 1], [16, 1], [2, 0], [3, 0], [4, 0], [5, 0], [6, 0], [7, 0], [8, 0], [9, 0], [10, 0], [11, 0], [12, 0], [13, 0], [14, 0], [15, 0], [16, 0]]

Conditions: none

For every right open compute the actual union and intersection and locate each in the same complete table.The indices refer to the opens listed above;the entire row is checked rather than sampled closure.

Step identifiers and dependencies

Rule: homeo_every_binary_open_union_intersection_exact_table · Uses: G001, S004

S006 · implies

Before

source topology:left open index=2;left set=[0, 1];ALL right open indices in source family order0..31

After

ordered [union_open_index,intersection_open_index] for EVERY right open=[[2, 0], [2, 1], [2, 2], [3, 2], [4, 2], [5, 2], [6, 2], [7, 2], [8, 2], [9, 2], [3, 1], [4, 1], [5, 1], [6, 1], [7, 1], [8, 1], [9, 1], [2, 17], [3, 17], [4, 17], [5, 17], [6, 17], [7, 17], [8, 17], [9, 17], [3, 0], [4, 0], [5, 0], [6, 0], [7, 0], [8, 0], [9, 0]]

Conditions: none

For every right open compute the actual union and intersection and locate each in the same complete table.The indices refer to the opens listed above;the entire row is checked rather than sampled closure.

Step identifiers and dependencies

Rule: homeo_every_binary_open_union_intersection_exact_table · Uses: G001, S005

S007 · implies

Before

source topology:left open index=3;left set=[0, 1, 2];ALL right open indices in source family order0..31

After

ordered [union_open_index,intersection_open_index] for EVERY right open=[[3, 0], [3, 1], [3, 2], [3, 3], [4, 3], [5, 3], [6, 3], [4, 2], [5, 2], [6, 2], [3, 10], [4, 10], [5, 10], [6, 10], [4, 1], [5, 1], [6, 1], [3, 17], [3, 18], [4, 18], [5, 18], [6, 18], [4, 17], [5, 17], [6, 17], [3, 25], [4, 25], [5, 25], [6, 25], [4, 0], [5, 0], [6, 0]]

Conditions: none

For every right open compute the actual union and intersection and locate each in the same complete table.The indices refer to the opens listed above;the entire row is checked rather than sampled closure.

Step identifiers and dependencies

Rule: homeo_every_binary_open_union_intersection_exact_table · Uses: G001, S006

S008 · implies

Before

source topology:left open index=4;left set=[0, 1, 2, 3];ALL right open indices in source family order0..31

After

ordered [union_open_index,intersection_open_index] for EVERY right open=[[4, 0], [4, 1], [4, 2], [4, 3], [4, 4], [5, 4], [5, 3], [4, 7], [5, 7], [5, 2], [4, 10], [4, 11], [5, 11], [5, 10], [4, 14], [5, 14], [5, 1], [4, 17], [4, 18], [4, 19], [5, 19], [5, 18], [4, 22], [5, 22], [5, 17], [4, 25], [4, 26], [5, 26], [5, 25], [4, 29], [5, 29], [5, 0]]

Conditions: none

For every right open compute the actual union and intersection and locate each in the same complete table.The indices refer to the opens listed above;the entire row is checked rather than sampled closure.

Step identifiers and dependencies

Rule: homeo_every_binary_open_union_intersection_exact_table · Uses: G001, S007

S009 · implies

Before

source topology:left open index=5;left set=[0, 1, 2, 3, 4];ALL right open indices in source family order0..31

After

ordered [union_open_index,intersection_open_index] for EVERY right open=[[5, 0], [5, 1], [5, 2], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [5, 15], [5, 16], [5, 17], [5, 18], [5, 19], [5, 20], [5, 21], [5, 22], [5, 23], [5, 24], [5, 25], [5, 26], [5, 27], [5, 28], [5, 29], [5, 30], [5, 31]]

Conditions: none

For every right open compute the actual union and intersection and locate each in the same complete table.The indices refer to the opens listed above;the entire row is checked rather than sampled closure.

Step identifiers and dependencies

Rule: homeo_every_binary_open_union_intersection_exact_table · Uses: G001, S008

S010 · implies

Before

source topology:left open index=6;left set=[0, 1, 2, 4];ALL right open indices in source family order0..31

After

ordered [union_open_index,intersection_open_index] for EVERY right open=[[6, 0], [6, 1], [6, 2], [6, 3], [5, 3], [5, 6], [6, 6], [5, 2], [5, 9], [6, 9], [6, 10], [5, 10], [5, 13], [6, 13], [5, 1], [5, 16], [6, 16], [6, 17], [6, 18], [5, 18], [5, 21], [6, 21], [5, 17], [5, 24], [6, 24], [6, 25], [5, 25], [5, 28], [6, 28], [5, 0], [5, 31], [6, 31]]

Conditions: none

For every right open compute the actual union and intersection and locate each in the same complete table.The indices refer to the opens listed above;the entire row is checked rather than sampled closure.

Step identifiers and dependencies

Rule: homeo_every_binary_open_union_intersection_exact_table · Uses: G001, S009

S011 · implies

Before

source topology:left open index=7;left set=[0, 1, 3];ALL right open indices in source family order0..31

After

ordered [union_open_index,intersection_open_index] for EVERY right open=[[7, 0], [7, 1], [7, 2], [4, 2], [4, 7], [5, 7], [5, 2], [7, 7], [8, 7], [8, 2], [4, 1], [4, 14], [5, 14], [5, 1], [7, 14], [8, 14], [8, 1], [7, 17], [4, 17], [4, 22], [5, 22], [5, 17], [7, 22], [8, 22], [8, 17], [4, 0], [4, 29], [5, 29], [5, 0], [7, 29], [8, 29], [8, 0]]

Conditions: none

For every right open compute the actual union and intersection and locate each in the same complete table.The indices refer to the opens listed above;the entire row is checked rather than sampled closure.

Step identifiers and dependencies

Rule: homeo_every_binary_open_union_intersection_exact_table · Uses: G001, S010

S012 · implies

Before

source topology:left open index=8;left set=[0, 1, 3, 4];ALL right open indices in source family order0..31

After

ordered [union_open_index,intersection_open_index] for EVERY right open=[[8, 0], [8, 1], [8, 2], [5, 2], [5, 7], [5, 8], [5, 9], [8, 7], [8, 8], [8, 9], [5, 1], [5, 14], [5, 15], [5, 16], [8, 14], [8, 15], [8, 16], [8, 17], [5, 17], [5, 22], [5, 23], [5, 24], [8, 22], [8, 23], [8, 24], [5, 0], [5, 29], [5, 30], [5, 31], [8, 29], [8, 30], [8, 31]]

Conditions: none

For every right open compute the actual union and intersection and locate each in the same complete table.The indices refer to the opens listed above;the entire row is checked rather than sampled closure.

Step identifiers and dependencies

Rule: homeo_every_binary_open_union_intersection_exact_table · Uses: G001, S011

S013 · implies

Before

source topology:left open index=9;left set=[0, 1, 4];ALL right open indices in source family order0..31

After

ordered [union_open_index,intersection_open_index] for EVERY right open=[[9, 0], [9, 1], [9, 2], [6, 2], [5, 2], [5, 9], [6, 9], [8, 2], [8, 9], [9, 9], [6, 1], [5, 1], [5, 16], [6, 16], [8, 1], [8, 16], [9, 16], [9, 17], [6, 17], [5, 17], [5, 24], [6, 24], [8, 17], [8, 24], [9, 24], [6, 0], [5, 0], [5, 31], [6, 31], [8, 0], [8, 31], [9, 31]]

Conditions: none

For every right open compute the actual union and intersection and locate each in the same complete table.The indices refer to the opens listed above;the entire row is checked rather than sampled closure.

Step identifiers and dependencies

Rule: homeo_every_binary_open_union_intersection_exact_table · Uses: G001, S012

S014 · implies

Before

source topology:left open index=10;left set=[0, 2];ALL right open indices in source family order0..31

After

ordered [union_open_index,intersection_open_index] for EVERY right open=[[10, 0], [10, 1], [3, 1], [3, 10], [4, 10], [5, 10], [6, 10], [4, 1], [5, 1], [6, 1], [10, 10], [11, 10], [12, 10], [13, 10], [11, 1], [12, 1], [13, 1], [3, 0], [3, 25], [4, 25], [5, 25], [6, 25], [4, 0], [5, 0], [6, 0], [10, 25], [11, 25], [12, 25], [13, 25], [11, 0], [12, 0], [13, 0]]

Conditions: none

For every right open compute the actual union and intersection and locate each in the same complete table.The indices refer to the opens listed above;the entire row is checked rather than sampled closure.

Step identifiers and dependencies

Rule: homeo_every_binary_open_union_intersection_exact_table · Uses: G001, S013

S015 · implies

Before

source topology:left open index=11;left set=[0, 2, 3];ALL right open indices in source family order0..31

After

ordered [union_open_index,intersection_open_index] for EVERY right open=[[11, 0], [11, 1], [4, 1], [4, 10], [4, 11], [5, 11], [5, 10], [4, 14], [5, 14], [5, 1], [11, 10], [11, 11], [12, 11], [12, 10], [11, 14], [12, 14], [12, 1], [4, 0], [4, 25], [4, 26], [5, 26], [5, 25], [4, 29], [5, 29], [5, 0], [11, 25], [11, 26], [12, 26], [12, 25], [11, 29], [12, 29], [12, 0]]

Conditions: none

For every right open compute the actual union and intersection and locate each in the same complete table.The indices refer to the opens listed above;the entire row is checked rather than sampled closure.

Step identifiers and dependencies

Rule: homeo_every_binary_open_union_intersection_exact_table · Uses: G001, S014

S016 · implies

Before

source topology:left open index=12;left set=[0, 2, 3, 4];ALL right open indices in source family order0..31

After

ordered [union_open_index,intersection_open_index] for EVERY right open=[[12, 0], [12, 1], [5, 1], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [5, 15], [5, 16], [12, 10], [12, 11], [12, 12], [12, 13], [12, 14], [12, 15], [12, 16], [5, 0], [5, 25], [5, 26], [5, 27], [5, 28], [5, 29], [5, 30], [5, 31], [12, 25], [12, 26], [12, 27], [12, 28], [12, 29], [12, 30], [12, 31]]

Conditions: none

For every right open compute the actual union and intersection and locate each in the same complete table.The indices refer to the opens listed above;the entire row is checked rather than sampled closure.

Step identifiers and dependencies

Rule: homeo_every_binary_open_union_intersection_exact_table · Uses: G001, S015

S017 · implies

Before

source topology:left open index=13;left set=[0, 2, 4];ALL right open indices in source family order0..31

After

ordered [union_open_index,intersection_open_index] for EVERY right open=[[13, 0], [13, 1], [6, 1], [6, 10], [5, 10], [5, 13], [6, 13], [5, 1], [5, 16], [6, 16], [13, 10], [12, 10], [12, 13], [13, 13], [12, 1], [12, 16], [13, 16], [6, 0], [6, 25], [5, 25], [5, 28], [6, 28], [5, 0], [5, 31], [6, 31], [13, 25], [12, 25], [12, 28], [13, 28], [12, 0], [12, 31], [13, 31]]

Conditions: none

For every right open compute the actual union and intersection and locate each in the same complete table.The indices refer to the opens listed above;the entire row is checked rather than sampled closure.

Step identifiers and dependencies

Rule: homeo_every_binary_open_union_intersection_exact_table · Uses: G001, S016

S018 · implies

Before

source topology:left open index=14;left set=[0, 3];ALL right open indices in source family order0..31

After

ordered [union_open_index,intersection_open_index] for EVERY right open=[[14, 0], [14, 1], [7, 1], [4, 1], [4, 14], [5, 14], [5, 1], [7, 14], [8, 14], [8, 1], [11, 1], [11, 14], [12, 14], [12, 1], [14, 14], [15, 14], [15, 1], [7, 0], [4, 0], [4, 29], [5, 29], [5, 0], [7, 29], [8, 29], [8, 0], [11, 0], [11, 29], [12, 29], [12, 0], [14, 29], [15, 29], [15, 0]]

Conditions: none

For every right open compute the actual union and intersection and locate each in the same complete table.The indices refer to the opens listed above;the entire row is checked rather than sampled closure.

Step identifiers and dependencies

Rule: homeo_every_binary_open_union_intersection_exact_table · Uses: G001, S017

S019 · implies

Before

source topology:left open index=15;left set=[0, 3, 4];ALL right open indices in source family order0..31

After

ordered [union_open_index,intersection_open_index] for EVERY right open=[[15, 0], [15, 1], [8, 1], [5, 1], [5, 14], [5, 15], [5, 16], [8, 14], [8, 15], [8, 16], [12, 1], [12, 14], [12, 15], [12, 16], [15, 14], [15, 15], [15, 16], [8, 0], [5, 0], [5, 29], [5, 30], [5, 31], [8, 29], [8, 30], [8, 31], [12, 0], [12, 29], [12, 30], [12, 31], [15, 29], [15, 30], [15, 31]]

Conditions: none

For every right open compute the actual union and intersection and locate each in the same complete table.The indices refer to the opens listed above;the entire row is checked rather than sampled closure.

Step identifiers and dependencies

Rule: homeo_every_binary_open_union_intersection_exact_table · Uses: G001, S018

S020 · implies

Before

source topology:left open index=16;left set=[0, 4];ALL right open indices in source family order0..31

After

ordered [union_open_index,intersection_open_index] for EVERY right open=[[16, 0], [16, 1], [9, 1], [6, 1], [5, 1], [5, 16], [6, 16], [8, 1], [8, 16], [9, 16], [13, 1], [12, 1], [12, 16], [13, 16], [15, 1], [15, 16], [16, 16], [9, 0], [6, 0], [5, 0], [5, 31], [6, 31], [8, 0], [8, 31], [9, 31], [13, 0], [12, 0], [12, 31], [13, 31], [15, 0], [15, 31], [16, 31]]

Conditions: none

For every right open compute the actual union and intersection and locate each in the same complete table.The indices refer to the opens listed above;the entire row is checked rather than sampled closure.

Step identifiers and dependencies

Rule: homeo_every_binary_open_union_intersection_exact_table · Uses: G001, S019

S021 · implies

Before

source topology:left open index=17;left set=[1];ALL right open indices in source family order0..31

After

ordered [union_open_index,intersection_open_index] for EVERY right open=[[17, 0], [2, 0], [2, 17], [3, 17], [4, 17], [5, 17], [6, 17], [7, 17], [8, 17], [9, 17], [3, 0], [4, 0], [5, 0], [6, 0], [7, 0], [8, 0], [9, 0], [17, 17], [18, 17], [19, 17], [20, 17], [21, 17], [22, 17], [23, 17], [24, 17], [18, 0], [19, 0], [20, 0], [21, 0], [22, 0], [23, 0], [24, 0]]

Conditions: none

For every right open compute the actual union and intersection and locate each in the same complete table.The indices refer to the opens listed above;the entire row is checked rather than sampled closure.

Step identifiers and dependencies

Rule: homeo_every_binary_open_union_intersection_exact_table · Uses: G001, S020

S022 · implies

Before

source topology:left open index=18;left set=[1, 2];ALL right open indices in source family order0..31

After

ordered [union_open_index,intersection_open_index] for EVERY right open=[[18, 0], [3, 0], [3, 17], [3, 18], [4, 18], [5, 18], [6, 18], [4, 17], [5, 17], [6, 17], [3, 25], [4, 25], [5, 25], [6, 25], [4, 0], [5, 0], [6, 0], [18, 17], [18, 18], [19, 18], [20, 18], [21, 18], [19, 17], [20, 17], [21, 17], [18, 25], [19, 25], [20, 25], [21, 25], [19, 0], [20, 0], [21, 0]]

Conditions: none

For every right open compute the actual union and intersection and locate each in the same complete table.The indices refer to the opens listed above;the entire row is checked rather than sampled closure.

Step identifiers and dependencies

Rule: homeo_every_binary_open_union_intersection_exact_table · Uses: G001, S021

S023 · implies

Before

source topology:left open index=19;left set=[1, 2, 3];ALL right open indices in source family order0..31

After

ordered [union_open_index,intersection_open_index] for EVERY right open=[[19, 0], [4, 0], [4, 17], [4, 18], [4, 19], [5, 19], [5, 18], [4, 22], [5, 22], [5, 17], [4, 25], [4, 26], [5, 26], [5, 25], [4, 29], [5, 29], [5, 0], [19, 17], [19, 18], [19, 19], [20, 19], [20, 18], [19, 22], [20, 22], [20, 17], [19, 25], [19, 26], [20, 26], [20, 25], [19, 29], [20, 29], [20, 0]]

Conditions: none

For every right open compute the actual union and intersection and locate each in the same complete table.The indices refer to the opens listed above;the entire row is checked rather than sampled closure.

Step identifiers and dependencies

Rule: homeo_every_binary_open_union_intersection_exact_table · Uses: G001, S022

S024 · implies

Before

source topology:left open index=20;left set=[1, 2, 3, 4];ALL right open indices in source family order0..31

After

ordered [union_open_index,intersection_open_index] for EVERY right open=[[20, 0], [5, 0], [5, 17], [5, 18], [5, 19], [5, 20], [5, 21], [5, 22], [5, 23], [5, 24], [5, 25], [5, 26], [5, 27], [5, 28], [5, 29], [5, 30], [5, 31], [20, 17], [20, 18], [20, 19], [20, 20], [20, 21], [20, 22], [20, 23], [20, 24], [20, 25], [20, 26], [20, 27], [20, 28], [20, 29], [20, 30], [20, 31]]

Conditions: none

For every right open compute the actual union and intersection and locate each in the same complete table.The indices refer to the opens listed above;the entire row is checked rather than sampled closure.

Step identifiers and dependencies

Rule: homeo_every_binary_open_union_intersection_exact_table · Uses: G001, S023

S025 · implies

Before

source topology:left open index=21;left set=[1, 2, 4];ALL right open indices in source family order0..31

After

ordered [union_open_index,intersection_open_index] for EVERY right open=[[21, 0], [6, 0], [6, 17], [6, 18], [5, 18], [5, 21], [6, 21], [5, 17], [5, 24], [6, 24], [6, 25], [5, 25], [5, 28], [6, 28], [5, 0], [5, 31], [6, 31], [21, 17], [21, 18], [20, 18], [20, 21], [21, 21], [20, 17], [20, 24], [21, 24], [21, 25], [20, 25], [20, 28], [21, 28], [20, 0], [20, 31], [21, 31]]

Conditions: none

For every right open compute the actual union and intersection and locate each in the same complete table.The indices refer to the opens listed above;the entire row is checked rather than sampled closure.

Step identifiers and dependencies

Rule: homeo_every_binary_open_union_intersection_exact_table · Uses: G001, S024

S026 · implies

Before

source topology:left open index=22;left set=[1, 3];ALL right open indices in source family order0..31

After

ordered [union_open_index,intersection_open_index] for EVERY right open=[[22, 0], [7, 0], [7, 17], [4, 17], [4, 22], [5, 22], [5, 17], [7, 22], [8, 22], [8, 17], [4, 0], [4, 29], [5, 29], [5, 0], [7, 29], [8, 29], [8, 0], [22, 17], [19, 17], [19, 22], [20, 22], [20, 17], [22, 22], [23, 22], [23, 17], [19, 0], [19, 29], [20, 29], [20, 0], [22, 29], [23, 29], [23, 0]]

Conditions: none

For every right open compute the actual union and intersection and locate each in the same complete table.The indices refer to the opens listed above;the entire row is checked rather than sampled closure.

Step identifiers and dependencies

Rule: homeo_every_binary_open_union_intersection_exact_table · Uses: G001, S025

S027 · implies

Before

source topology:left open index=23;left set=[1, 3, 4];ALL right open indices in source family order0..31

After

ordered [union_open_index,intersection_open_index] for EVERY right open=[[23, 0], [8, 0], [8, 17], [5, 17], [5, 22], [5, 23], [5, 24], [8, 22], [8, 23], [8, 24], [5, 0], [5, 29], [5, 30], [5, 31], [8, 29], [8, 30], [8, 31], [23, 17], [20, 17], [20, 22], [20, 23], [20, 24], [23, 22], [23, 23], [23, 24], [20, 0], [20, 29], [20, 30], [20, 31], [23, 29], [23, 30], [23, 31]]

Conditions: none

For every right open compute the actual union and intersection and locate each in the same complete table.The indices refer to the opens listed above;the entire row is checked rather than sampled closure.

Step identifiers and dependencies

Rule: homeo_every_binary_open_union_intersection_exact_table · Uses: G001, S026

S028 · implies

Before

source topology:left open index=24;left set=[1, 4];ALL right open indices in source family order0..31

After

ordered [union_open_index,intersection_open_index] for EVERY right open=[[24, 0], [9, 0], [9, 17], [6, 17], [5, 17], [5, 24], [6, 24], [8, 17], [8, 24], [9, 24], [6, 0], [5, 0], [5, 31], [6, 31], [8, 0], [8, 31], [9, 31], [24, 17], [21, 17], [20, 17], [20, 24], [21, 24], [23, 17], [23, 24], [24, 24], [21, 0], [20, 0], [20, 31], [21, 31], [23, 0], [23, 31], [24, 31]]

Conditions: none

For every right open compute the actual union and intersection and locate each in the same complete table.The indices refer to the opens listed above;the entire row is checked rather than sampled closure.

Step identifiers and dependencies

Rule: homeo_every_binary_open_union_intersection_exact_table · Uses: G001, S027

S029 · implies

Before

source topology:left open index=25;left set=[2];ALL right open indices in source family order0..31

After

ordered [union_open_index,intersection_open_index] for EVERY right open=[[25, 0], [10, 0], [3, 0], [3, 25], [4, 25], [5, 25], [6, 25], [4, 0], [5, 0], [6, 0], [10, 25], [11, 25], [12, 25], [13, 25], [11, 0], [12, 0], [13, 0], [18, 0], [18, 25], [19, 25], [20, 25], [21, 25], [19, 0], [20, 0], [21, 0], [25, 25], [26, 25], [27, 25], [28, 25], [26, 0], [27, 0], [28, 0]]

Conditions: none

For every right open compute the actual union and intersection and locate each in the same complete table.The indices refer to the opens listed above;the entire row is checked rather than sampled closure.

Step identifiers and dependencies

Rule: homeo_every_binary_open_union_intersection_exact_table · Uses: G001, S028

S030 · implies

Before

source topology:left open index=26;left set=[2, 3];ALL right open indices in source family order0..31

After

ordered [union_open_index,intersection_open_index] for EVERY right open=[[26, 0], [11, 0], [4, 0], [4, 25], [4, 26], [5, 26], [5, 25], [4, 29], [5, 29], [5, 0], [11, 25], [11, 26], [12, 26], [12, 25], [11, 29], [12, 29], [12, 0], [19, 0], [19, 25], [19, 26], [20, 26], [20, 25], [19, 29], [20, 29], [20, 0], [26, 25], [26, 26], [27, 26], [27, 25], [26, 29], [27, 29], [27, 0]]

Conditions: none

For every right open compute the actual union and intersection and locate each in the same complete table.The indices refer to the opens listed above;the entire row is checked rather than sampled closure.

Step identifiers and dependencies

Rule: homeo_every_binary_open_union_intersection_exact_table · Uses: G001, S029

S031 · implies

Before

source topology:left open index=27;left set=[2, 3, 4];ALL right open indices in source family order0..31

After

ordered [union_open_index,intersection_open_index] for EVERY right open=[[27, 0], [12, 0], [5, 0], [5, 25], [5, 26], [5, 27], [5, 28], [5, 29], [5, 30], [5, 31], [12, 25], [12, 26], [12, 27], [12, 28], [12, 29], [12, 30], [12, 31], [20, 0], [20, 25], [20, 26], [20, 27], [20, 28], [20, 29], [20, 30], [20, 31], [27, 25], [27, 26], [27, 27], [27, 28], [27, 29], [27, 30], [27, 31]]

Conditions: none

For every right open compute the actual union and intersection and locate each in the same complete table.The indices refer to the opens listed above;the entire row is checked rather than sampled closure.

Step identifiers and dependencies

Rule: homeo_every_binary_open_union_intersection_exact_table · Uses: G001, S030

S032 · implies

Before

source topology:left open index=28;left set=[2, 4];ALL right open indices in source family order0..31

After

ordered [union_open_index,intersection_open_index] for EVERY right open=[[28, 0], [13, 0], [6, 0], [6, 25], [5, 25], [5, 28], [6, 28], [5, 0], [5, 31], [6, 31], [13, 25], [12, 25], [12, 28], [13, 28], [12, 0], [12, 31], [13, 31], [21, 0], [21, 25], [20, 25], [20, 28], [21, 28], [20, 0], [20, 31], [21, 31], [28, 25], [27, 25], [27, 28], [28, 28], [27, 0], [27, 31], [28, 31]]

Conditions: none

For every right open compute the actual union and intersection and locate each in the same complete table.The indices refer to the opens listed above;the entire row is checked rather than sampled closure.

Step identifiers and dependencies

Rule: homeo_every_binary_open_union_intersection_exact_table · Uses: G001, S031

S033 · implies

Before

source topology:left open index=29;left set=[3];ALL right open indices in source family order0..31

After

ordered [union_open_index,intersection_open_index] for EVERY right open=[[29, 0], [14, 0], [7, 0], [4, 0], [4, 29], [5, 29], [5, 0], [7, 29], [8, 29], [8, 0], [11, 0], [11, 29], [12, 29], [12, 0], [14, 29], [15, 29], [15, 0], [22, 0], [19, 0], [19, 29], [20, 29], [20, 0], [22, 29], [23, 29], [23, 0], [26, 0], [26, 29], [27, 29], [27, 0], [29, 29], [30, 29], [30, 0]]

Conditions: none

For every right open compute the actual union and intersection and locate each in the same complete table.The indices refer to the opens listed above;the entire row is checked rather than sampled closure.

Step identifiers and dependencies

Rule: homeo_every_binary_open_union_intersection_exact_table · Uses: G001, S032

S034 · implies

Before

source topology:left open index=30;left set=[3, 4];ALL right open indices in source family order0..31

After

ordered [union_open_index,intersection_open_index] for EVERY right open=[[30, 0], [15, 0], [8, 0], [5, 0], [5, 29], [5, 30], [5, 31], [8, 29], [8, 30], [8, 31], [12, 0], [12, 29], [12, 30], [12, 31], [15, 29], [15, 30], [15, 31], [23, 0], [20, 0], [20, 29], [20, 30], [20, 31], [23, 29], [23, 30], [23, 31], [27, 0], [27, 29], [27, 30], [27, 31], [30, 29], [30, 30], [30, 31]]

Conditions: none

For every right open compute the actual union and intersection and locate each in the same complete table.The indices refer to the opens listed above;the entire row is checked rather than sampled closure.

Step identifiers and dependencies

Rule: homeo_every_binary_open_union_intersection_exact_table · Uses: G001, S033

S035 · implies

Before

source topology:left open index=31;left set=[4];ALL right open indices in source family order0..31

After

ordered [union_open_index,intersection_open_index] for EVERY right open=[[31, 0], [16, 0], [9, 0], [6, 0], [5, 0], [5, 31], [6, 31], [8, 0], [8, 31], [9, 31], [13, 0], [12, 0], [12, 31], [13, 31], [15, 0], [15, 31], [16, 31], [24, 0], [21, 0], [20, 0], [20, 31], [21, 31], [23, 0], [23, 31], [24, 31], [28, 0], [27, 0], [27, 31], [28, 31], [30, 0], [30, 31], [31, 31]]

Conditions: none

For every right open compute the actual union and intersection and locate each in the same complete table.The indices refer to the opens listed above;the entire row is checked rather than sampled closure.

Step identifiers and dependencies

Rule: homeo_every_binary_open_union_intersection_exact_table · Uses: G001, S034

S036 · implies

Before

source topology:empty/full carrier and EVERY binary union/intersection checked in COMPLETE finite family of32 opens

After

ANY arbitrary indexed union has only finitely many DISTINCT opens here,so equals a finite repeated binary union;empty union is empty;finite intersections include empty intersection=full carrier;all topology axioms hold

Conditions: none

An indexed family may repeat members or have infinitely many indices,but this finite table has only finitely many distinct opens.Removing repetitions preserves its union,so binary closure inductively gives arbitrary-union closure.Finite intersections follow similarly,including the empty cases.

Step identifiers and dependencies

Rule: homeo_finite_binary_closure_full_topology_quantifiers · Uses: G001, S035

S037 · implies

Before

target topology:complete original supplied topology family=[[], [0, 1, 2, 3, 4]];carrier Fin(5)

After

internally sorted subsets without deduplication=[[], [0, 1, 2, 3, 4]];canonical whole-family key order retained;empty and FULL carrier present

Conditions: none

Normalize indices within each subset as the source does,without deduplication or reordering the original family.The family must already have the required key order and no duplicates.This is the complete topology candidate,not a selected good subfamily.

Step identifiers and dependencies

Rule: homeo_whole_topology_signature_no_missing_opens · Uses: G001, S036

S038 · implies

Before

target topology:left open index=0;left set=[];ALL right open indices in source family order0..1

After

ordered [union_open_index,intersection_open_index] for EVERY right open=[[0, 0], [1, 0]]

Conditions: none

For every right open compute the actual union and intersection and locate each in the same complete table.The indices refer to the opens listed above;the entire row is checked rather than sampled closure.

Step identifiers and dependencies

Rule: homeo_every_binary_open_union_intersection_exact_table · Uses: G001, S037

S039 · implies

Before

target topology:left open index=1;left set=[0, 1, 2, 3, 4];ALL right open indices in source family order0..1

After

ordered [union_open_index,intersection_open_index] for EVERY right open=[[1, 0], [1, 1]]

Conditions: none

For every right open compute the actual union and intersection and locate each in the same complete table.The indices refer to the opens listed above;the entire row is checked rather than sampled closure.

Step identifiers and dependencies

Rule: homeo_every_binary_open_union_intersection_exact_table · Uses: G001, S038

S040 · implies

Before

target topology:empty/full carrier and EVERY binary union/intersection checked in COMPLETE finite family of2 opens

After

ANY arbitrary indexed union has only finitely many DISTINCT opens here,so equals a finite repeated binary union;empty union is empty;finite intersections include empty intersection=full carrier;all topology axioms hold

Conditions: none

An indexed family may repeat members or have infinitely many indices,but this finite table has only finitely many distinct opens.Removing repetitions preserves its union,so binary closure inductively gives arbitrary-union closure.Finite intersections follow similarly,including the empty cases.

Step identifiers and dependencies

Rule: homeo_finite_binary_closure_full_topology_quantifiers · Uses: G001, S039

S041 · implies

Before

forward map:ACTUAL total map=[0, 4, 2, 1, 3];target open index=0;complete target open=[]

After

exact full-carrier preimage=[];matching source-open index=0;preimage open=Yes

Conditions: none

Continuity requires the preimage of every target open to be source-open,not an image test or one passing open.None means this preimage is absent from the complete source table,not that computation was skipped.

Step identifiers and dependencies

Rule: homeo_every_target_open_preimage_not_image_or_samples · Uses: G001, S040

S042 · implies

Before

forward map:ACTUAL total map=[0, 4, 2, 1, 3];target open index=1;complete target open=[0, 1, 2, 3, 4]

After

exact full-carrier preimage=[0, 1, 2, 3, 4];matching source-open index=5;preimage open=Yes

Conditions: none

Continuity requires the preimage of every target open to be source-open,not an image test or one passing open.None means this preimage is absent from the complete source table,not that computation was skipped.

Step identifiers and dependencies

Rule: homeo_every_target_open_preimage_not_image_or_samples · Uses: G001, S041

S043 · implies

Before

forward map:ALL target-open preimage flags=[Yes, Yes]

After

continuous=Yes by the COMPLETE open-preimage definition

Conditions: none

Conjoin every row for continuity in this direction.A failed row is an actual counterexample and is not repaired by bijectivity or continuity in the opposite direction.

Step identifiers and dependencies

Rule: homeo_full_continuity_each_direction_separate · Uses: G001, S042

S044 · implies

Before

inverse map:ACTUAL total map=[0, 3, 2, 4, 1];target open index=0;complete target open=[]

After

exact full-carrier preimage=[];matching source-open index=0;preimage open=Yes

Conditions: none

Continuity requires the preimage of every target open to be source-open,not an image test or one passing open.None means this preimage is absent from the complete source table,not that computation was skipped.

Step identifiers and dependencies

Rule: homeo_every_target_open_preimage_not_image_or_samples · Uses: G001, S043

S045 · implies

Before

inverse map:ACTUAL total map=[0, 3, 2, 4, 1];target open index=1;complete target open=[0]

After

exact full-carrier preimage=[0];matching source-open index=null;preimage open=No

Conditions: none

Continuity requires the preimage of every target open to be source-open,not an image test or one passing open.None means this preimage is absent from the complete source table,not that computation was skipped.

Step identifiers and dependencies

Rule: homeo_every_target_open_preimage_not_image_or_samples · Uses: G001, S044

S046 · implies

Before

inverse map:ACTUAL total map=[0, 3, 2, 4, 1];target open index=2;complete target open=[0, 1]

After

exact full-carrier preimage=[0, 4];matching source-open index=null;preimage open=No

Conditions: none

Continuity requires the preimage of every target open to be source-open,not an image test or one passing open.None means this preimage is absent from the complete source table,not that computation was skipped.

Step identifiers and dependencies

Rule: homeo_every_target_open_preimage_not_image_or_samples · Uses: G001, S045

S047 · implies

Before

inverse map:ACTUAL total map=[0, 3, 2, 4, 1];target open index=3;complete target open=[0, 1, 2]

After

exact full-carrier preimage=[0, 2, 4];matching source-open index=null;preimage open=No

Conditions: none

Continuity requires the preimage of every target open to be source-open,not an image test or one passing open.None means this preimage is absent from the complete source table,not that computation was skipped.

Step identifiers and dependencies

Rule: homeo_every_target_open_preimage_not_image_or_samples · Uses: G001, S046

S048 · implies

Before

inverse map:ACTUAL total map=[0, 3, 2, 4, 1];target open index=4;complete target open=[0, 1, 2, 3]

After

exact full-carrier preimage=[0, 1, 2, 4];matching source-open index=null;preimage open=No

Conditions: none

Continuity requires the preimage of every target open to be source-open,not an image test or one passing open.None means this preimage is absent from the complete source table,not that computation was skipped.

Step identifiers and dependencies

Rule: homeo_every_target_open_preimage_not_image_or_samples · Uses: G001, S047

S049 · implies

Before

inverse map:ACTUAL total map=[0, 3, 2, 4, 1];target open index=5;complete target open=[0, 1, 2, 3, 4]

After

exact full-carrier preimage=[0, 1, 2, 3, 4];matching source-open index=1;preimage open=Yes

Conditions: none

Continuity requires the preimage of every target open to be source-open,not an image test or one passing open.None means this preimage is absent from the complete source table,not that computation was skipped.

Step identifiers and dependencies

Rule: homeo_every_target_open_preimage_not_image_or_samples · Uses: G001, S048

S050 · implies

Before

inverse map:ACTUAL total map=[0, 3, 2, 4, 1];target open index=6;complete target open=[0, 1, 2, 4]

After

exact full-carrier preimage=[0, 2, 3, 4];matching source-open index=null;preimage open=No

Conditions: none

Continuity requires the preimage of every target open to be source-open,not an image test or one passing open.None means this preimage is absent from the complete source table,not that computation was skipped.

Step identifiers and dependencies

Rule: homeo_every_target_open_preimage_not_image_or_samples · Uses: G001, S049

S051 · implies

Before

inverse map:ACTUAL total map=[0, 3, 2, 4, 1];target open index=7;complete target open=[0, 1, 3]

After

exact full-carrier preimage=[0, 1, 4];matching source-open index=null;preimage open=No

Conditions: none

Continuity requires the preimage of every target open to be source-open,not an image test or one passing open.None means this preimage is absent from the complete source table,not that computation was skipped.

Step identifiers and dependencies

Rule: homeo_every_target_open_preimage_not_image_or_samples · Uses: G001, S050

S052 · implies

Before

inverse map:ACTUAL total map=[0, 3, 2, 4, 1];target open index=8;complete target open=[0, 1, 3, 4]

After

exact full-carrier preimage=[0, 1, 3, 4];matching source-open index=null;preimage open=No

Conditions: none

Continuity requires the preimage of every target open to be source-open,not an image test or one passing open.None means this preimage is absent from the complete source table,not that computation was skipped.

Step identifiers and dependencies

Rule: homeo_every_target_open_preimage_not_image_or_samples · Uses: G001, S051

S053 · implies

Before

inverse map:ACTUAL total map=[0, 3, 2, 4, 1];target open index=9;complete target open=[0, 1, 4]

After

exact full-carrier preimage=[0, 3, 4];matching source-open index=null;preimage open=No

Conditions: none

Continuity requires the preimage of every target open to be source-open,not an image test or one passing open.None means this preimage is absent from the complete source table,not that computation was skipped.

Step identifiers and dependencies

Rule: homeo_every_target_open_preimage_not_image_or_samples · Uses: G001, S052

S054 · implies

Before

inverse map:ACTUAL total map=[0, 3, 2, 4, 1];target open index=10;complete target open=[0, 2]

After

exact full-carrier preimage=[0, 2];matching source-open index=null;preimage open=No

Conditions: none

Continuity requires the preimage of every target open to be source-open,not an image test or one passing open.None means this preimage is absent from the complete source table,not that computation was skipped.

Step identifiers and dependencies

Rule: homeo_every_target_open_preimage_not_image_or_samples · Uses: G001, S053

S055 · implies

Before

inverse map:ACTUAL total map=[0, 3, 2, 4, 1];target open index=11;complete target open=[0, 2, 3]

After

exact full-carrier preimage=[0, 1, 2];matching source-open index=null;preimage open=No

Conditions: none

Continuity requires the preimage of every target open to be source-open,not an image test or one passing open.None means this preimage is absent from the complete source table,not that computation was skipped.

Step identifiers and dependencies

Rule: homeo_every_target_open_preimage_not_image_or_samples · Uses: G001, S054

S056 · implies

Before

inverse map:ACTUAL total map=[0, 3, 2, 4, 1];target open index=12;complete target open=[0, 2, 3, 4]

After

exact full-carrier preimage=[0, 1, 2, 3];matching source-open index=null;preimage open=No

Conditions: none

Continuity requires the preimage of every target open to be source-open,not an image test or one passing open.None means this preimage is absent from the complete source table,not that computation was skipped.

Step identifiers and dependencies

Rule: homeo_every_target_open_preimage_not_image_or_samples · Uses: G001, S055

S057 · implies

Before

inverse map:ACTUAL total map=[0, 3, 2, 4, 1];target open index=13;complete target open=[0, 2, 4]

After

exact full-carrier preimage=[0, 2, 3];matching source-open index=null;preimage open=No

Conditions: none

Continuity requires the preimage of every target open to be source-open,not an image test or one passing open.None means this preimage is absent from the complete source table,not that computation was skipped.

Step identifiers and dependencies

Rule: homeo_every_target_open_preimage_not_image_or_samples · Uses: G001, S056

S058 · implies

Before

inverse map:ACTUAL total map=[0, 3, 2, 4, 1];target open index=14;complete target open=[0, 3]

After

exact full-carrier preimage=[0, 1];matching source-open index=null;preimage open=No

Conditions: none

Continuity requires the preimage of every target open to be source-open,not an image test or one passing open.None means this preimage is absent from the complete source table,not that computation was skipped.

Step identifiers and dependencies

Rule: homeo_every_target_open_preimage_not_image_or_samples · Uses: G001, S057

S059 · implies

Before

inverse map:ACTUAL total map=[0, 3, 2, 4, 1];target open index=15;complete target open=[0, 3, 4]

After

exact full-carrier preimage=[0, 1, 3];matching source-open index=null;preimage open=No

Conditions: none

Continuity requires the preimage of every target open to be source-open,not an image test or one passing open.None means this preimage is absent from the complete source table,not that computation was skipped.

Step identifiers and dependencies

Rule: homeo_every_target_open_preimage_not_image_or_samples · Uses: G001, S058

S060 · implies

Before

inverse map:ACTUAL total map=[0, 3, 2, 4, 1];target open index=16;complete target open=[0, 4]

After

exact full-carrier preimage=[0, 3];matching source-open index=null;preimage open=No

Conditions: none

Continuity requires the preimage of every target open to be source-open,not an image test or one passing open.None means this preimage is absent from the complete source table,not that computation was skipped.

Step identifiers and dependencies

Rule: homeo_every_target_open_preimage_not_image_or_samples · Uses: G001, S059

S061 · implies

Before

inverse map:ACTUAL total map=[0, 3, 2, 4, 1];target open index=17;complete target open=[1]

After

exact full-carrier preimage=[4];matching source-open index=null;preimage open=No

Conditions: none

Continuity requires the preimage of every target open to be source-open,not an image test or one passing open.None means this preimage is absent from the complete source table,not that computation was skipped.

Step identifiers and dependencies

Rule: homeo_every_target_open_preimage_not_image_or_samples · Uses: G001, S060

S062 · implies

Before

inverse map:ACTUAL total map=[0, 3, 2, 4, 1];target open index=18;complete target open=[1, 2]

After

exact full-carrier preimage=[2, 4];matching source-open index=null;preimage open=No

Conditions: none

Continuity requires the preimage of every target open to be source-open,not an image test or one passing open.None means this preimage is absent from the complete source table,not that computation was skipped.

Step identifiers and dependencies

Rule: homeo_every_target_open_preimage_not_image_or_samples · Uses: G001, S061

S063 · implies

Before

inverse map:ACTUAL total map=[0, 3, 2, 4, 1];target open index=19;complete target open=[1, 2, 3]

After

exact full-carrier preimage=[1, 2, 4];matching source-open index=null;preimage open=No

Conditions: none

Continuity requires the preimage of every target open to be source-open,not an image test or one passing open.None means this preimage is absent from the complete source table,not that computation was skipped.

Step identifiers and dependencies

Rule: homeo_every_target_open_preimage_not_image_or_samples · Uses: G001, S062

S064 · implies

Before

inverse map:ACTUAL total map=[0, 3, 2, 4, 1];target open index=20;complete target open=[1, 2, 3, 4]

After

exact full-carrier preimage=[1, 2, 3, 4];matching source-open index=null;preimage open=No

Conditions: none

Continuity requires the preimage of every target open to be source-open,not an image test or one passing open.None means this preimage is absent from the complete source table,not that computation was skipped.

Step identifiers and dependencies

Rule: homeo_every_target_open_preimage_not_image_or_samples · Uses: G001, S063

S065 · implies

Before

inverse map:ACTUAL total map=[0, 3, 2, 4, 1];target open index=21;complete target open=[1, 2, 4]

After

exact full-carrier preimage=[2, 3, 4];matching source-open index=null;preimage open=No

Conditions: none

Continuity requires the preimage of every target open to be source-open,not an image test or one passing open.None means this preimage is absent from the complete source table,not that computation was skipped.

Step identifiers and dependencies

Rule: homeo_every_target_open_preimage_not_image_or_samples · Uses: G001, S064

S066 · implies

Before

inverse map:ACTUAL total map=[0, 3, 2, 4, 1];target open index=22;complete target open=[1, 3]

After

exact full-carrier preimage=[1, 4];matching source-open index=null;preimage open=No

Conditions: none

Continuity requires the preimage of every target open to be source-open,not an image test or one passing open.None means this preimage is absent from the complete source table,not that computation was skipped.

Step identifiers and dependencies

Rule: homeo_every_target_open_preimage_not_image_or_samples · Uses: G001, S065

S067 · implies

Before

inverse map:ACTUAL total map=[0, 3, 2, 4, 1];target open index=23;complete target open=[1, 3, 4]

After

exact full-carrier preimage=[1, 3, 4];matching source-open index=null;preimage open=No

Conditions: none

Continuity requires the preimage of every target open to be source-open,not an image test or one passing open.None means this preimage is absent from the complete source table,not that computation was skipped.

Step identifiers and dependencies

Rule: homeo_every_target_open_preimage_not_image_or_samples · Uses: G001, S066

S068 · implies

Before

inverse map:ACTUAL total map=[0, 3, 2, 4, 1];target open index=24;complete target open=[1, 4]

After

exact full-carrier preimage=[3, 4];matching source-open index=null;preimage open=No

Conditions: none

Continuity requires the preimage of every target open to be source-open,not an image test or one passing open.None means this preimage is absent from the complete source table,not that computation was skipped.

Step identifiers and dependencies

Rule: homeo_every_target_open_preimage_not_image_or_samples · Uses: G001, S067

S069 · implies

Before

inverse map:ACTUAL total map=[0, 3, 2, 4, 1];target open index=25;complete target open=[2]

After

exact full-carrier preimage=[2];matching source-open index=null;preimage open=No

Conditions: none

Continuity requires the preimage of every target open to be source-open,not an image test or one passing open.None means this preimage is absent from the complete source table,not that computation was skipped.

Step identifiers and dependencies

Rule: homeo_every_target_open_preimage_not_image_or_samples · Uses: G001, S068

S070 · implies

Before

inverse map:ACTUAL total map=[0, 3, 2, 4, 1];target open index=26;complete target open=[2, 3]

After

exact full-carrier preimage=[1, 2];matching source-open index=null;preimage open=No

Conditions: none

Continuity requires the preimage of every target open to be source-open,not an image test or one passing open.None means this preimage is absent from the complete source table,not that computation was skipped.

Step identifiers and dependencies

Rule: homeo_every_target_open_preimage_not_image_or_samples · Uses: G001, S069

S071 · implies

Before

inverse map:ACTUAL total map=[0, 3, 2, 4, 1];target open index=27;complete target open=[2, 3, 4]

After

exact full-carrier preimage=[1, 2, 3];matching source-open index=null;preimage open=No

Conditions: none

Continuity requires the preimage of every target open to be source-open,not an image test or one passing open.None means this preimage is absent from the complete source table,not that computation was skipped.

Step identifiers and dependencies

Rule: homeo_every_target_open_preimage_not_image_or_samples · Uses: G001, S070

S072 · implies

Before

inverse map:ACTUAL total map=[0, 3, 2, 4, 1];target open index=28;complete target open=[2, 4]

After

exact full-carrier preimage=[2, 3];matching source-open index=null;preimage open=No

Conditions: none

Continuity requires the preimage of every target open to be source-open,not an image test or one passing open.None means this preimage is absent from the complete source table,not that computation was skipped.

Step identifiers and dependencies

Rule: homeo_every_target_open_preimage_not_image_or_samples · Uses: G001, S071

S073 · implies

Before

inverse map:ACTUAL total map=[0, 3, 2, 4, 1];target open index=29;complete target open=[3]

After

exact full-carrier preimage=[1];matching source-open index=null;preimage open=No

Conditions: none

Continuity requires the preimage of every target open to be source-open,not an image test or one passing open.None means this preimage is absent from the complete source table,not that computation was skipped.

Step identifiers and dependencies

Rule: homeo_every_target_open_preimage_not_image_or_samples · Uses: G001, S072

S074 · implies

Before

inverse map:ACTUAL total map=[0, 3, 2, 4, 1];target open index=30;complete target open=[3, 4]

After

exact full-carrier preimage=[1, 3];matching source-open index=null;preimage open=No

Conditions: none

Continuity requires the preimage of every target open to be source-open,not an image test or one passing open.None means this preimage is absent from the complete source table,not that computation was skipped.

Step identifiers and dependencies

Rule: homeo_every_target_open_preimage_not_image_or_samples · Uses: G001, S073

S075 · implies

Before

inverse map:ACTUAL total map=[0, 3, 2, 4, 1];target open index=31;complete target open=[4]

After

exact full-carrier preimage=[3];matching source-open index=null;preimage open=No

Conditions: none

Continuity requires the preimage of every target open to be source-open,not an image test or one passing open.None means this preimage is absent from the complete source table,not that computation was skipped.

Step identifiers and dependencies

Rule: homeo_every_target_open_preimage_not_image_or_samples · Uses: G001, S074

S076 · implies

Before

inverse map:ALL target-open preimage flags=[Yes, No, No, No, No, Yes, No, No, No, No, No, No, No, No, No, No, No, No, No, No, No, No, No, No, No, No, No, No, No, No, No, No]

After

continuous=No by the COMPLETE open-preimage definition

Conditions: none

Conjoin every row for continuity in this direction.A failed row is an actual counterexample and is not repaired by bijectivity or continuity in the opposite direction.

Step identifiers and dependencies

Rule: homeo_full_continuity_each_direction_separate · Uses: G001, S075

S077 · implies

Before

complete valid source/target topologies;actual bijection=[0, 4, 2, 1, 3];forward continuity=Yes;inverse continuity=No

After

homeomorphism=No is the CONJUNCTION;family name does not assume either continuity direction

Conditions: none

Valid topologies,bijectivity and the two continuity directions are separate obligations.A continuous bijection still requires inverse continuity.A boundary instance may fail forward continuity or pass both directions;use the actual complete data rather than the family name.

Step identifiers and dependencies

Rule: homeo_bijection_plus_both_continuities_not_family_assumption · Uses: G001, S076

Reverse checks

  • S077 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S076 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S075 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S074 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S073 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S072 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S071 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S070 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S069 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S068 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S067 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S066 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S065 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S064 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S063 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S062 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S061 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S060 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S059 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S058 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S057 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S056 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S055 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S054 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S053 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S052 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S051 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S050 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S049 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S048 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S047 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S046 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S045 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S044 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S043 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S042 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S041 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S040 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S039 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S038 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S037 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S036 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S035 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S034 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S033 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S032 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S031 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S030 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S029 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S028 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S027 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S026 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S025 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S024 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S023 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S022 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S021 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S020 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S019 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S018 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S017 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S016 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S015 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S014 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S013 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S012 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S011 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S010 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S009 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S008 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S007 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • 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

(Yes, Yes, Yes, Yes, No, No, continuous_bijection_inverse_continuity_required)

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: 1def3399db21b529fd531d4db8e067d1830bc681ce0fa9f7efe9dbe40619fcbc
  • candidate record SHA-256: 5f0be7a386d2bf5d56fc739b3db7fdc35a4caeeebbe4d3768094c6c3fd1c07cc
  • semantic review receipt SHA-256: 065507b602ceee60cf47a700d387a51940e0c6724c35a3336a7a7948a199ed80
  • question-first witness SHA-256: 7203f33b030792559673b0fee520a8c0e70903c4dd970b35293aa40852f333d6
  • Lean: NOT_RUN · human review: NOT_PERFORMED
Same-source full JSON