Fundamentals of Computing: Mathematical Notation, Sets and Statements

Lesson overview

Read and write the notation used throughout formal computing.

CourseFundamentals of Computing

Topic strandSet theory

Assessment styleDigital exam practice

EvidenceWorked answer plus justification

Starter: make the model explicit

Before reading the worked example, write down the objects involved, the claim being made and the notation you expect to use. This prevents the common error of calculating before modelling.

Learning objectives

Use set membership, subset and equality notation accurately.
Classify statements as true, false, open or ambiguous.
Translate a short computing scenario into set notation.

Learning outcomes

By the end of this lesson, you can use set membership, subset and equality notation accurately.
By the end of this lesson, you can classify statements as true, false, open or ambiguous.
By the end of this lesson, you can translate a short computing scenario into set notation.

Key vocabulary

What this lesson is about

Mathematical notation is a compact language for saying exactly what objects are being discussed. A set is a collection of distinct objects, and a statement is a claim that can be judged true or false once its terms and domain are clear.

This lesson is about reading symbols carefully: braces list set elements, membership says an object belongs to a set, subset notation compares two sets, and equality of sets means both contain exactly the same elements.

Terms, acronyms and named methods

These are the phrases and named techniques used in this lesson. Read this section before the worked example so the notation and examples have a clear meaning.

SetPhrase. A collection of distinct objects, called elements. Sets are useful in computing for modelling collections such as users, records, files or states.

ElementPhrase. One object inside a set. If x is an element of A, write x ∈ A.

StatementPhrase. A claim that has a truth value once its terms and domain are fixed. For example, 'A ⊆ B' is a statement about two sets.

Formal notation and definitions

{a, b, c} denotes a set whose elements are a, b and c. x \in A means x is an element of A. A \subseteq B means \forallx(x \in A \Rightarrow x \in B). A = B means A \subseteq B and B \subseteq A.

How to read the symbols

$x\in A$ The object x is a member, or element, of the set A.

$A\subseteq B$ Every element of A is also an element of B.

$\forall$ For all. The statement must hold for every object in the stated domain.

$\Rightarrow$ Implies. If the statement on the left holds, the statement on the right must hold.

Use the set notation to decide whether a claim is about one object, a whole set, or a relationship between sets. Do not treat {x}, x and x ∈ A as interchangeable.

Degree-level reasoning

At degree level, set notation is not shorthand for a diagram. It is a language for stating exactly which objects are included, excluded or related.

When proving a set identity, use element-chasing: take an arbitrary element x, show the membership condition in one set is equivalent to the membership condition in the other, then conclude equality.

Do not stop at a correct-looking answer. State why the method is valid, whether the result depends on a hidden assumption, and what would count as a counterexample.

Worked formal model

This section shows the model, notation, calculation and interpretation as one worked answer. The notation is part of the reasoning, not decoration.

1. Context and objects

Let U be all registered users and A be users with admin rights. The claim 'every admin is registered' becomes A is a subset of U.

Objects: the universal set U, the admin set A, the active-account set B, and an arbitrary user x.

Model cue: Use a containment diagram: draw U as the outer rectangle, B as a large circle inside U, and A as a smaller circle inside B. This shows A ⊆ B because every object in A is also inside B.

2. Mathematical working

U=\{\text{Ada},\text{Grace},\text{Alan},\text{Tim}\}

A=\{\text{Ada},\text{Grace}\},\quad B=\{\text{Ada},\text{Grace},\text{Alan}\}

A\subseteq B\quad\text{because}\quad \forall x(x\in A\Rightarrow x\in B)

Plain text version

{a, b, c} denotes a set whose elements are a, b and c.
x ∈ A means x is an element of A.
A ⊆ B means ∀x(x ∈ A ⇒ x ∈ B).
A = B means A ⊆ B and B ⊆ A.

Worked use: Let U = {ada, grace, alan, tim}, B = users with an active account, and A = admin users. If every admin account must be active, the formal claim is A ⊆ B. To test the claim, take an arbitrary user x. If x ∈ A, then x has admin rights; by the rule, x also has an active account, so x ∈ B. Therefore A ⊆ B.

3. How to read the working

Read U first as the universal set for the example. Every later set is being discussed inside this boundary.
Read A and B as sets of named users, then check subset notation by testing membership: every element of A must also appear in B.
The quantified statement ∀x(x ∈ A ⇒ x ∈ B) is the formal version of the subset claim A ⊆ B.
A single user in A but not in B would be enough to disprove the subset claim, because the claim is universal.

4. Computing meaning and check

The subset claim is not about one example user. It is a statement about every member of the admin set, so one missing active account would falsify the model.

Now check: Explain why checking only one named admin is not enough to prove A ⊆ B. Then give one counterexample that would disprove the subset claim.

Worked example

From scenario to formal reasoning

Scenario: Let U be all registered users and A be users with admin rights. The claim 'every admin is registered' becomes A is a subset of U.

Method: Use the definitions and notation introduced above, then state what the result means in this computing scenario.

Reveal model answer

Let U = {ada, grace, alan, tim}, B = users with an active account, and A = admin users. If every admin account must be active, the formal claim is A ⊆ B. To test the claim, take an arbitrary user x. If x ∈ A, then x has admin rights; by the rule, x also has an active account, so x ∈ B. Therefore A ⊆ B.

Worked solution structure

How a strong answer should be written

Define: State the domain and the objects under discussion. For this lesson, begin from {a, b, c} denotes a set whose elements are a, b and c.
Apply: Use the relevant definition from set theory; do not rely on the diagram, wording or intuition alone.
Check: Test a boundary case, counterexample candidate or representation limit.
Conclude: Write one sentence that connects the formal result back to the computing scenario.

Common misconception

A common mistake is confusing an element with a set containing that element. The value x and the set {x} are not the same object.

Guided practice

Let U = {Ada, Grace, Alan, Tim}, A = {Ada, Grace} and B = {Ada, Grace, Alan}. Prove A ⊆ B using membership language.
Explain why Ada ∈ A and {Ada} ⊆ A are different claims.
Create one open statement about a user x and one closed statement about a named user.
Give a counterexample that would disprove A ⊆ B if B represented active accounts.

Quick checks

1. What does A ⊆ B mean?

A is one element inside B.Every element of A is also in B.A and B have no elements in common.

2. Which notation says x is an element of A?

A ∈ x{x} = Ax ∈ A

Digital exam practice

Example exam task

Let U = {Ada, Grace, Alan, Tim}, A = {Ada, Grace} be admin users and B = {Ada, Grace, Alan} be active-account users. Prove or disprove A ⊆ B, and explain why checking only Ada is insufficient.

Notation toolkit

x\in A

Means: x is an element of the set A

How to use: Use it when checking whether one named object belongs to a set.

A\subseteq B

Means: every element of A is also in B

How to use: Use it for claims about one set being contained in another.

\forall x\ (P(x)\Rightarrow Q(x))

Means: for every x, P being true forces Q to be true

How to use: Use it to turn a subset claim into a statement about arbitrary elements.

What a good answer is expected to show

A strong answer for this lesson defines the universal set U, the admin set A, the active-account set B, and an arbitrary user x, applies the set theory method with visible working, and finishes by interpreting the result in the computing scenario.

How to solve it

Read U first as the universal set for the example. Every later set is being discussed inside this boundary.
Read A and B as sets of named users, then check subset notation by testing membership: every element of A must also appear in B.
The quantified statement ∀x(x ∈ A ⇒ x ∈ B) is the formal version of the subset claim A ⊆ B.
A single user in A but not in B would be enough to disprove the subset claim, because the claim is universal.

Model answer

Reveal model answer

U=\{\text{Ada},\text{Grace},\text{Alan},\text{Tim}\},\quad A=\{\text{Ada},\text{Grace}\},\quad B=\{\text{Ada},\text{Grace},\text{Alan}\}

A\subseteq B\iff \forall x(x\in A\Rightarrow x\in B)

For U = {Ada, Grace, Alan, Tim}, A = {Ada, Grace} and B = {Ada, Grace, Alan}, every element of A is also an element of B, so A ⊆ B. Checking only Ada is insufficient because A ⊆ B is a universal claim: Grace must also be checked. A single admin in A but not in B would disprove the rule.

Practise next

Let U = {Ada, Grace, Alan, Tim}, A = {Ada, Grace} and B = {Ada, Grace, Alan}. Prove A ⊆ B using membership language.
Explain why Ada ∈ A and {Ada} ⊆ A are different claims.

Self-marking criteria

States the domain U and the two sets.
Uses the definition A ⊆ B iff every x ∈ A is also in B.
Uses either a general membership argument or a specific counterexample.
Distinguishes elements from singleton sets.
Writes a conclusion in account-rule language.

Extension

Change one assumption in the worked scenario and decide whether the same method still applies. If it does not, name the exact point where the reasoning breaks.

Study route

Save one clean worked answer from this lesson. Include the problem statement, notation, working, final answer and a short note explaining the computing meaning of the result.

Next lesson: Set Operations, Subsets, Power Sets and Venn Reasoning.