---
title: "Sets and Functions in the Language of Proof"
description: "Set operations, images and preimages, and what injective, surjective and bijective actually require. Proofs at this level are mostly element-chasing arguments in this language."
canonical: https://lightmysky.com/learn/mathematics/sets-and-functions-in-the-language-of-proof-mt_XAcHX_3DVz
source: https://lightmysky.com/learn/mathematics/sets-and-functions-in-the-language-of-proof-mt_XAcHX_3DVz.md
retrieved: 2026-09-12
---

> **Agent view.** This is the Markdown twin of the page, for tools and assistants.
> When to use this site, and the call that answers each job: https://lightmysky.com/agent-instructions.md
> API description (OpenAPI 3.1): https://lightmysky.com/openapi.json · Authentication: https://lightmysky.com/auth.md
> Pricing: https://lightmysky.com/pricing.md · Catalog: https://lightmysky.com/llms.txt · Full catalog: https://lightmysky.com/llms-full.txt
> Every machine-readable file on this domain: https://lightmysky.com/.well-known/ai-catalog.json
> Ask for Markdown with `Accept: text/markdown`, a `.md` address, or `?mode=agent`.

# Sets and Functions in the Language of Proof

Set operations, images and preimages, and what injective, surjective and bijective actually require. Proofs at this level are mostly element-chasing arguments in this language.

Subject: Mathematics · Area: Mathematical Thinking · Ages 18 to 19
Page: https://lightmysky.com/learn/mathematics/sets-and-functions-in-the-language-of-proof-mt_XAcHX_3DVz

## Ready when they can

- Prove a set identity by double inclusion
- Prove a given function is injective or produce a counterexample
- Distinguish the image of a set from the preimage of a set

## Lesson: Proving with sets and functions

Two sets are equal exactly when they hold the same elements. To prove an identity, chase an arbitrary element in both directions. First take any x on the left side and show it lies on the right side. Then take any x on the right side and show it lies on the left side. Union, intersection and complement combine sets the way or, and and not combine statements. Sketch the two circle Venn picture to guess the identity before you write the chase.

**Example.** Take f(x) equal to x squared on the reals. Then f(2) equals 4 and f(minus 2) equals 4, so two different inputs share one output and f is not injective. Now take g(x) equal to 2x plus 3. If g(a) equals g(b) then 2a plus 3 equals 2b plus 3, so 2a equals 2b and a equals b. Equal outputs force equal inputs, so g is injective. A function is surjective when every possible output value is hit, and bijective when it is both injective and surjective.

The image of a set collects the outputs the function produces from that set. With f(x) equal to x squared, the image of the set containing minus 2 and 3 is the set containing 4 and 9. The preimage of a set collects every input whose output lands inside it. The preimage of the set containing 4 is the set containing minus 2 and 2. A preimage can be larger than its target, since both 3 and minus 3 square to 9.

**Tip.** When you meet a new claim, keep one small example on paper and test each definition against it. A composition of two injective functions is injective. Suppose f and g are injective and f(g(a)) equals f(g(b)). The outer function gives g(a) equals g(b), and the inner function gives a equals b. Equal outputs force equal inputs through both layers, so the composition passes the test.

**Recap.** Chase an arbitrary element both ways for equality, test injectivity input by input, and push forward for images while you pull back for preimages.

## Practice

14 questions on this page, each with its working shown.

## Needs first

- [Composite Functions](https://lightmysky.com/learn/mathematics/composite-functions-mt_jqGJHXgYNw)
- [Statements, Quantifiers and Negation](https://lightmysky.com/learn/mathematics/statements-quantifiers-and-negation-mt_S5NvyPxEZ_)

## Opens up

- [Counting with the Product and Sum Rules](https://lightmysky.com/learn/mathematics/counting-with-the-product-and-sum-rules-mt_3NZC5F7RKP)
- [Proof by Induction and Strong Induction](https://lightmysky.com/learn/mathematics/proof-by-induction-and-strong-induction-mt_7lvC02JBOC)
- [Reading a Mathematics Paper](https://lightmysky.com/learn/mathematics/reading-a-mathematics-paper-mt_pTF-HzLWE6)
- [The Relational Model and Relational Algebra](https://lightmysky.com/learn/computing/the-relational-model-and-relational-algebra-mt_unDBd_Ug8T)
- [Countable and Uncountable Sets](https://lightmysky.com/learn/mathematics/countable-and-uncountable-sets-mt_VTHPloNBbJ)
- [Equivalence Relations and Partitions](https://lightmysky.com/learn/mathematics/equivalence-relations-and-partitions-mt_wgEupYwEUF)
