Finite integer sets A=[-1, 0] and B=[1]; repeated elements count once. The explicit universe is U=[-1, 0, 1], with A,B⊆U. Give (U\(A∪B), (U\A)∩(U\B)), each sorted increasingly.
G001 — Finite integer sets A=[-1, 0] and B=[1]; repeated elements count once. The explicit universe is U=[-1, 0, 1], with A,B⊆U. Give (U\(A∪B), (U\A)∩(U\B)), each sorted increasingly.
Definition and scope
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.
S005 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
S004 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
S003 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
S002 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
S001 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
Result
([], [])
The full substitutions and premise checks give the original answer; source identity,format and status are unchanged.
This question review and source binding
Review date: 2026-10-26
Original questions, answers, step expressions, numeric ASTs and historical records are retained. Source candidate labels remain historical and are not overwritten as formal proof.