---
title: "Union of Sets in Combinatorics"
description: "Union of sets combines every distinct element from two or more sets, a core Combinatorics idea for counting outcomes without double-counting."
canonical: "https://fiveable.me/combinatorics/key-terms/union-of-sets"
type: "key-term"
subject: "Combinatorics"
unit: "Unit 1"
---

# Union of Sets in Combinatorics

## Definition

The union of sets, written A ∪ B, is the set of all elements that are in A, in B, or in both. In combinatorics, it shows up whenever you combine groups and count distinct outcomes.

## What It Is

The union of sets in Combinatorics is the operation that collects every distinct element from two or more sets into one set. If an element appears in either set, or in both, it belongs in the union only once. You write it with the symbol ∪, so A ∪ B means all elements in A, in B, or in both.

A good way to picture union is as a merge of categories. If set A is the students who play chess and set B is the students who play soccer, then A ∪ B is everyone who plays chess, soccer, or both. The overlap does not disappear, but it is not counted twice just because it belongs to both groups.

That overlap idea matters a lot in counting. Union is the set version of saying, “count everything in these groups together.” If the groups do not overlap, the count is easy, and you can add the sizes. If they do overlap, you need to account for the shared elements separately, which is where the addition principle starts to connect with intersection and inclusion-exclusion.

Union also behaves in predictable ways. The order does not matter, so A ∪ B = B ∪ A. Grouping does not matter either, so A ∪ (B ∪ C) = (A ∪ B) ∪ C. And if you union any set with the empty set, nothing changes, because there are no new elements to add.

A common mistake is treating union like a simple total count of both sets even when there is overlap. The union itself does not count duplicates. It is the set of unique outcomes you get after combining the groups.

## Why It Matters

Union of sets is the bridge between set notation and counting in Combinatorics. A lot of problems start by splitting a situation into categories, then asking for the total number of outcomes covered by those categories. Union is the notation that says, “take everything from these groups together.”

That shows up immediately in addition principle problems. When two choices do not overlap, the size of the union is just the sum of the sizes. When they do overlap, the union forces you to notice the shared part before you count, which prevents double-counting.

Union also gives you a cleaner way to describe selection problems. Instead of listing every outcome one by one, you can talk about sets of outcomes and combine them with ∪. That makes it easier to organize counting problems, especially when the categories are based on traits, restrictions, or case splits.

Once you get comfortable with union, related ideas like intersection, complement, and disjoint sets start to make more sense. Union tells you what is included. Intersection tells you what is shared. Together, they give you a precise language for sorting outcomes before you count them.

## Connections

### Set

A union is built from sets, so you need to know what counts as an element and how sets are written. When you read A ∪ B, you are combining two collections of outcomes into one collection with no repeats. Union is one of the first operations you use after learning basic set notation.

### Intersection of Sets

Intersection is the overlap inside a union. If two sets share elements, those shared elements belong to both sets, which is exactly why you have to watch for double-counting in union-based counting problems. Union and intersection often appear together in the same addition principle or inclusion-exclusion setup.

### [Disjoint Sets](/combinatorics/key-terms/disjoint-sets)

Disjoint sets have no overlap, so their union is especially easy to count. If A and B are disjoint, then |A ∪ B| = |A| + |B| because there is no shared element to adjust for. Many simple addition principle questions secretly rely on disjoint sets.

### [Selection Problems](/combinatorics/key-terms/selection-problems)

Union often appears when a selection problem is broken into categories. For example, you might count people who satisfy condition A or condition B, which is a union of outcome sets. The trick is deciding whether the categories overlap before you add anything.

## On the AP Exam

A quiz or problem-set question on union usually asks you to combine groups, list outcomes, or count how many outcomes satisfy one condition or another. You might be given two sets and asked to write A ∪ B, or you might get a word problem where the answer depends on outcomes that fall into either category. The main move is to include every distinct element exactly once.

If the problem is numeric, check whether the sets overlap before you count. For disjoint sets, you can add the sizes directly. If the sets overlap, you need to avoid counting the shared part twice, which often leads you toward intersection or an inclusion-exclusion step.

In a written explanation, you may need to name why a union includes a particular element or why two groups together cover all cases. The clearest answers usually say whether the element belongs to the first set, the second set, or both.

## Union of Sets vs Intersection of Sets

Union and intersection are easy to mix up because both use set notation. Union means everything in either set, while intersection means only the elements the sets share. If a problem asks for A ∪ B, include broader coverage; if it asks for A ∩ B, narrow down to the overlap.

## Key Takeaways

- Union of sets combines all distinct elements from the sets you are joining, and each element appears only once.
- In Combinatorics, union is the language of counting outcomes that fall into one group or another.
- If the sets do not overlap, the size of the union is just the sum of the sizes of the sets.
- If the sets do overlap, you have to watch for double-counting and use the overlap carefully.
- Union pairs naturally with intersection, complement, and disjoint sets when you organize counting problems.

## FAQs

### What is Union of Sets in Combinatorics?

Union of sets is the operation that puts every distinct element from two or more sets into one set. In Combinatorics, it shows up when you combine categories of outcomes, like counting things that are in set A or set B. The overlap stays in the union, but it appears only once.

### How do you write the union of two sets?

You write the union of A and B as A ∪ B. That means every element that belongs to A, to B, or to both. The symbol ∪ is the one to recognize on counting problems and set notation questions.

### What is the difference between union and intersection?

Union includes everything in either set, while intersection includes only what the sets have in common. If you are counting with union, you are combining categories. If you are counting with intersection, you are narrowing down to the overlap. That distinction is where a lot of double-counting mistakes come from.

### How do you count the union of two overlapping sets?

You cannot just add the sizes if the sets overlap, because shared elements would be counted twice. Instead, you account for the overlap using intersection. A common setup is to add both set sizes and then subtract the shared part once.

## Related Study Guides

- [1.2 The addition principle (Rule of Sum)](/combinatorics/unit-1/addition-principle-rule-sum/study-guide/7jqxlAecV5u42xj8)

## About This Document

Canonical Fiveable pages are available as Markdown at the same path plus `.md`.

- [llms.txt](https://fiveable.me/llms.txt): index of Fiveable's sections and URL patterns
- [llms-full.txt](https://fiveable.me/llms-full.txt): complete subject and unit listing
- [MCP server](https://fiveable.me/mcp): call Fiveable as tools instead of fetching pages (`https://fiveable.me/api/mcp`)
- [MCP server for AP teachers](https://fiveable.me/mcp/teachers): a teacher's classes, assignments and AP-rubric grading (`https://fiveable.me/api/mcp/teacher`)

## Structured Data

```json
{"@context":"https://schema.org","@graph":[{"@type":"LearningResource","@id":"https://fiveable.me/combinatorics/key-terms/union-of-sets#resource","name":"Union of Sets in Combinatorics","url":"https://fiveable.me/combinatorics/key-terms/union-of-sets","learningResourceType":"Concept explainer","educationalLevel":"AP® / High School","about":{"@id":"https://fiveable.me/combinatorics/key-terms/union-of-sets#term"},"audience":{"@type":"EducationalAudience","educationalRole":"student"},"dateModified":"2026-07-03T02:21:06.614Z","isPartOf":{"@type":"Collection","name":"Combinatorics Key Terms","url":"https://fiveable.me/combinatorics/key-terms"},"author":{"@type":"Organization","@id":"https://fiveable.me/editorial#content-team","name":"Fiveable Content Team","url":"https://fiveable.me/editorial","parentOrganization":{"@id":"https://fiveable.me/#organization"},"member":[{"@type":"Person","name":"Amanda DoAmaral","sameAs":["https://www.linkedin.com/in/adoamaral"]},{"@type":"Person","name":"Becky Bahr","sameAs":["https://www.linkedin.com/in/becky-bahr-b52743132"]}]},"publisher":{"@type":"Organization","name":"Fiveable","url":"https://fiveable.me"}},{"@type":"DefinedTerm","@id":"https://fiveable.me/combinatorics/key-terms/union-of-sets#term","name":"Union of Sets","description":"The union of sets, written A ∪ B, is the set of all elements that are in A, in B, or in both. In combinatorics, it shows up whenever you combine groups and count distinct outcomes.","url":"https://fiveable.me/combinatorics/key-terms/union-of-sets","inDefinedTermSet":{"@type":"DefinedTermSet","name":"Combinatorics Key Terms","url":"https://fiveable.me/combinatorics/key-terms"}},{"@type":"FAQPage","mainEntity":[{"@type":"Question","name":"What is Union of Sets in Combinatorics?","acceptedAnswer":{"@type":"Answer","text":"Union of sets is the operation that puts every distinct element from two or more sets into one set. In Combinatorics, it shows up when you combine categories of outcomes, like counting things that are in set A or set B. The overlap stays in the union, but it appears only once."}},{"@type":"Question","name":"How do you write the union of two sets?","acceptedAnswer":{"@type":"Answer","text":"You write the union of A and B as A ∪ B. That means every element that belongs to A, to B, or to both. The symbol ∪ is the one to recognize on counting problems and set notation questions."}},{"@type":"Question","name":"What is the difference between union and intersection?","acceptedAnswer":{"@type":"Answer","text":"Union includes everything in either set, while intersection includes only what the sets have in common. If you are counting with union, you are combining categories. If you are counting with intersection, you are narrowing down to the overlap. That distinction is where a lot of double-counting mistakes come from."}},{"@type":"Question","name":"How do you count the union of two overlapping sets?","acceptedAnswer":{"@type":"Answer","text":"You cannot just add the sizes if the sets overlap, because shared elements would be counted twice. Instead, you account for the overlap using intersection. A common setup is to add both set sizes and then subtract the shared part once."}}]},{"@type":"BreadcrumbList","itemListElement":[{"@type":"ListItem","position":1,"name":"Combinatorics","item":"https://fiveable.me/combinatorics"},{"@type":"ListItem","position":2,"name":"Key Terms","item":"https://fiveable.me/combinatorics/key-terms"},{"@type":"ListItem","position":3,"name":"Unit 1","item":"https://fiveable.me/combinatorics/unit-1"},{"@type":"ListItem","position":4,"name":"Union of Sets"}]}]}
```