第 26185 題：多對一歸約

原題與已知條件

明示decision predicates與complete total map的雙向membership equivalence。操作=mreduction-total-map-qualification；資料={"source_carrier":[0,1,2,3,4,5,6,7,8,9,10,11],"target_carrier":[0,1,2],"mapping":[0,1,2,0,1,2,0,1,2,0,1,2]}。請依 exact_ordered_tuple_declared_by_interface 欄序回答。

• G001 — 明示decision predicates與complete total map的雙向membership equivalence。操作=mreduction-total-map-qualification；資料={"source_carrier":[0,1,2,3,4,5,6,7,8,9,10,11],"target_carrier":[0,1,2],"mapping":[0,1,2,0,1,2,0,1,2,0,1,2]}。請依 exact_ordered_tuple_declared_by_interface 欄序回答。

定義與適用範圍

沿用原題明示的論域、假設與來源 MKO 定義。本題已完成第二對話數理與中英語義覆核，並由原始參數逐題獨立重算模型、答案與每個算術步驟；原題仍為 candidate。

• mko-many-one-reduction

逐步推導

source roles = [mreduction-total-map-qualification]

derived = [[source_carrier, target_carrier, mapping_rows, total, first_invalid_image_or_null, certificate]]

source roles = [Reduction ORIGINAL map, [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11], [0, 1, 2], [0, 1, 2, 0, 1, 2, 0, 1, 2, 0, 1, 2]]

derived = [[0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11], [0, 1, 2], [0, 1, 2, 0, 1, 2, 0, 1, 2, 0, 1, 2], [[0, 0, 是], [1, 1, 是], [2, 2, 是], [3, 0, 是], [4, 1, 是], [5, 2, 是], [6, 0, 是], [7, 1, 是], [8, 2, 是], [9, 0, 是], [10, 1, 是], [11, 2, 是]], 是, null]

逐步反向核對

• S002 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S001 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。

結論

([0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11], [0, 1, 2], [[0, 0, 是], [1, 1, 是], [2, 2, 是], [3, 0, 是], [4, 1, 是], [5, 2, 是], [6, 0, 是], [7, 1, 是], [8, 2, 是], [9, 0, 是], [10, 1, 是], [11, 2, 是]], 是, null, many_one_reduction_requires_a_complete_total_map_before_membership_audit)

依上列完整代值及條件核對得到原題答案；原題編號、格式與狀態保持不變。

本題覆核與來源綁定

覆核日期：2026-10-26

原題、答案、步驟表達式、數值 AST 與既有歷史保持原樣；原來的候選狀態屬於來源歷史，不覆寫為形式化證明。