原題與已知條件
完整有限拓撲與指定點。操作=neighborhood-qualification;資料={"n":4,"opens":[[],[0],[0,3],[0,1,3],[0,1,2,3]],"x":0,"candidate":[0,1,3]}。請依 [n,x,point_qualified,candidate,x_in_candidate,candidate_open,neighborhood] 欄序回答。
G001 — 完整有限拓撲與指定點。操作=neighborhood-qualification;資料={"n":4,"opens":[[],[0],[0,3],[0,1,3],[0,1,2,3]],"x":0,"candidate":[0,1,3]}。請依 [n,x,point_qualified,candidate,x_in_candidate,candidate_open,neighborhood] 欄序回答。
逐步推導
S001 · implies
操作前
n=4;raw open family=[[], [0], [0, 3], [0, 1, 3], [0, 1, 2, 3]]
操作後
universe=[0, 1, 2, 3];normalized opens=[[], [0], [0, 3], [0, 1, 3], [0, 1, 2, 3]];empty=是;full=是;union closed=是;intersection closed=是
條件:無
子集與族去重後按mask排序,完整核空集、全集及二元聯交閉合。有限底集合使任意聯集只需有限不同成員;本題要求真拓撲,非法資料不拿來算後續性質。
步驟識別與依賴
規則:given_complete_finite_topology_guard · 依賴:G001
S002 · implies
操作前
point candidate=0;underlying Fin(4)
操作後
point qualified=是
條件:無
域外點不作鄰域判斷,不由負索引或空見證表製造假;候選集合的型別仍須獨立合格。
步驟識別與依賴
規則:neighborhood_point_domain_guard · 依賴:G001, S001
S003 · implies
操作前
raw candidate=[0, 1, 3]
操作後
typed normalized candidate=[0, 1, 3]
條件:無
集合去重與點資格是分開的資料條件。
步驟識別與依賴
規則:neighborhood_candidate_set_normalization · 依賴:G001, S002
S004 · implies
操作前
point=0;complete open family=[[], [0], [0, 3], [0, 1, 3], [0, 1, 2, 3]]
操作後
all point-containing opens=[[0], [0, 3], [0, 1, 3], [0, 1, 2, 3]]
條件:無
只取含該合法點的所有開集,作完整見證候選;鄰域本身不必開,只需包含其中至少一個。
步驟識別與依賴
規則:complete_point_open_witness_basis · 依賴:G001, S003
S005 · implies
操作前
phase=candidate;point=0;candidate=[0, 1, 3];point-open basis=[[0], [0, 3], [0, 1, 3], [0, 1, 2, 3]]
操作後
all contained open witnesses=[[0], [0, 3], [0, 1, 3]];neighborhood=是
條件:無
依x∈U⊆candidate列出所有開見證;有一個即是鄰域,沒有才否定,不能只看candidate是否開或是否含點。
步驟識別與依賴
規則:all_open_neighborhood_witnesses · 依賴:G001, S004
S006 · implies
操作前
point qualified=是;candidate=[0, 1, 3]
操作後
contains point/status=是;open/status=是;neighborhood/status=是
條件:無
含點、開性與鄰域性分開列;域外點時協定三欄都不求值,而不是把可計算的集合開性偷填進去。
步驟識別與依賴
規則:neighborhood_membership_openness_not_identical · 依賴:G001, S005
結論
(4, 0, 是, [0, 1, 3], 是, 是, 是)
依上列完整代值及條件核對得到原題答案;原題編號、格式與狀態保持不變。