Symmetric difference A △ B
A △ B is the set of elements in exactly one of A and B: (A \ B) ∪ (B \ A), equivalently (A ∪ B) \ (A ∩ B). It is the set-theoretic exclusive or, and it has unusually good algebra — associative, commutative, with identity ∅ and every set its own inverse, which makes (𝒫(U), △) an abelian group where every element has order 2.
✓ Unlimited questions · marked criterion by criterion · no card needed
Method: how to approach it
The order below is what examiners expect to see, and each step carries its own marks.
- Use whichever definition is easierFor explicit sets, "in exactly one" is fastest. For proofs, (A ∪ B) \ (A ∩ B) often simplifies better.
- Translate to indicators for identities1_{A △ B} = 1_A + 1_B mod 2. Symmetric-difference identities are then just arithmetic mod 2.
- Exploit the group lawsA △ A = ∅ and A △ ∅ = A, so equations like A △ X = B are solved by X = A △ B — cancellation works exactly as in ordinary algebra.
- Chain associativelyA △ B △ C is unambiguous and contains the elements lying in an odd number of the three sets.
Worked example
With A = {1,2,3,4} and B = {3,4,5}, compute A △ B, then solve A △ X = {1, 5} for X.
- A \ B = {1, 2}; B \ A = {5}.
- So A △ B = {1, 2, 5}.
- For the equation, △ both sides by A: A △ A △ X = A △ {1,5}, and A △ A = ∅.
- So X = A △ {1,5} = ({1,2,3,4} \ {1,5}) ∪ ({1,5} \ {1,2,3,4}) = {2,3,4} ∪ {5}.
Answer. A △ B = {1, 2, 5}, and X = {2, 3, 4, 5}.
Where marks get dropped
These are the specific errors that cost credit on symmetric difference a △ b questions — QED's rubric penalises each of them separately.
- Computing A \ B and stopping. The symmetric difference needs both directions.
- Assuming △ distributes over ∪. It does not; the correct distributive law is A ∩ (B △ C) = (A ∩ B) △ (A ∩ C).
- Forgetting that △ is associative and trying to bracket it as though it were subtraction.
Practise this until it is automatic
Unlimited fresh questions
QED generates new symmetric difference a △ b problems on demand at warm-up, exam and challenge level, so you can drill this one skill until it stops costing you marks.
Marked like an examiner
Every answer is scored against a point-by-point rubric with partial credit, so you see exactly which step of the method broke down — not just a tick or a cross.
Answer in real notation
A one-tap symbol palette, a visual equation editor and a truth-table builder — or photograph your handwritten working and QED converts it to LaTeX.
Saved to your library
Every question you generate is kept and re-takeable as a timed exam, and your Sets mastery is tracked so you know when this is exam-ready.
Symmetric difference A △ B — frequently asked questions
Why is symmetric difference like XOR?
Because x ∈ A △ B exactly when the propositions x ∈ A and x ∈ B differ — the truth table of exclusive or. Under indicators it is literally addition mod 2.
Is (𝒫(U), △) really a group?
Yes: △ is associative and commutative, ∅ is the identity, and A △ A = ∅ makes every set its own inverse. It is an elementary abelian 2-group of order 2^|U|.
How is it used in practice?
Diffing and version control conceptually compute symmetric differences of change sets, and error-correcting codes use the same mod-2 structure over bit vectors.
The rest of Sets
Set-builder notation, operations, and set identities. Each subtopic below has its own method, worked example and mark-losing traps.
- 1Set-builder notation & membership
- 2Union, intersection, difference & complement
- 3Subsets & the power set 𝒫(A)
- 4The Cartesian product A × B
- 5Proving set identities
- 6Cardinality & inclusion–exclusion
- 7Indexed families & generalised ⋃ / ⋂
- 8Partitions & disjoint unions
- 9Countable vs uncountable sets
- 10Characteristic (indicator) functions
- 11Venn diagrams & shading regions
- 12Symmetric difference A △ B
- 13Russell’s paradox & naive set theory
Ready to make symmetric difference a △ b exam-proof?
Generate your first questions free — no card, no setup, no personal data stored. Practise until the method is second nature.
Start practising free →