S001 · implies
操作前
complete carrier Fin(6);original relation pairs=[[0, 0], [0, 1], [1, 0], [1, 1], [2, 2], [2, 4], [2, 5], [3, 3], [4, 2], [4, 4], [4, 5], [5, 2], [5, 4], [5, 5]]
操作後
set of pairs=[[0, 0], [0, 1], [1, 0], [1, 1], [2, 2], [2, 4], [2, 5], [3, 3], [4, 2], [4, 4], [4, 5], [5, 2], [5, 4], [5, 5]];reflexive/symmetric/transitive=[是, 是, 是]
條件:無
把原pairs按集合語義讀,重複列不改關係;先核自反、對稱、傳遞,不能把非等價關係的連通分量當原關係之商。
步驟識別與依賴
規則:quotient_complete_equivalence_not_connectedness_only · 依賴:G001
S002 · implies
操作前
least uncovered carrier label=0;all labels related from it=[0, 1]
操作後
next canonical full class=[0, 1];covered labels=[0, 1]
條件:無
類內照原載體遞增列全體元素,類與類依最小未覆蓋元素排序;商元素是整個類,不是只有代表的標籤。
步驟識別與依賴
規則:quotient_full_classes_in_least_representative_order · 依賴:G001, S001
S003 · implies
操作前
least uncovered carrier label=2;all labels related from it=[2, 4, 5]
操作後
next canonical full class=[2, 4, 5];covered labels=[0, 1, 2, 4, 5]
條件:無
類內照原載體遞增列全體元素,類與類依最小未覆蓋元素排序;商元素是整個類,不是只有代表的標籤。
步驟識別與依賴
規則:quotient_full_classes_in_least_representative_order · 依賴:G001, S002
S004 · implies
操作前
least uncovered carrier label=3;all labels related from it=[3]
操作後
next canonical full class=[3];covered labels=[0, 1, 2, 3, 4, 5]
條件:無
類內照原載體遞增列全體元素,類與類依最小未覆蓋元素排序;商元素是整個類,不是只有代表的標籤。
步驟識別與依賴
規則:quotient_full_classes_in_least_representative_order · 依賴:G001, S003
S005 · implies
操作前
all complete canonical classes=[[0, 1], [2, 4, 5], [3]];original carrier=[0, 1, 2, 3, 4, 5]
操作後
cover whole carrier=是;pairwise disjoint=是;class count=3
條件:無
等價類覆蓋原載體且兩兩不交,各元素恰屬一類;空載體的空族亦保留空覆蓋與不交,不憑類數猜partition。
步驟識別與依賴
規則:quotient_partition_cover_and_disjoint_not_count_only · 依賴:G001, S004
S006 · implies
操作前
original element=4;canonical quotient elements=[[0, 1], [2, 4, 5], [3]]
操作後
projection sends4 to whole class=[2, 4, 5]
條件:無
自然投影送元素到其全等價類,不是送到類的最小元素,也未給商上的加法乘法。
步驟識別與依賴
規則:quotient_projection_element_to_full_class · 依賴:G001, S005