OCMEBilingual mathematics & derivations繁體中文

Explore related knowledge and questions →

Question 20670: Generate All Unions Only after the Basis Axioms Pass

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 104

← Question derivation index · Original question batch

R0040-20670 · q-20261014-advance-20261107-r03-topological-basis-0045

Original question and givens

Use finite carrier Fin(5)={0,…,4} and the complete canonical candidate family basis=[[0], [0, 1], [0, 2], [1], [2], [3], [3, 4], [4]]. Its union must cover the carrier; for every point in each pairwise intersection a candidate element containing that point must lie inside the intersection. Complete finite data, not sampled intersections, supply this audit. Give (topology, open_count, topology_certificate, certificate).

  • G001 — Use finite carrier Fin(5)={0,…,4} and the complete canonical candidate family basis=[[0], [0, 1], [0, 2], [1], [2], [3], [3, 4], [4]]. Its union must cover the carrier; for every point in each pairwise intersection a candidate element containing that point must lie inside the intersection. Complete finite data, not sampled intersections, supply this audit. Give (topology, open_count, topology_certificate, certificate).

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=topbasis-generated-topology;original snapshot and mathematics retained

After

explicit ordered source output fields=[topology, open_count, topology_certificate, certificate]

Conditions: none

Keep the historical interface marker in the original snapshot while listing source fields here without JavaScript or external lookup.Labels are not mathematical evidence,and No retains its source claim scope.

Step identifiers and dependencies

Rule: source_ordered_interface_explicit_without_javascript · Uses: G001

S002 · implies

Before

original basis candidate:ORIGINAL complete candidate family=[[0], [0, 1], [0, 2], [1], [2], [3], [3, 4], [4]];carrier Fin(5)

After

within-set numeric normalization=[[0], [0, 1], [0, 2], [1], [2], [3], [3, 4], [4]];no duplicate points or duplicate FAMILY elements;WHOLE original family already in required key order;empty family allowed as candidate

Conditions: none

A topological basis is a family of subsets,not a vector-space basis;its size may exceed n.Normalize point order within each set without changing original family indices or deleting duplicates to repair data.An empty candidate family can still be audited.

Step identifiers and dependencies

Rule: topbasis_canonical_candidate_family_not_semantic_reordering · Uses: G001, S001

S003 · implies

Before

COMPLETE original candidate basis=[[0], [0, 1], [0, 2], [1], [2], [3], [3, 4], [4]];ALL carrier points0..4

After

ALL [point,containing_basis_indices] rows=[[0, [0, 1, 2]], [1, [1, 3]], [2, [2, 4]], [3, [5, 6]], [4, [6, 7]]];covers WHOLE carrier=Yes

Conditions: none

Every carrier point needs a containing candidate element for coverage.This does not replace local intersection refinement.With n≥1 an empty family fails coverage rather than being discarded as an unauditable candidate.

Step identifiers and dependencies

Rule: topbasis_every_point_cover_separate_from_refinement · Uses: G001, S002

S004 · implies

Before

ORIGINAL ordered basis positions(left,right)=[0, 0];actual basis elements=[[0], [0]];FULL intersection=[0]

After

ALL [intersection_point,ALL refining original basis indices] rows=[[0, [0]]];empty intersection gives VACUOUS local obligation;first failure retained in source order

Conditions: none

For each intersection point x require some candidate basis element containing x and contained in the intersection.The entire intersection need not itself be a basis element.Check all refiners before declaring absence,and keep the first left/right/point failure in source order.

Step identifiers and dependencies

Rule: topbasis_full_local_point_refinement_not_intersection_membership · Uses: G001, S003

S005 · implies

Before

ORIGINAL ordered basis positions(left,right)=[0, 1];actual basis elements=[[0], [0, 1]];FULL intersection=[0]

After

ALL [intersection_point,ALL refining original basis indices] rows=[[0, [0]]];empty intersection gives VACUOUS local obligation;first failure retained in source order

Conditions: none

For each intersection point x require some candidate basis element containing x and contained in the intersection.The entire intersection need not itself be a basis element.Check all refiners before declaring absence,and keep the first left/right/point failure in source order.

Step identifiers and dependencies

Rule: topbasis_full_local_point_refinement_not_intersection_membership · Uses: G001, S004

S006 · implies

Before

ORIGINAL ordered basis positions(left,right)=[0, 2];actual basis elements=[[0], [0, 2]];FULL intersection=[0]

After

ALL [intersection_point,ALL refining original basis indices] rows=[[0, [0]]];empty intersection gives VACUOUS local obligation;first failure retained in source order

Conditions: none

For each intersection point x require some candidate basis element containing x and contained in the intersection.The entire intersection need not itself be a basis element.Check all refiners before declaring absence,and keep the first left/right/point failure in source order.

Step identifiers and dependencies

Rule: topbasis_full_local_point_refinement_not_intersection_membership · Uses: G001, S005

S007 · implies

Before

ORIGINAL ordered basis positions(left,right)=[0, 3];actual basis elements=[[0], [1]];FULL intersection=[]

After

ALL [intersection_point,ALL refining original basis indices] rows=[];empty intersection gives VACUOUS local obligation;first failure retained in source order

Conditions: none

For each intersection point x require some candidate basis element containing x and contained in the intersection.The entire intersection need not itself be a basis element.Check all refiners before declaring absence,and keep the first left/right/point failure in source order.

Step identifiers and dependencies

Rule: topbasis_full_local_point_refinement_not_intersection_membership · Uses: G001, S006

S008 · implies

Before

ORIGINAL ordered basis positions(left,right)=[0, 4];actual basis elements=[[0], [2]];FULL intersection=[]

After

ALL [intersection_point,ALL refining original basis indices] rows=[];empty intersection gives VACUOUS local obligation;first failure retained in source order

Conditions: none

For each intersection point x require some candidate basis element containing x and contained in the intersection.The entire intersection need not itself be a basis element.Check all refiners before declaring absence,and keep the first left/right/point failure in source order.

Step identifiers and dependencies

Rule: topbasis_full_local_point_refinement_not_intersection_membership · Uses: G001, S007

S009 · implies

Before

ORIGINAL ordered basis positions(left,right)=[0, 5];actual basis elements=[[0], [3]];FULL intersection=[]

After

ALL [intersection_point,ALL refining original basis indices] rows=[];empty intersection gives VACUOUS local obligation;first failure retained in source order

Conditions: none

For each intersection point x require some candidate basis element containing x and contained in the intersection.The entire intersection need not itself be a basis element.Check all refiners before declaring absence,and keep the first left/right/point failure in source order.

Step identifiers and dependencies

Rule: topbasis_full_local_point_refinement_not_intersection_membership · Uses: G001, S008

S010 · implies

Before

ORIGINAL ordered basis positions(left,right)=[0, 6];actual basis elements=[[0], [3, 4]];FULL intersection=[]

After

ALL [intersection_point,ALL refining original basis indices] rows=[];empty intersection gives VACUOUS local obligation;first failure retained in source order

Conditions: none

For each intersection point x require some candidate basis element containing x and contained in the intersection.The entire intersection need not itself be a basis element.Check all refiners before declaring absence,and keep the first left/right/point failure in source order.

Step identifiers and dependencies

Rule: topbasis_full_local_point_refinement_not_intersection_membership · Uses: G001, S009

S011 · implies

Before

ORIGINAL ordered basis positions(left,right)=[0, 7];actual basis elements=[[0], [4]];FULL intersection=[]

After

ALL [intersection_point,ALL refining original basis indices] rows=[];empty intersection gives VACUOUS local obligation;first failure retained in source order

Conditions: none

For each intersection point x require some candidate basis element containing x and contained in the intersection.The entire intersection need not itself be a basis element.Check all refiners before declaring absence,and keep the first left/right/point failure in source order.

Step identifiers and dependencies

Rule: topbasis_full_local_point_refinement_not_intersection_membership · Uses: G001, S010

S012 · implies

Before

ORIGINAL ordered basis positions(left,right)=[1, 0];actual basis elements=[[0, 1], [0]];FULL intersection=[0]

After

ALL [intersection_point,ALL refining original basis indices] rows=[[0, [0]]];empty intersection gives VACUOUS local obligation;first failure retained in source order

Conditions: none

For each intersection point x require some candidate basis element containing x and contained in the intersection.The entire intersection need not itself be a basis element.Check all refiners before declaring absence,and keep the first left/right/point failure in source order.

Step identifiers and dependencies

Rule: topbasis_full_local_point_refinement_not_intersection_membership · Uses: G001, S011

S013 · implies

Before

ORIGINAL ordered basis positions(left,right)=[1, 1];actual basis elements=[[0, 1], [0, 1]];FULL intersection=[0, 1]

After

ALL [intersection_point,ALL refining original basis indices] rows=[[0, [0, 1]], [1, [1, 3]]];empty intersection gives VACUOUS local obligation;first failure retained in source order

Conditions: none

For each intersection point x require some candidate basis element containing x and contained in the intersection.The entire intersection need not itself be a basis element.Check all refiners before declaring absence,and keep the first left/right/point failure in source order.

Step identifiers and dependencies

Rule: topbasis_full_local_point_refinement_not_intersection_membership · Uses: G001, S012

S014 · implies

Before

ORIGINAL ordered basis positions(left,right)=[1, 2];actual basis elements=[[0, 1], [0, 2]];FULL intersection=[0]

After

ALL [intersection_point,ALL refining original basis indices] rows=[[0, [0]]];empty intersection gives VACUOUS local obligation;first failure retained in source order

Conditions: none

For each intersection point x require some candidate basis element containing x and contained in the intersection.The entire intersection need not itself be a basis element.Check all refiners before declaring absence,and keep the first left/right/point failure in source order.

Step identifiers and dependencies

Rule: topbasis_full_local_point_refinement_not_intersection_membership · Uses: G001, S013

S015 · implies

Before

ORIGINAL ordered basis positions(left,right)=[1, 3];actual basis elements=[[0, 1], [1]];FULL intersection=[1]

After

ALL [intersection_point,ALL refining original basis indices] rows=[[1, [3]]];empty intersection gives VACUOUS local obligation;first failure retained in source order

Conditions: none

For each intersection point x require some candidate basis element containing x and contained in the intersection.The entire intersection need not itself be a basis element.Check all refiners before declaring absence,and keep the first left/right/point failure in source order.

Step identifiers and dependencies

Rule: topbasis_full_local_point_refinement_not_intersection_membership · Uses: G001, S014

S016 · implies

Before

ORIGINAL ordered basis positions(left,right)=[1, 4];actual basis elements=[[0, 1], [2]];FULL intersection=[]

After

ALL [intersection_point,ALL refining original basis indices] rows=[];empty intersection gives VACUOUS local obligation;first failure retained in source order

Conditions: none

For each intersection point x require some candidate basis element containing x and contained in the intersection.The entire intersection need not itself be a basis element.Check all refiners before declaring absence,and keep the first left/right/point failure in source order.

Step identifiers and dependencies

Rule: topbasis_full_local_point_refinement_not_intersection_membership · Uses: G001, S015

S017 · implies

Before

ORIGINAL ordered basis positions(left,right)=[1, 5];actual basis elements=[[0, 1], [3]];FULL intersection=[]

After

ALL [intersection_point,ALL refining original basis indices] rows=[];empty intersection gives VACUOUS local obligation;first failure retained in source order

Conditions: none

For each intersection point x require some candidate basis element containing x and contained in the intersection.The entire intersection need not itself be a basis element.Check all refiners before declaring absence,and keep the first left/right/point failure in source order.

Step identifiers and dependencies

Rule: topbasis_full_local_point_refinement_not_intersection_membership · Uses: G001, S016

S018 · implies

Before

ORIGINAL ordered basis positions(left,right)=[1, 6];actual basis elements=[[0, 1], [3, 4]];FULL intersection=[]

After

ALL [intersection_point,ALL refining original basis indices] rows=[];empty intersection gives VACUOUS local obligation;first failure retained in source order

Conditions: none

For each intersection point x require some candidate basis element containing x and contained in the intersection.The entire intersection need not itself be a basis element.Check all refiners before declaring absence,and keep the first left/right/point failure in source order.

Step identifiers and dependencies

Rule: topbasis_full_local_point_refinement_not_intersection_membership · Uses: G001, S017

S019 · implies

Before

ORIGINAL ordered basis positions(left,right)=[1, 7];actual basis elements=[[0, 1], [4]];FULL intersection=[]

After

ALL [intersection_point,ALL refining original basis indices] rows=[];empty intersection gives VACUOUS local obligation;first failure retained in source order

Conditions: none

For each intersection point x require some candidate basis element containing x and contained in the intersection.The entire intersection need not itself be a basis element.Check all refiners before declaring absence,and keep the first left/right/point failure in source order.

Step identifiers and dependencies

Rule: topbasis_full_local_point_refinement_not_intersection_membership · Uses: G001, S018

S020 · implies

Before

ORIGINAL ordered basis positions(left,right)=[2, 0];actual basis elements=[[0, 2], [0]];FULL intersection=[0]

After

ALL [intersection_point,ALL refining original basis indices] rows=[[0, [0]]];empty intersection gives VACUOUS local obligation;first failure retained in source order

Conditions: none

For each intersection point x require some candidate basis element containing x and contained in the intersection.The entire intersection need not itself be a basis element.Check all refiners before declaring absence,and keep the first left/right/point failure in source order.

Step identifiers and dependencies

Rule: topbasis_full_local_point_refinement_not_intersection_membership · Uses: G001, S019

S021 · implies

Before

ORIGINAL ordered basis positions(left,right)=[2, 1];actual basis elements=[[0, 2], [0, 1]];FULL intersection=[0]

After

ALL [intersection_point,ALL refining original basis indices] rows=[[0, [0]]];empty intersection gives VACUOUS local obligation;first failure retained in source order

Conditions: none

For each intersection point x require some candidate basis element containing x and contained in the intersection.The entire intersection need not itself be a basis element.Check all refiners before declaring absence,and keep the first left/right/point failure in source order.

Step identifiers and dependencies

Rule: topbasis_full_local_point_refinement_not_intersection_membership · Uses: G001, S020

S022 · implies

Before

ORIGINAL ordered basis positions(left,right)=[2, 2];actual basis elements=[[0, 2], [0, 2]];FULL intersection=[0, 2]

After

ALL [intersection_point,ALL refining original basis indices] rows=[[0, [0, 2]], [2, [2, 4]]];empty intersection gives VACUOUS local obligation;first failure retained in source order

Conditions: none

For each intersection point x require some candidate basis element containing x and contained in the intersection.The entire intersection need not itself be a basis element.Check all refiners before declaring absence,and keep the first left/right/point failure in source order.

Step identifiers and dependencies

Rule: topbasis_full_local_point_refinement_not_intersection_membership · Uses: G001, S021

S023 · implies

Before

ORIGINAL ordered basis positions(left,right)=[2, 3];actual basis elements=[[0, 2], [1]];FULL intersection=[]

After

ALL [intersection_point,ALL refining original basis indices] rows=[];empty intersection gives VACUOUS local obligation;first failure retained in source order

Conditions: none

For each intersection point x require some candidate basis element containing x and contained in the intersection.The entire intersection need not itself be a basis element.Check all refiners before declaring absence,and keep the first left/right/point failure in source order.

Step identifiers and dependencies

Rule: topbasis_full_local_point_refinement_not_intersection_membership · Uses: G001, S022

S024 · implies

Before

ORIGINAL ordered basis positions(left,right)=[2, 4];actual basis elements=[[0, 2], [2]];FULL intersection=[2]

After

ALL [intersection_point,ALL refining original basis indices] rows=[[2, [4]]];empty intersection gives VACUOUS local obligation;first failure retained in source order

Conditions: none

For each intersection point x require some candidate basis element containing x and contained in the intersection.The entire intersection need not itself be a basis element.Check all refiners before declaring absence,and keep the first left/right/point failure in source order.

Step identifiers and dependencies

Rule: topbasis_full_local_point_refinement_not_intersection_membership · Uses: G001, S023

S025 · implies

Before

ORIGINAL ordered basis positions(left,right)=[2, 5];actual basis elements=[[0, 2], [3]];FULL intersection=[]

After

ALL [intersection_point,ALL refining original basis indices] rows=[];empty intersection gives VACUOUS local obligation;first failure retained in source order

Conditions: none

For each intersection point x require some candidate basis element containing x and contained in the intersection.The entire intersection need not itself be a basis element.Check all refiners before declaring absence,and keep the first left/right/point failure in source order.

Step identifiers and dependencies

Rule: topbasis_full_local_point_refinement_not_intersection_membership · Uses: G001, S024

S026 · implies

Before

ORIGINAL ordered basis positions(left,right)=[2, 6];actual basis elements=[[0, 2], [3, 4]];FULL intersection=[]

After

ALL [intersection_point,ALL refining original basis indices] rows=[];empty intersection gives VACUOUS local obligation;first failure retained in source order

Conditions: none

For each intersection point x require some candidate basis element containing x and contained in the intersection.The entire intersection need not itself be a basis element.Check all refiners before declaring absence,and keep the first left/right/point failure in source order.

Step identifiers and dependencies

Rule: topbasis_full_local_point_refinement_not_intersection_membership · Uses: G001, S025

S027 · implies

Before

ORIGINAL ordered basis positions(left,right)=[2, 7];actual basis elements=[[0, 2], [4]];FULL intersection=[]

After

ALL [intersection_point,ALL refining original basis indices] rows=[];empty intersection gives VACUOUS local obligation;first failure retained in source order

Conditions: none

For each intersection point x require some candidate basis element containing x and contained in the intersection.The entire intersection need not itself be a basis element.Check all refiners before declaring absence,and keep the first left/right/point failure in source order.

Step identifiers and dependencies

Rule: topbasis_full_local_point_refinement_not_intersection_membership · Uses: G001, S026

S028 · implies

Before

ORIGINAL ordered basis positions(left,right)=[3, 0];actual basis elements=[[1], [0]];FULL intersection=[]

After

ALL [intersection_point,ALL refining original basis indices] rows=[];empty intersection gives VACUOUS local obligation;first failure retained in source order

Conditions: none

For each intersection point x require some candidate basis element containing x and contained in the intersection.The entire intersection need not itself be a basis element.Check all refiners before declaring absence,and keep the first left/right/point failure in source order.

Step identifiers and dependencies

Rule: topbasis_full_local_point_refinement_not_intersection_membership · Uses: G001, S027

S029 · implies

Before

ORIGINAL ordered basis positions(left,right)=[3, 1];actual basis elements=[[1], [0, 1]];FULL intersection=[1]

After

ALL [intersection_point,ALL refining original basis indices] rows=[[1, [3]]];empty intersection gives VACUOUS local obligation;first failure retained in source order

Conditions: none

For each intersection point x require some candidate basis element containing x and contained in the intersection.The entire intersection need not itself be a basis element.Check all refiners before declaring absence,and keep the first left/right/point failure in source order.

Step identifiers and dependencies

Rule: topbasis_full_local_point_refinement_not_intersection_membership · Uses: G001, S028

S030 · implies

Before

ORIGINAL ordered basis positions(left,right)=[3, 2];actual basis elements=[[1], [0, 2]];FULL intersection=[]

After

ALL [intersection_point,ALL refining original basis indices] rows=[];empty intersection gives VACUOUS local obligation;first failure retained in source order

Conditions: none

For each intersection point x require some candidate basis element containing x and contained in the intersection.The entire intersection need not itself be a basis element.Check all refiners before declaring absence,and keep the first left/right/point failure in source order.

Step identifiers and dependencies

Rule: topbasis_full_local_point_refinement_not_intersection_membership · Uses: G001, S029

S031 · implies

Before

ORIGINAL ordered basis positions(left,right)=[3, 3];actual basis elements=[[1], [1]];FULL intersection=[1]

After

ALL [intersection_point,ALL refining original basis indices] rows=[[1, [3]]];empty intersection gives VACUOUS local obligation;first failure retained in source order

Conditions: none

For each intersection point x require some candidate basis element containing x and contained in the intersection.The entire intersection need not itself be a basis element.Check all refiners before declaring absence,and keep the first left/right/point failure in source order.

Step identifiers and dependencies

Rule: topbasis_full_local_point_refinement_not_intersection_membership · Uses: G001, S030

S032 · implies

Before

ORIGINAL ordered basis positions(left,right)=[3, 4];actual basis elements=[[1], [2]];FULL intersection=[]

After

ALL [intersection_point,ALL refining original basis indices] rows=[];empty intersection gives VACUOUS local obligation;first failure retained in source order

Conditions: none

For each intersection point x require some candidate basis element containing x and contained in the intersection.The entire intersection need not itself be a basis element.Check all refiners before declaring absence,and keep the first left/right/point failure in source order.

Step identifiers and dependencies

Rule: topbasis_full_local_point_refinement_not_intersection_membership · Uses: G001, S031

S033 · implies

Before

ORIGINAL ordered basis positions(left,right)=[3, 5];actual basis elements=[[1], [3]];FULL intersection=[]

After

ALL [intersection_point,ALL refining original basis indices] rows=[];empty intersection gives VACUOUS local obligation;first failure retained in source order

Conditions: none

For each intersection point x require some candidate basis element containing x and contained in the intersection.The entire intersection need not itself be a basis element.Check all refiners before declaring absence,and keep the first left/right/point failure in source order.

Step identifiers and dependencies

Rule: topbasis_full_local_point_refinement_not_intersection_membership · Uses: G001, S032

S034 · implies

Before

ORIGINAL ordered basis positions(left,right)=[3, 6];actual basis elements=[[1], [3, 4]];FULL intersection=[]

After

ALL [intersection_point,ALL refining original basis indices] rows=[];empty intersection gives VACUOUS local obligation;first failure retained in source order

Conditions: none

For each intersection point x require some candidate basis element containing x and contained in the intersection.The entire intersection need not itself be a basis element.Check all refiners before declaring absence,and keep the first left/right/point failure in source order.

Step identifiers and dependencies

Rule: topbasis_full_local_point_refinement_not_intersection_membership · Uses: G001, S033

S035 · implies

Before

ORIGINAL ordered basis positions(left,right)=[3, 7];actual basis elements=[[1], [4]];FULL intersection=[]

After

ALL [intersection_point,ALL refining original basis indices] rows=[];empty intersection gives VACUOUS local obligation;first failure retained in source order

Conditions: none

For each intersection point x require some candidate basis element containing x and contained in the intersection.The entire intersection need not itself be a basis element.Check all refiners before declaring absence,and keep the first left/right/point failure in source order.

Step identifiers and dependencies

Rule: topbasis_full_local_point_refinement_not_intersection_membership · Uses: G001, S034

S036 · implies

Before

ORIGINAL ordered basis positions(left,right)=[4, 0];actual basis elements=[[2], [0]];FULL intersection=[]

After

ALL [intersection_point,ALL refining original basis indices] rows=[];empty intersection gives VACUOUS local obligation;first failure retained in source order

Conditions: none

For each intersection point x require some candidate basis element containing x and contained in the intersection.The entire intersection need not itself be a basis element.Check all refiners before declaring absence,and keep the first left/right/point failure in source order.

Step identifiers and dependencies

Rule: topbasis_full_local_point_refinement_not_intersection_membership · Uses: G001, S035

S037 · implies

Before

ORIGINAL ordered basis positions(left,right)=[4, 1];actual basis elements=[[2], [0, 1]];FULL intersection=[]

After

ALL [intersection_point,ALL refining original basis indices] rows=[];empty intersection gives VACUOUS local obligation;first failure retained in source order

Conditions: none

For each intersection point x require some candidate basis element containing x and contained in the intersection.The entire intersection need not itself be a basis element.Check all refiners before declaring absence,and keep the first left/right/point failure in source order.

Step identifiers and dependencies

Rule: topbasis_full_local_point_refinement_not_intersection_membership · Uses: G001, S036

S038 · implies

Before

ORIGINAL ordered basis positions(left,right)=[4, 2];actual basis elements=[[2], [0, 2]];FULL intersection=[2]

After

ALL [intersection_point,ALL refining original basis indices] rows=[[2, [4]]];empty intersection gives VACUOUS local obligation;first failure retained in source order

Conditions: none

For each intersection point x require some candidate basis element containing x and contained in the intersection.The entire intersection need not itself be a basis element.Check all refiners before declaring absence,and keep the first left/right/point failure in source order.

Step identifiers and dependencies

Rule: topbasis_full_local_point_refinement_not_intersection_membership · Uses: G001, S037

S039 · implies

Before

ORIGINAL ordered basis positions(left,right)=[4, 3];actual basis elements=[[2], [1]];FULL intersection=[]

After

ALL [intersection_point,ALL refining original basis indices] rows=[];empty intersection gives VACUOUS local obligation;first failure retained in source order

Conditions: none

For each intersection point x require some candidate basis element containing x and contained in the intersection.The entire intersection need not itself be a basis element.Check all refiners before declaring absence,and keep the first left/right/point failure in source order.

Step identifiers and dependencies

Rule: topbasis_full_local_point_refinement_not_intersection_membership · Uses: G001, S038

S040 · implies

Before

ORIGINAL ordered basis positions(left,right)=[4, 4];actual basis elements=[[2], [2]];FULL intersection=[2]

After

ALL [intersection_point,ALL refining original basis indices] rows=[[2, [4]]];empty intersection gives VACUOUS local obligation;first failure retained in source order

Conditions: none

For each intersection point x require some candidate basis element containing x and contained in the intersection.The entire intersection need not itself be a basis element.Check all refiners before declaring absence,and keep the first left/right/point failure in source order.

Step identifiers and dependencies

Rule: topbasis_full_local_point_refinement_not_intersection_membership · Uses: G001, S039

S041 · implies

Before

ORIGINAL ordered basis positions(left,right)=[4, 5];actual basis elements=[[2], [3]];FULL intersection=[]

After

ALL [intersection_point,ALL refining original basis indices] rows=[];empty intersection gives VACUOUS local obligation;first failure retained in source order

Conditions: none

For each intersection point x require some candidate basis element containing x and contained in the intersection.The entire intersection need not itself be a basis element.Check all refiners before declaring absence,and keep the first left/right/point failure in source order.

Step identifiers and dependencies

Rule: topbasis_full_local_point_refinement_not_intersection_membership · Uses: G001, S040

S042 · implies

Before

ORIGINAL ordered basis positions(left,right)=[4, 6];actual basis elements=[[2], [3, 4]];FULL intersection=[]

After

ALL [intersection_point,ALL refining original basis indices] rows=[];empty intersection gives VACUOUS local obligation;first failure retained in source order

Conditions: none

For each intersection point x require some candidate basis element containing x and contained in the intersection.The entire intersection need not itself be a basis element.Check all refiners before declaring absence,and keep the first left/right/point failure in source order.

Step identifiers and dependencies

Rule: topbasis_full_local_point_refinement_not_intersection_membership · Uses: G001, S041

S043 · implies

Before

ORIGINAL ordered basis positions(left,right)=[4, 7];actual basis elements=[[2], [4]];FULL intersection=[]

After

ALL [intersection_point,ALL refining original basis indices] rows=[];empty intersection gives VACUOUS local obligation;first failure retained in source order

Conditions: none

For each intersection point x require some candidate basis element containing x and contained in the intersection.The entire intersection need not itself be a basis element.Check all refiners before declaring absence,and keep the first left/right/point failure in source order.

Step identifiers and dependencies

Rule: topbasis_full_local_point_refinement_not_intersection_membership · Uses: G001, S042

S044 · implies

Before

ORIGINAL ordered basis positions(left,right)=[5, 0];actual basis elements=[[3], [0]];FULL intersection=[]

After

ALL [intersection_point,ALL refining original basis indices] rows=[];empty intersection gives VACUOUS local obligation;first failure retained in source order

Conditions: none

For each intersection point x require some candidate basis element containing x and contained in the intersection.The entire intersection need not itself be a basis element.Check all refiners before declaring absence,and keep the first left/right/point failure in source order.

Step identifiers and dependencies

Rule: topbasis_full_local_point_refinement_not_intersection_membership · Uses: G001, S043

S045 · implies

Before

ORIGINAL ordered basis positions(left,right)=[5, 1];actual basis elements=[[3], [0, 1]];FULL intersection=[]

After

ALL [intersection_point,ALL refining original basis indices] rows=[];empty intersection gives VACUOUS local obligation;first failure retained in source order

Conditions: none

For each intersection point x require some candidate basis element containing x and contained in the intersection.The entire intersection need not itself be a basis element.Check all refiners before declaring absence,and keep the first left/right/point failure in source order.

Step identifiers and dependencies

Rule: topbasis_full_local_point_refinement_not_intersection_membership · Uses: G001, S044

S046 · implies

Before

ORIGINAL ordered basis positions(left,right)=[5, 2];actual basis elements=[[3], [0, 2]];FULL intersection=[]

After

ALL [intersection_point,ALL refining original basis indices] rows=[];empty intersection gives VACUOUS local obligation;first failure retained in source order

Conditions: none

For each intersection point x require some candidate basis element containing x and contained in the intersection.The entire intersection need not itself be a basis element.Check all refiners before declaring absence,and keep the first left/right/point failure in source order.

Step identifiers and dependencies

Rule: topbasis_full_local_point_refinement_not_intersection_membership · Uses: G001, S045

S047 · implies

Before

ORIGINAL ordered basis positions(left,right)=[5, 3];actual basis elements=[[3], [1]];FULL intersection=[]

After

ALL [intersection_point,ALL refining original basis indices] rows=[];empty intersection gives VACUOUS local obligation;first failure retained in source order

Conditions: none

For each intersection point x require some candidate basis element containing x and contained in the intersection.The entire intersection need not itself be a basis element.Check all refiners before declaring absence,and keep the first left/right/point failure in source order.

Step identifiers and dependencies

Rule: topbasis_full_local_point_refinement_not_intersection_membership · Uses: G001, S046

S048 · implies

Before

ORIGINAL ordered basis positions(left,right)=[5, 4];actual basis elements=[[3], [2]];FULL intersection=[]

After

ALL [intersection_point,ALL refining original basis indices] rows=[];empty intersection gives VACUOUS local obligation;first failure retained in source order

Conditions: none

For each intersection point x require some candidate basis element containing x and contained in the intersection.The entire intersection need not itself be a basis element.Check all refiners before declaring absence,and keep the first left/right/point failure in source order.

Step identifiers and dependencies

Rule: topbasis_full_local_point_refinement_not_intersection_membership · Uses: G001, S047

S049 · implies

Before

ORIGINAL ordered basis positions(left,right)=[5, 5];actual basis elements=[[3], [3]];FULL intersection=[3]

After

ALL [intersection_point,ALL refining original basis indices] rows=[[3, [5]]];empty intersection gives VACUOUS local obligation;first failure retained in source order

Conditions: none

For each intersection point x require some candidate basis element containing x and contained in the intersection.The entire intersection need not itself be a basis element.Check all refiners before declaring absence,and keep the first left/right/point failure in source order.

Step identifiers and dependencies

Rule: topbasis_full_local_point_refinement_not_intersection_membership · Uses: G001, S048

S050 · implies

Before

ORIGINAL ordered basis positions(left,right)=[5, 6];actual basis elements=[[3], [3, 4]];FULL intersection=[3]

After

ALL [intersection_point,ALL refining original basis indices] rows=[[3, [5]]];empty intersection gives VACUOUS local obligation;first failure retained in source order

Conditions: none

For each intersection point x require some candidate basis element containing x and contained in the intersection.The entire intersection need not itself be a basis element.Check all refiners before declaring absence,and keep the first left/right/point failure in source order.

Step identifiers and dependencies

Rule: topbasis_full_local_point_refinement_not_intersection_membership · Uses: G001, S049

S051 · implies

Before

ORIGINAL ordered basis positions(left,right)=[5, 7];actual basis elements=[[3], [4]];FULL intersection=[]

After

ALL [intersection_point,ALL refining original basis indices] rows=[];empty intersection gives VACUOUS local obligation;first failure retained in source order

Conditions: none

For each intersection point x require some candidate basis element containing x and contained in the intersection.The entire intersection need not itself be a basis element.Check all refiners before declaring absence,and keep the first left/right/point failure in source order.

Step identifiers and dependencies

Rule: topbasis_full_local_point_refinement_not_intersection_membership · Uses: G001, S050

S052 · implies

Before

ORIGINAL ordered basis positions(left,right)=[6, 0];actual basis elements=[[3, 4], [0]];FULL intersection=[]

After

ALL [intersection_point,ALL refining original basis indices] rows=[];empty intersection gives VACUOUS local obligation;first failure retained in source order

Conditions: none

For each intersection point x require some candidate basis element containing x and contained in the intersection.The entire intersection need not itself be a basis element.Check all refiners before declaring absence,and keep the first left/right/point failure in source order.

Step identifiers and dependencies

Rule: topbasis_full_local_point_refinement_not_intersection_membership · Uses: G001, S051

S053 · implies

Before

ORIGINAL ordered basis positions(left,right)=[6, 1];actual basis elements=[[3, 4], [0, 1]];FULL intersection=[]

After

ALL [intersection_point,ALL refining original basis indices] rows=[];empty intersection gives VACUOUS local obligation;first failure retained in source order

Conditions: none

For each intersection point x require some candidate basis element containing x and contained in the intersection.The entire intersection need not itself be a basis element.Check all refiners before declaring absence,and keep the first left/right/point failure in source order.

Step identifiers and dependencies

Rule: topbasis_full_local_point_refinement_not_intersection_membership · Uses: G001, S052

S054 · implies

Before

ORIGINAL ordered basis positions(left,right)=[6, 2];actual basis elements=[[3, 4], [0, 2]];FULL intersection=[]

After

ALL [intersection_point,ALL refining original basis indices] rows=[];empty intersection gives VACUOUS local obligation;first failure retained in source order

Conditions: none

For each intersection point x require some candidate basis element containing x and contained in the intersection.The entire intersection need not itself be a basis element.Check all refiners before declaring absence,and keep the first left/right/point failure in source order.

Step identifiers and dependencies

Rule: topbasis_full_local_point_refinement_not_intersection_membership · Uses: G001, S053

S055 · implies

Before

ORIGINAL ordered basis positions(left,right)=[6, 3];actual basis elements=[[3, 4], [1]];FULL intersection=[]

After

ALL [intersection_point,ALL refining original basis indices] rows=[];empty intersection gives VACUOUS local obligation;first failure retained in source order

Conditions: none

For each intersection point x require some candidate basis element containing x and contained in the intersection.The entire intersection need not itself be a basis element.Check all refiners before declaring absence,and keep the first left/right/point failure in source order.

Step identifiers and dependencies

Rule: topbasis_full_local_point_refinement_not_intersection_membership · Uses: G001, S054

S056 · implies

Before

ORIGINAL ordered basis positions(left,right)=[6, 4];actual basis elements=[[3, 4], [2]];FULL intersection=[]

After

ALL [intersection_point,ALL refining original basis indices] rows=[];empty intersection gives VACUOUS local obligation;first failure retained in source order

Conditions: none

For each intersection point x require some candidate basis element containing x and contained in the intersection.The entire intersection need not itself be a basis element.Check all refiners before declaring absence,and keep the first left/right/point failure in source order.

Step identifiers and dependencies

Rule: topbasis_full_local_point_refinement_not_intersection_membership · Uses: G001, S055

S057 · implies

Before

ORIGINAL ordered basis positions(left,right)=[6, 5];actual basis elements=[[3, 4], [3]];FULL intersection=[3]

After

ALL [intersection_point,ALL refining original basis indices] rows=[[3, [5]]];empty intersection gives VACUOUS local obligation;first failure retained in source order

Conditions: none

For each intersection point x require some candidate basis element containing x and contained in the intersection.The entire intersection need not itself be a basis element.Check all refiners before declaring absence,and keep the first left/right/point failure in source order.

Step identifiers and dependencies

Rule: topbasis_full_local_point_refinement_not_intersection_membership · Uses: G001, S056

S058 · implies

Before

ORIGINAL ordered basis positions(left,right)=[6, 6];actual basis elements=[[3, 4], [3, 4]];FULL intersection=[3, 4]

After

ALL [intersection_point,ALL refining original basis indices] rows=[[3, [5, 6]], [4, [6, 7]]];empty intersection gives VACUOUS local obligation;first failure retained in source order

Conditions: none

For each intersection point x require some candidate basis element containing x and contained in the intersection.The entire intersection need not itself be a basis element.Check all refiners before declaring absence,and keep the first left/right/point failure in source order.

Step identifiers and dependencies

Rule: topbasis_full_local_point_refinement_not_intersection_membership · Uses: G001, S057

S059 · implies

Before

ORIGINAL ordered basis positions(left,right)=[6, 7];actual basis elements=[[3, 4], [4]];FULL intersection=[4]

After

ALL [intersection_point,ALL refining original basis indices] rows=[[4, [7]]];empty intersection gives VACUOUS local obligation;first failure retained in source order

Conditions: none

For each intersection point x require some candidate basis element containing x and contained in the intersection.The entire intersection need not itself be a basis element.Check all refiners before declaring absence,and keep the first left/right/point failure in source order.

Step identifiers and dependencies

Rule: topbasis_full_local_point_refinement_not_intersection_membership · Uses: G001, S058

S060 · implies

Before

ORIGINAL ordered basis positions(left,right)=[7, 0];actual basis elements=[[4], [0]];FULL intersection=[]

After

ALL [intersection_point,ALL refining original basis indices] rows=[];empty intersection gives VACUOUS local obligation;first failure retained in source order

Conditions: none

For each intersection point x require some candidate basis element containing x and contained in the intersection.The entire intersection need not itself be a basis element.Check all refiners before declaring absence,and keep the first left/right/point failure in source order.

Step identifiers and dependencies

Rule: topbasis_full_local_point_refinement_not_intersection_membership · Uses: G001, S059

S061 · implies

Before

ORIGINAL ordered basis positions(left,right)=[7, 1];actual basis elements=[[4], [0, 1]];FULL intersection=[]

After

ALL [intersection_point,ALL refining original basis indices] rows=[];empty intersection gives VACUOUS local obligation;first failure retained in source order

Conditions: none

For each intersection point x require some candidate basis element containing x and contained in the intersection.The entire intersection need not itself be a basis element.Check all refiners before declaring absence,and keep the first left/right/point failure in source order.

Step identifiers and dependencies

Rule: topbasis_full_local_point_refinement_not_intersection_membership · Uses: G001, S060

S062 · implies

Before

ORIGINAL ordered basis positions(left,right)=[7, 2];actual basis elements=[[4], [0, 2]];FULL intersection=[]

After

ALL [intersection_point,ALL refining original basis indices] rows=[];empty intersection gives VACUOUS local obligation;first failure retained in source order

Conditions: none

For each intersection point x require some candidate basis element containing x and contained in the intersection.The entire intersection need not itself be a basis element.Check all refiners before declaring absence,and keep the first left/right/point failure in source order.

Step identifiers and dependencies

Rule: topbasis_full_local_point_refinement_not_intersection_membership · Uses: G001, S061

S063 · implies

Before

ORIGINAL ordered basis positions(left,right)=[7, 3];actual basis elements=[[4], [1]];FULL intersection=[]

After

ALL [intersection_point,ALL refining original basis indices] rows=[];empty intersection gives VACUOUS local obligation;first failure retained in source order

Conditions: none

For each intersection point x require some candidate basis element containing x and contained in the intersection.The entire intersection need not itself be a basis element.Check all refiners before declaring absence,and keep the first left/right/point failure in source order.

Step identifiers and dependencies

Rule: topbasis_full_local_point_refinement_not_intersection_membership · Uses: G001, S062

S064 · implies

Before

ORIGINAL ordered basis positions(left,right)=[7, 4];actual basis elements=[[4], [2]];FULL intersection=[]

After

ALL [intersection_point,ALL refining original basis indices] rows=[];empty intersection gives VACUOUS local obligation;first failure retained in source order

Conditions: none

For each intersection point x require some candidate basis element containing x and contained in the intersection.The entire intersection need not itself be a basis element.Check all refiners before declaring absence,and keep the first left/right/point failure in source order.

Step identifiers and dependencies

Rule: topbasis_full_local_point_refinement_not_intersection_membership · Uses: G001, S063

S065 · implies

Before

ORIGINAL ordered basis positions(left,right)=[7, 5];actual basis elements=[[4], [3]];FULL intersection=[]

After

ALL [intersection_point,ALL refining original basis indices] rows=[];empty intersection gives VACUOUS local obligation;first failure retained in source order

Conditions: none

For each intersection point x require some candidate basis element containing x and contained in the intersection.The entire intersection need not itself be a basis element.Check all refiners before declaring absence,and keep the first left/right/point failure in source order.

Step identifiers and dependencies

Rule: topbasis_full_local_point_refinement_not_intersection_membership · Uses: G001, S064

S066 · implies

Before

ORIGINAL ordered basis positions(left,right)=[7, 6];actual basis elements=[[4], [3, 4]];FULL intersection=[4]

After

ALL [intersection_point,ALL refining original basis indices] rows=[[4, [7]]];empty intersection gives VACUOUS local obligation;first failure retained in source order

Conditions: none

For each intersection point x require some candidate basis element containing x and contained in the intersection.The entire intersection need not itself be a basis element.Check all refiners before declaring absence,and keep the first left/right/point failure in source order.

Step identifiers and dependencies

Rule: topbasis_full_local_point_refinement_not_intersection_membership · Uses: G001, S065

S067 · implies

Before

ORIGINAL ordered basis positions(left,right)=[7, 7];actual basis elements=[[4], [4]];FULL intersection=[4]

After

ALL [intersection_point,ALL refining original basis indices] rows=[[4, [7]]];empty intersection gives VACUOUS local obligation;first failure retained in source order

Conditions: none

For each intersection point x require some candidate basis element containing x and contained in the intersection.The entire intersection need not itself be a basis element.Check all refiners before declaring absence,and keep the first left/right/point failure in source order.

Step identifiers and dependencies

Rule: topbasis_full_local_point_refinement_not_intersection_membership · Uses: G001, S066

S068 · implies

Before

ACTUAL cover=Yes;ALL local point obligations refined=Yes;first failure[left,right,point,intersection]=null

After

abstract basis validity=Yes is cover AND LOCAL refinement;not closure of the family under intersections and not a given-topology certificate yet

Conditions: none

Their conjunction gives an abstract basis.Coverage alone is insufficient,and a valid basis need not be intersection-closed.A basis for a separately supplied topology also needs openness and generation of every given open.

Step identifiers and dependencies

Rule: topbasis_cover_and_local_refinement_conjunction · Uses: G001, S067

S069 · implies

Before

ORIGINAL complete candidate basis in fixed family-index order=[[0], [0, 1], [0, 2], [1], [2], [3], [3, 4], [4]];carrier Fin(5)

After

prefix0 has EXACTLY the empty-subfamily union:empty set,with empty index witness;this mathematical union exists even when basis axioms fail

Conditions: none

The empty subfamily always has empty union,without requiring the empty set to be a basis element.This step constructs unions only and does not call an invalid basis's unions a topology.

Step identifiers and dependencies

Rule: topbasis_empty_union_initial_state_not_missing_empty_set · Uses: G001, S068

S070 · implies

Before

next ORIGINAL basis index=0;basis set=[0];ALL previous-prefix unions in numeric POINT-mask order=[[]]

After

ALL [previous_union,union_with_new_basis,index_witness] rows=[[[], [0], [0]]];keep both omit/include choices,then deduplicate EQUAL UNIONS;new canonical union family=[[], [0]]

Conditions: none

Any subfamily of the new prefix either omits the new element or includes it with a union from the previous prefix.These choices are complete and every state has an actual index witness.Deduplicate equal unions,not original basis positions.There are at most2^n distinct states,not a sample of the2^basisCount subfamilies.

Step identifiers and dependencies

Rule: topbasis_complete_prefix_union_DP_not_sampled_subfamilies · Uses: G001, S069

S071 · implies

Before

next ORIGINAL basis index=1;basis set=[0, 1];ALL previous-prefix unions in numeric POINT-mask order=[[], [0]]

After

ALL [previous_union,union_with_new_basis,index_witness] rows=[[[], [0, 1], [1]], [[0], [0, 1], [0, 1]]];keep both omit/include choices,then deduplicate EQUAL UNIONS;new canonical union family=[[], [0], [0, 1]]

Conditions: none

Any subfamily of the new prefix either omits the new element or includes it with a union from the previous prefix.These choices are complete and every state has an actual index witness.Deduplicate equal unions,not original basis positions.There are at most2^n distinct states,not a sample of the2^basisCount subfamilies.

Step identifiers and dependencies

Rule: topbasis_complete_prefix_union_DP_not_sampled_subfamilies · Uses: G001, S070

S072 · implies

Before

next ORIGINAL basis index=2;basis set=[0, 2];ALL previous-prefix unions in numeric POINT-mask order=[[], [0], [0, 1]]

After

ALL [previous_union,union_with_new_basis,index_witness] rows=[[[], [0, 2], [2]], [[0], [0, 2], [0, 2]], [[0, 1], [0, 1, 2], [1, 2]]];keep both omit/include choices,then deduplicate EQUAL UNIONS;new canonical union family=[[], [0], [0, 1], [0, 1, 2], [0, 2]]

Conditions: none

Any subfamily of the new prefix either omits the new element or includes it with a union from the previous prefix.These choices are complete and every state has an actual index witness.Deduplicate equal unions,not original basis positions.There are at most2^n distinct states,not a sample of the2^basisCount subfamilies.

Step identifiers and dependencies

Rule: topbasis_complete_prefix_union_DP_not_sampled_subfamilies · Uses: G001, S071

S073 · implies

Before

next ORIGINAL basis index=3;basis set=[1];ALL previous-prefix unions in numeric POINT-mask order=[[], [0], [0, 1], [0, 2], [0, 1, 2]]

After

ALL [previous_union,union_with_new_basis,index_witness] rows=[[[], [1], [3]], [[0], [0, 1], [0, 3]], [[0, 1], [0, 1], [1, 3]], [[0, 2], [0, 1, 2], [2, 3]], [[0, 1, 2], [0, 1, 2], [1, 2, 3]]];keep both omit/include choices,then deduplicate EQUAL UNIONS;new canonical union family=[[], [0], [0, 1], [0, 1, 2], [0, 2], [1]]

Conditions: none

Any subfamily of the new prefix either omits the new element or includes it with a union from the previous prefix.These choices are complete and every state has an actual index witness.Deduplicate equal unions,not original basis positions.There are at most2^n distinct states,not a sample of the2^basisCount subfamilies.

Step identifiers and dependencies

Rule: topbasis_complete_prefix_union_DP_not_sampled_subfamilies · Uses: G001, S072

S074 · implies

Before

next ORIGINAL basis index=4;basis set=[2];ALL previous-prefix unions in numeric POINT-mask order=[[], [0], [1], [0, 1], [0, 2], [0, 1, 2]]

After

ALL [previous_union,union_with_new_basis,index_witness] rows=[[[], [2], [4]], [[0], [0, 2], [0, 4]], [[1], [1, 2], [3, 4]], [[0, 1], [0, 1, 2], [1, 4]], [[0, 2], [0, 2], [2, 4]], [[0, 1, 2], [0, 1, 2], [1, 2, 4]]];keep both omit/include choices,then deduplicate EQUAL UNIONS;new canonical union family=[[], [0], [0, 1], [0, 1, 2], [0, 2], [1], [1, 2], [2]]

Conditions: none

Any subfamily of the new prefix either omits the new element or includes it with a union from the previous prefix.These choices are complete and every state has an actual index witness.Deduplicate equal unions,not original basis positions.There are at most2^n distinct states,not a sample of the2^basisCount subfamilies.

Step identifiers and dependencies

Rule: topbasis_complete_prefix_union_DP_not_sampled_subfamilies · Uses: G001, S073

S075 · implies

Before

next ORIGINAL basis index=5;basis set=[3];ALL previous-prefix unions in numeric POINT-mask order=[[], [0], [1], [0, 1], [2], [0, 2], [1, 2], [0, 1, 2]]

After

ALL [previous_union,union_with_new_basis,index_witness] rows=[[[], [3], [5]], [[0], [0, 3], [0, 5]], [[1], [1, 3], [3, 5]], [[0, 1], [0, 1, 3], [1, 5]], [[2], [2, 3], [4, 5]], [[0, 2], [0, 2, 3], [2, 5]], [[1, 2], [1, 2, 3], [3, 4, 5]], [[0, 1, 2], [0, 1, 2, 3], [1, 2, 5]]];keep both omit/include choices,then deduplicate EQUAL UNIONS;new canonical union family=[[], [0], [0, 1], [0, 1, 2], [0, 1, 2, 3], [0, 1, 3], [0, 2], [0, 2, 3], [0, 3], [1], [1, 2], [1, 2, 3], [1, 3], [2], [2, 3], [3]]

Conditions: none

Any subfamily of the new prefix either omits the new element or includes it with a union from the previous prefix.These choices are complete and every state has an actual index witness.Deduplicate equal unions,not original basis positions.There are at most2^n distinct states,not a sample of the2^basisCount subfamilies.

Step identifiers and dependencies

Rule: topbasis_complete_prefix_union_DP_not_sampled_subfamilies · Uses: G001, S074

S076 · implies

Before

next ORIGINAL basis index=6;basis set=[3, 4];ALL previous-prefix unions in numeric POINT-mask order=[[], [0], [1], [0, 1], [2], [0, 2], [1, 2], [0, 1, 2], [3], [0, 3], [1, 3], [0, 1, 3], [2, 3], [0, 2, 3], [1, 2, 3], [0, 1, 2, 3]]

After

ALL [previous_union,union_with_new_basis,index_witness] rows=[[[], [3, 4], [6]], [[0], [0, 3, 4], [0, 6]], [[1], [1, 3, 4], [3, 6]], [[0, 1], [0, 1, 3, 4], [1, 6]], [[2], [2, 3, 4], [4, 6]], [[0, 2], [0, 2, 3, 4], [2, 6]], [[1, 2], [1, 2, 3, 4], [3, 4, 6]], [[0, 1, 2], [0, 1, 2, 3, 4], [1, 2, 6]], [[3], [3, 4], [5, 6]], [[0, 3], [0, 3, 4], [0, 5, 6]], [[1, 3], [1, 3, 4], [3, 5, 6]], [[0, 1, 3], [0, 1, 3, 4], [1, 5, 6]], [[2, 3], [2, 3, 4], [4, 5, 6]], [[0, 2, 3], [0, 2, 3, 4], [2, 5, 6]], [[1, 2, 3], [1, 2, 3, 4], [3, 4, 5, 6]], [[0, 1, 2, 3], [0, 1, 2, 3, 4], [1, 2, 5, 6]]];keep both omit/include choices,then deduplicate EQUAL UNIONS;new canonical union family=[[], [0], [0, 1], [0, 1, 2], [0, 1, 2, 3], [0, 1, 2, 3, 4], [0, 1, 3], [0, 1, 3, 4], [0, 2], [0, 2, 3], [0, 2, 3, 4], [0, 3], [0, 3, 4], [1], [1, 2], [1, 2, 3], [1, 2, 3, 4], [1, 3], [1, 3, 4], [2], [2, 3], [2, 3, 4], [3], [3, 4]]

Conditions: none

Any subfamily of the new prefix either omits the new element or includes it with a union from the previous prefix.These choices are complete and every state has an actual index witness.Deduplicate equal unions,not original basis positions.There are at most2^n distinct states,not a sample of the2^basisCount subfamilies.

Step identifiers and dependencies

Rule: topbasis_complete_prefix_union_DP_not_sampled_subfamilies · Uses: G001, S075

S077 · implies

Before

next ORIGINAL basis index=7;basis set=[4];ALL previous-prefix unions in numeric POINT-mask order=[[], [0], [1], [0, 1], [2], [0, 2], [1, 2], [0, 1, 2], [3], [0, 3], [1, 3], [0, 1, 3], [2, 3], [0, 2, 3], [1, 2, 3], [0, 1, 2, 3], [3, 4], [0, 3, 4], [1, 3, 4], [0, 1, 3, 4], [2, 3, 4], [0, 2, 3, 4], [1, 2, 3, 4], [0, 1, 2, 3, 4]]

After

ALL [previous_union,union_with_new_basis,index_witness] rows=[[[], [4], [7]], [[0], [0, 4], [0, 7]], [[1], [1, 4], [3, 7]], [[0, 1], [0, 1, 4], [1, 7]], [[2], [2, 4], [4, 7]], [[0, 2], [0, 2, 4], [2, 7]], [[1, 2], [1, 2, 4], [3, 4, 7]], [[0, 1, 2], [0, 1, 2, 4], [1, 2, 7]], [[3], [3, 4], [5, 7]], [[0, 3], [0, 3, 4], [0, 5, 7]], [[1, 3], [1, 3, 4], [3, 5, 7]], [[0, 1, 3], [0, 1, 3, 4], [1, 5, 7]], [[2, 3], [2, 3, 4], [4, 5, 7]], [[0, 2, 3], [0, 2, 3, 4], [2, 5, 7]], [[1, 2, 3], [1, 2, 3, 4], [3, 4, 5, 7]], [[0, 1, 2, 3], [0, 1, 2, 3, 4], [1, 2, 5, 7]], [[3, 4], [3, 4], [6, 7]], [[0, 3, 4], [0, 3, 4], [0, 6, 7]], [[1, 3, 4], [1, 3, 4], [3, 6, 7]], [[0, 1, 3, 4], [0, 1, 3, 4], [1, 6, 7]], [[2, 3, 4], [2, 3, 4], [4, 6, 7]], [[0, 2, 3, 4], [0, 2, 3, 4], [2, 6, 7]], [[1, 2, 3, 4], [1, 2, 3, 4], [3, 4, 6, 7]], [[0, 1, 2, 3, 4], [0, 1, 2, 3, 4], [1, 2, 6, 7]]];keep both omit/include choices,then deduplicate EQUAL UNIONS;new canonical union 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]]

Conditions: none

Any subfamily of the new prefix either omits the new element or includes it with a union from the previous prefix.These choices are complete and every state has an actual index witness.Deduplicate equal unions,not original basis positions.There are at most2^n distinct states,not a sample of the2^basisCount subfamilies.

Step identifiers and dependencies

Rule: topbasis_complete_prefix_union_DP_not_sampled_subfamilies · Uses: G001, S076

S078 · implies

Before

ALL original basis positions processed;distinct union states=32<=2^5;canonical ALL-union 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]]

After

prefix induction covers EVERY original-index subfamily and every state is its actual union;mathematical all-union family COMPLETE including empty union

Conditions: none

Omit/include induction puts every subfamily union into the states,and every state has an actual subfamily witness,proving both directions.Do not misreport the smaller distinct-state count as the number of subfamilies explicitly enumerated.

Step identifiers and dependencies

Rule: topbasis_all_subfamily_unions_complete_not_exponential_enumeration_claim · Uses: G001, S077

S079 · implies

Before

JUST-VERIFIED cover and ALL local refinement for ORIGINAL basis=[[0], [0, 1], [0, 2], [1], [2], [3], [3, 4], [4]];COMPLETE all-union 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]]

After

empty/full carrier present;ANY union of basis-unions flattens to a basis-union;for x in U intersection V choose basis B,C around x then its verified local refiner inside B intersection C,so U intersection V is itself a basis-union;this family IS a topology on Fin(5)

Conditions: none

Local refinement supplies a basis element around each point inside U∩V,and their union equals that intersection.This proves intersection closure without requiring the basis family itself intersection-closed.Arbitrary-union flattening,coverage of the full carrier and the empty union complete the topology axioms.

Step identifiers and dependencies

Rule: topbasis_basis_to_topology_arbitrary_union_and_local_intersection_proof · Uses: G001, S078

Reverse checks

  • S079 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S078 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • 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

([[], [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]], 32, Yes, all_unions_of_basis_elements)

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: b0581a8551c795fa52161328fb642f8ee84c6602a47943211a57a75442b10113
  • candidate record SHA-256: 6aef3ad82d1690f4d25e0a55576019a4cbc47ee2ba2d54bca2b91fc0b628fe94
  • semantic review receipt SHA-256: c6483ed1229af9183fe5c704a2627b1558ad9a31bfbb0d2ee2d5c1a1c299ab4d
  • question-first witness SHA-256: e81f9a560d630fcb23441146f008c4feca7aceab3ebe4de2cf1997c061375ef7
  • Lean: NOT_RUN · human review: NOT_PERFORMED
Same-source full JSON