原題與已知條件
完整有限拓撲、目標集合與原始cover family。操作=cover-minimal-subcover;資料={"n":5,"topology":[[],[0],[0,4],[0,1,4],[0,1,2,4],[0,1,2,3,4]],"target":[0,1,2,4],"cover":[[0,4],[0,1,2,4],[0,1,2,3,4]],"selected":[1]}。請依 [selected_indexes,valid_subcover,removal_rows,inclusion_minimal,boundary] 欄序回答。
G001 — 完整有限拓撲、目標集合與原始cover family。操作=cover-minimal-subcover;資料={"n":5,"topology":[[],[0],[0,4],[0,1,4],[0,1,2,4],[0,1,2,3,4]],"target":[0,1,2,4],"cover":[[0,4],[0,1,2,4],[0,1,2,3,4]],"selected":[1]}。請依 [selected_indexes,valid_subcover,removal_rows,inclusion_minimal,boundary] 欄序回答。
逐步推導
S001 · implies
操作前
same finite carrier Fin(5);complete original ordered topology=[[], [0], [0, 4], [0, 1, 4], [0, 1, 2, 4], [0, 1, 2, 3, 4]]
操作後
unique empty and whole opens=是;all ordered open pairs=36;first union closure failure=null;first intersection closure failure=null
條件:無
先核子集表示、空集與全集、全部兩開集的聯/交仍開。因拓撲族本身有限,任意聯集只含有限種不同開集,反覆二元聯封閉便涵蓋它;有限交亦由二元交與全集得到。未供度量,不引入距離。
步驟識別與依賴
規則:cover_qualified_complete_topology_no_silent_metric · 依賴:G001
S002 · implies
操作前
original cover family index=0;member=[0, 4];complete same topology=[[], [0], [0, 4], [0, 1, 4], [0, 1, 2, 4], [0, 1, 2, 3, 4]]
操作後
original member open=是
條件:無
逐原始索引核開性,相同集合可以在不同索引重複;不能去重改題,也不能因它沒被選入就略過其非開性。
步驟識別與依賴
規則:cover_every_original_index_open_including_unused_members · 依賴:G001, S001
S003 · implies
操作前
original cover family index=1;member=[0, 1, 2, 4];complete same topology=[[], [0], [0, 4], [0, 1, 4], [0, 1, 2, 4], [0, 1, 2, 3, 4]]
操作後
original member open=是
條件:無
逐原始索引核開性,相同集合可以在不同索引重複;不能去重改題,也不能因它沒被選入就略過其非開性。
步驟識別與依賴
規則:cover_every_original_index_open_including_unused_members · 依賴:G001, S002
S004 · implies
操作前
original cover family index=2;member=[0, 1, 2, 3, 4];complete same topology=[[], [0], [0, 4], [0, 1, 4], [0, 1, 2, 4], [0, 1, 2, 3, 4]]
操作後
original member open=是
條件:無
逐原始索引核開性,相同集合可以在不同索引重複;不能去重改題,也不能因它沒被選入就略過其非開性。
步驟識別與依賴
規則:cover_every_original_index_open_including_unused_members · 依賴:G001, S003
S005 · implies
操作前
same target=[0, 1, 2, 4];union of ALL original members=[0, 1, 2, 3, 4];nonopen original indices=[]
操作後
covers target=是;whole original open cover valid=是
條件:無
開性與覆蓋目標是獨立義務,聯集可超過目標;只要包含即可,不要求聯集等於目標。兩者同時成立才核可原cover。
步驟識別與依賴
規則:cover_openness_and_target_coverage_separate_conjunction · 依賴:G001, S004
S006 · implies
操作前
raw selected ORIGINAL indices=[1];normalized duplicate-free indices=[1];selected original sets=[[0, 1, 2, 4]]
操作後
selected union=[0, 1, 2, 4];selected all open=是;selected covers target=是;original family qualified=是;valid selected subcover=是
條件:無
只依原索引取成員,排序索引但拒重複;空選取在空目標可合格。此協定另要求整個原族先為有效開覆蓋,所以好子族不能抹去未選中壞原成員。
步驟識別與依賴
規則:cover_selected_original_indices_whole_family_premise_retained · 依賴:G001, S005
S007 · implies
操作前
remove original selected index=1;remaining selected indices=[];remaining union=[];same target=[0, 1, 2, 4]
操作後
removal coverage row=[1, [], 否]
條件:無
每次只刪這個已選成員,重算剩餘聯集是否仍覆蓋原目標;保留原索引與移除順序,不用全圖最小化替代本題的包含極小測試。
步驟識別與依賴
規則:cover_every_single_member_removal_target_test · 依賴:G001, S006
S008 · implies
操作前
valid selected subcover=是;all single-removal rows=[[1, [], 否]]
操作後
inclusion-minimal=是;inclusion_minimal_not_minimum_cardinality
條件:無
從有效subcover出發,任何單一刪除都失敗才包含極小;若真有較小包含子族,先刪一個不在其中的成員仍會覆蓋,故單刪測試足夠。但原族其他不可比較選取可能張數更少,不能據此一般宣稱最小張數。
步驟識別與依賴
規則:cover_inclusion_minimal_not_global_smallest_size · 依賴:G001, S007