{
  "schema_version": "ocme-reviewed-question-reader-v1",
  "question_id": "q-20261012-advance-20261016-r07-surjective-0006",
  "pilot_number": "R0014-07756",
  "number": 7756,
  "family_id": "qf-density16-surj-fiber-inventory",
  "title": {
    "zh-Hant": "第 7756 題：陪域全纖維與缺目標",
    "en": "Question 7756: Every Declared Codomain Fiber and Missing Target"
  },
  "original_question": {
    "schema_version": "ocme-question-v0.1",
    "id": "q-20261012-advance-20261016-r07-surjective-0006",
    "batch_id": "batch-20261012-advance-20261016-r07-surjective-foundations",
    "language": "zh-Hant",
    "source_mko_ids": [
      "mko-surjective"
    ],
    "title_zh": "陪域全纖維與缺目標",
    "stem_zh": "Fin型別從0起，完整總表；Fin(5)=[0, 1, 2, 3, 4]→Fin(3)=[0, 1, 2]，images=[2, 0, 0, 0, 1]。求 (原images, 按陪域0到m−1的全部纖維, 缺目標, 滿射資格)。空陪域的纖維列為空。",
    "answer": {
      "kind": "expression",
      "value": "([2, 0, 0, 0, 1], [[1, 2, 3], [4], [0]], [], 是)",
      "explanation_zh": "有限結構核對=([2, 0, 0, 0, 1], [[1, 2, 3], [4], [0]], [], 是)。每個宣告目標都列來源索引；只要有一個空纖維即不滿射。有限精確核對不是一般形式證明。先資格後求值，空函數條件依宣告陪域。"
    },
    "difficulty": {
      "band": "undergraduate_core",
      "level": 1,
      "skills": [
        "陪域全纖維與缺目標"
      ]
    },
    "variant": {
      "family_id": "qf-density16-surj-fiber-inventory",
      "seed": 202610167006,
      "parameters": {
        "n": 5,
        "m": 3,
        "images": [
          2,
          0,
          0,
          0,
          1
        ],
        "domain": "Fin_total_table",
        "operation": "surj-fiber-inventory",
        "semantic_template": "qf-density16-surj-fiber-inventory/{\"images\":[2,0,0,0,1],\"m\":3,\"n\":5}"
      }
    },
    "verification": {
      "status": "candidate",
      "checks": [
        "producer_exact_integer_rational_arithmetic",
        "producer_finite_enumeration",
        "producer_source_snapshot_check",
        "producer_substantive_template_deduplication",
        "producer_json_schema"
      ],
      "warning_zh": "僅為產生端候選及自檢；主端須另做獨立驗收，不構成人工審定、普遍證明或形式 Evidence。"
    },
    "provenance": {
      "generator_role": "question_producer",
      "generator_model": "model_unknown",
      "generated_at": "2026-10-12",
      "contract_version": "ocme-question-factory-v0.1"
    }
  },
  "original_english_edition": {
    "schema_version": "ocme-question-localization-v0.1",
    "question_id": "q-20261012-advance-20261016-r07-surjective-0006",
    "batch_id": "batch-20261012-advance-20261016-r07-surjective-foundations",
    "locale": "en",
    "translation_state": "ai_candidate",
    "source": {
      "question_sha256": "3cea3aedc5889dfd55f6d87c9a001e07a757c866c950675920fef47cea54be84",
      "family_id": "qf-density16-surj-fiber-inventory",
      "seed": 202610167006,
      "semantic_template": "qf-density16-surj-fiber-inventory/{\"images\":[2,0,0,0,1],\"m\":3,\"n\":5}"
    },
    "fields": {
      "title": "Every Declared Codomain Fiber and Missing Target",
      "stem": "Finite types start at 0: Fin(5)={0,…,4}→Fin(3), complete images=[2, 0, 0, 0, 1]. Check the whole original total table before any candidate evaluation; empty-function properties depend on the declared codomain. Give (original images, all fibers in codomain order 0,…,m−1, missing targets, surjectivity eligibility). An empty codomain has an empty fiber list.",
      "answer": {
        "kind": "expression",
        "value": "([2, 0, 0, 0, 1], [[1, 2, 3], [4], [0]], [], Yes)",
        "explanation": "List every declared target’s source-index fiber; any empty fiber prevents surjectivity. The empty-to-empty map is surjective, unlike an empty source with nonempty codomain. These exact finite checks are not new general formal Evidence. The exact result, retaining the requested order, is ([2, 0, 0, 0, 1], [[1, 2, 3], [4], [0]], [], Yes)."
      },
      "skills": [
        "Every Declared Codomain Fiber and Missing Target"
      ],
      "verification_warning": "This is a candidate exercise. Mechanical recomputation checks only the stated conditions and this instance; it is neither a formal proof nor human review."
    }
  },
  "givens": [
    {
      "id": "G001",
      "text": {
        "zh-Hant": "Fin型別從0起，完整總表；Fin(5)=[0, 1, 2, 3, 4]→Fin(3)=[0, 1, 2]，images=[2, 0, 0, 0, 1]。求 (原images, 按陪域0到m−1的全部纖維, 缺目標, 滿射資格)。空陪域的纖維列為空。",
        "en": "Finite types start at 0: Fin(5)={0,…,4}→Fin(3), complete images=[2, 0, 0, 0, 1]. Check the whole original total table before any candidate evaluation; empty-function properties depend on the declared codomain. Give (original images, all fibers in codomain order 0,…,m−1, missing targets, surjectivity eligibility). An empty codomain has an empty fiber list."
      }
    }
  ],
  "steps": [
    {
      "id": "S001",
      "uses": [
        "G001"
      ],
      "before": "n=5;m=3;images=[2, 0, 0, 0, 1]",
      "after": "all original inputs and outputs form a typed total table;labels start at0",
      "relation": "implies",
      "rule_id": "finite_surjection_typed_scope",
      "conditions": [],
      "explanation": {
        "zh-Hant": "先核整個原表為Fin(n)到Fin(m)的總函數，包含不會被候選查詢的格；目標資格通過後才談其原像與滿射。",
        "en": "First validate the entire original table as a total function from Fin(n) to Fin(m),including cells not used by a query.Only then evaluate preimages for eligible targets and surjectivity."
      },
      "reverse_audit": {
        "kind": "premise_and_result_audit",
        "explanation": {
          "zh-Hant": "回到原始資料與本步條件核對，不把單向推論誤稱等價。",
          "en": "Check against the original data and this step's premises; a one-way implication is not an equivalence."
        }
      },
      "arithmetic": null
    },
    {
      "id": "S002",
      "uses": [
        "G001",
        "S001"
      ],
      "before": "phase=original;target=0;source labels=[0, 1, 2, 3, 4];images on labels=[2, 0, 0, 0, 1]",
      "after": "fiber=[1, 2, 3];missing=否",
      "relation": "implies",
      "rule_id": "surjection_complete_target_fiber",
      "conditions": [],
      "explanation": {
        "zh-Hant": "對這個已合型目標掃描全部保留原輸入，列出所有原像而不是只找第一個；沒有原像才是缺目標。",
        "en": "For this eligible target scan every retained original input and list all preimages,not only the first.A target is missing exactly when its fiber is empty."
      },
      "reverse_audit": {
        "kind": "premise_and_result_audit",
        "explanation": {
          "zh-Hant": "回到原始資料與本步條件核對，不把單向推論誤稱等價。",
          "en": "Check against the original data and this step's premises; a one-way implication is not an equivalence."
        }
      },
      "arithmetic": null
    },
    {
      "id": "S003",
      "uses": [
        "G001",
        "S002"
      ],
      "before": "phase=original;target=1;source labels=[0, 1, 2, 3, 4];images on labels=[2, 0, 0, 0, 1]",
      "after": "fiber=[4];missing=否",
      "relation": "implies",
      "rule_id": "surjection_complete_target_fiber",
      "conditions": [],
      "explanation": {
        "zh-Hant": "對這個已合型目標掃描全部保留原輸入，列出所有原像而不是只找第一個；沒有原像才是缺目標。",
        "en": "For this eligible target scan every retained original input and list all preimages,not only the first.A target is missing exactly when its fiber is empty."
      },
      "reverse_audit": {
        "kind": "premise_and_result_audit",
        "explanation": {
          "zh-Hant": "回到原始資料與本步條件核對，不把單向推論誤稱等價。",
          "en": "Check against the original data and this step's premises; a one-way implication is not an equivalence."
        }
      },
      "arithmetic": null
    },
    {
      "id": "S004",
      "uses": [
        "G001",
        "S003"
      ],
      "before": "phase=original;target=2;source labels=[0, 1, 2, 3, 4];images on labels=[2, 0, 0, 0, 1]",
      "after": "fiber=[0];missing=否",
      "relation": "implies",
      "rule_id": "surjection_complete_target_fiber",
      "conditions": [],
      "explanation": {
        "zh-Hant": "對這個已合型目標掃描全部保留原輸入，列出所有原像而不是只找第一個；沒有原像才是缺目標。",
        "en": "For this eligible target scan every retained original input and list all preimages,not only the first.A target is missing exactly when its fiber is empty."
      },
      "reverse_audit": {
        "kind": "premise_and_result_audit",
        "explanation": {
          "zh-Hant": "回到原始資料與本步條件核對，不把單向推論誤稱等價。",
          "en": "Check against the original data and this step's premises; a one-way implication is not an equivalence."
        }
      },
      "arithmetic": null
    },
    {
      "id": "S005",
      "uses": [
        "G001",
        "S004"
      ],
      "before": "phase=original;targets=[0, 1, 2];fibers=[[1, 2, 3], [4], [0]]",
      "after": "missing=[];surjective=是",
      "relation": "implies",
      "rule_id": "surjection_all_declared_targets",
      "conditions": [],
      "explanation": {
        "zh-Hant": "滿射相對於宣告陪域：每個目標都須有原像。空陪域沒有待查目標，條件真；陪域非空且域空則每個目標都缺。",
        "en": "Surjectivity is relative to the declared codomain:every target needs a preimage.An empty codomain has no targets to test and satisfies the condition;an empty domain with a nonempty codomain misses every target."
      },
      "reverse_audit": {
        "kind": "premise_and_result_audit",
        "explanation": {
          "zh-Hant": "回到原始資料與本步條件核對，不把單向推論誤稱等價。",
          "en": "Check against the original data and this step's premises; a one-way implication is not an equivalence."
        }
      },
      "arithmetic": null
    }
  ],
  "math_model": {
    "result": [
      [
        2,
        0,
        0,
        0,
        1
      ],
      [
        [
          1,
          2,
          3
        ],
        [
          4
        ],
        [
          0
        ]
      ],
      [],
      true
    ]
  },
  "conclusion": {
    "canonical_value": "([2, 0, 0, 0, 1], [[1, 2, 3], [4], [0]], [], 是)",
    "explanation": {
      "zh-Hant": "依上列完整代值及條件核對得到原題答案；原題編號、格式與狀態保持不變。",
      "en": "The full substitutions and premise checks give the original answer; source identity,format and status are unchanged."
    }
  },
  "definition_note": {
    "zh-Hant": "沿用原題明示的論域、假設與來源 MKO 定義。本題已完成第二對話數理與中英語義覆核，並由原始參數逐題獨立重算模型、答案與每個算術步驟；原題仍為 candidate。",
    "en": "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."
  },
  "source": {
    "input_commit": "0f7be61e2c22317a4075561dc822c87d881a50db",
    "question_binding": {
      "batch_id": "batch-20261012-advance-20261016-r07-surjective-foundations",
      "batch_path": "public/data/questions/batches/batch-20261012-advance-20261016-r07-surjective-foundations/questions.jsonl",
      "batch_sha256": "2e96f82e444d7357027861ae1bf02bfabdf513a5219df4e4a643472e67389b30",
      "original_line": 6,
      "original_line_sha256": "7094201267c499c4f2c4b9f452b45d3cd7bb626c4731a1530471ae549a6984f7",
      "question_compact_sha256": "3cea3aedc5889dfd55f6d87c9a001e07a757c866c950675920fef47cea54be84",
      "english_row_compact_sha256": "946877efe502f9b2f53e5f3c8fb56671a3d1a29aea81bb4dbb169f2d9c0af379",
      "english_manifest_path": "public/data/i18n/editions/batch-20261012-advance-20261016-r07-surjective-foundations.en.json",
      "english_rows_path": "public/data/i18n/questions/batch-20261012-advance-20261016-r07-surjective-foundations.en.jsonl"
    },
    "mko_bindings": {
      "mko-surjective": {
        "sha256": "9e23f524f4cd5d7a32f8fed322c2a1717b66148676cc519dc1288a1346303feb",
        "english_sha256": "dc93237b8c19a6b091095797c7bb5b1ffc1e339f1c4437a9a8fecc626775520a",
        "original_path": "public/data/mko/surjective.json",
        "english_path": "public/data/i18n/editions/mko-surjective.en.json"
      }
    },
    "selected_manifest_sha256": "5233edba9654a6cffd8b6b2d83c932f82ded15f9c0b7c733bd049943e672acff",
    "selected_part_sha256": "d7860245c70062705fa4858c13821db6ff286678dec63f22464364f5d24cfcc1",
    "original_candidate_sha256": "eeb96995175f6f3ea919874cda9f9c32b3de4f07e75a135a1efdf89b03b76aa1",
    "original_candidate_line_sha256": "eeb96995175f6f3ea919874cda9f9c32b3de4f07e75a135a1efdf89b03b76aa1"
  },
  "historical_source_state": {
    "review_state": {
      "derivation": "candidate_authored_and_locally_checked",
      "source_question_state": "candidate",
      "independent_AI_or_human_review": "NOT_PERFORMED",
      "formalization": "not_formalized",
      "Lean": "NOT_RUN"
    },
    "scope_note": {
      "zh-Hant": "來源綁定教學推導候選；精確核對不等於獨立AI／人工審查或一般形式證明。原題、答案、MKO、公式、AST與歷史不變。",
      "en": "Source-bound pedagogical derivation candidate.Exact checking is not independent AI/human review or general formal proof.Original questions,answers,MKOs,formulas,ASTs and history remain unchanged."
    },
    "label": "Frozen producer metadata; current per-question review is separate below."
  },
  "revision": {
    "id": "review-20261026-005-p15",
    "review_date": "2026-10-26",
    "owner_authorized_reader_publication": true,
    "scope": "One hundred sixty family prototypes and their mathematical/bilingual reasoning variants, stems, boundary statements and every distinct explanation shape were reviewed in a context independent of the producer; parameter substitutions, source bindings, full math models, both answer strings and every arithmetic step were independently reconstructed per question from the original parameters only, with negative controls. This grouped method does not claim a separate literal AI reading of every repeated sentence or an extra AI voter.",
    "review_receipts": {
      "semantic_review_sha256": "23ba8196e85a09c03add0a87f96bec5d67a00dc648d1d68eef89101525b41a77",
      "question_first_witness_sha256": "17d59afc327b7cb8b6e588686d6dc1abbccd384d8ba32b8c046652f96821d705"
    },
    "status": "second_context_reviewed",
    "mathematical_semantics": true,
    "bilingual_semantics": true,
    "steps_reviewed": 5,
    "method": "family_template_semantic_review_plus_independent_per_instance_reconstruction",
    "exact_question_first_check": {
      "model_sha256": "8bc4d08aeb7e31c4b3b87880300bd8134048f9d115a7186efa27d0d64ee4867e",
      "arithmetic_steps": 0
    },
    "uses_answer_as_premise": false,
    "human_review": "NOT_PERFORMED",
    "formalization": "not_formalized",
    "Lean": "NOT_RUN",
    "Canonical_truth_promotion": false,
    "authority": "Owner-authorized reviewed reader publication; original question/candidate states remain historical and unchanged."
  }
}