Ma · Mathematics

Prove That A Is a Subset of C If A × B ⊆ B × C

Published By the 9to5Science editorial team

At a glance

  1. 1. Read the inclusion

    Every pair with first entry from A and second entry from B must also belong to B × C.

  2. 2. Use B nonempty

    Fix an element of B; pairing it with any element of A shows that A is contained in B.

  3. 3. Use A nonempty

    Fix an element of A; pairing it with any element of B shows that B is contained in C.

  4. 4. Apply transitivity

    Since A ⊆ B and B ⊆ C, it follows that A ⊆ C.

The inclusion A×B⊆B×CA \times B \subseteq B \times C says that every ordered pair formed from an element of AA and an element of BB is also an ordered pair whose first entry is in BB and whose second entry is in CC. The nonempty-set assumptions let us use those two coordinates to establish two ordinary subset relations.

What the product inclusion tells you

By definition,

A×B={(a,b):a∈A and b∈B}.A \times B = \{(a,b) : a \in A \text{ and } b \in B\}.

Under the standard definition of ordered pairs, (x,y)∈B×C(x,y) \in B \times C means both x∈Bx \in B and y∈Cy \in C. Thus, from the given inclusion, for every a∈Aa \in A and b∈Bb \in B, we know that a∈Ba \in B and b∈Cb \in C.

The key is to use nonemptiness to make each of these statements apply to all elements of a set. A fixed element of BB helps show A⊆BA \subseteq B; a fixed element of AA helps show B⊆CB \subseteq C.

Proof

Since BB is nonempty, choose an element b0∈Bb_0 \in B. Take any a∈Aa \in A. Then (a,b0)∈A×B(a,b_0) \in A \times B. The product inclusion gives (a,b0)∈B×C(a,b_0) \in B \times C, so its first coordinate belongs to BB. Therefore a∈Ba \in B. Since this holds for every a∈Aa \in A,

A⊆B.A \subseteq B.

Next, since AA is nonempty, choose an element a0∈Aa_0 \in A. Take any b∈Bb \in B. Then (a0,b)∈A×B(a_0,b) \in A \times B, and hence (a0,b)∈B×C(a_0,b) \in B \times C. Its second coordinate must belong to CC, so b∈Cb \in C. This holds for every b∈Bb \in B, giving

B⊆C.B \subseteq C.

Subset inclusion is transitive: if every element of AA is in BB, and every element of BB is in CC, then every element of AA is in CC. Consequently,

A⊆C.A \subseteq C.

A concrete example

Let A={1}A = \{1\}, B={1,2}B = \{1,2\}, and C={1,2}C = \{1,2\}. Then

A×B={(1,1),(1,2)},A \times B = \{(1,1),(1,2)\},

while B×CB \times C contains all four pairs (1,1)(1,1), (1,2)(1,2), (2,1)(2,1), and (2,2)(2,2). Thus A×B⊆B×CA \times B \subseteq B \times C, and indeed A⊆CA \subseteq C.

The coordinate argument explains why the inclusion works: the first entries contributed by AA must be in BB, and the second entries contributed by BB must be in CC. In this example, those facts are A⊆BA \subseteq B and B⊆CB \subseteq C.

Common mistakes

  • Reading the coordinates in the wrong order. Membership in B×CB \times C requires the first coordinate to lie in BB and the second to lie in CC. It does not directly say that the first coordinate lies in CC.
  • Trying to conclude A⊆CA \subseteq C from just one pair. One pair only gives information about its two entries. To establish a subset statement, use an arbitrary element of the relevant set and a fixed element from the other nonempty set.
  • Treating nonemptiness as unnecessary. If B=∅B = \varnothing, then A×B=∅A \times B = \varnothing, so the product inclusion holds regardless of whether A⊆CA \subseteq C. For instance, A={1}A=\{1\}, B=∅B=\varnothing, and C=∅C=\varnothing satisfy the product inclusion, but AA is not a subset of CC.

Which assumptions matter?

The stated assumptions that AA and BB are nonempty make the proof work. The assumption that CC is nonempty is not needed: the inclusion itself forces B⊆CB \subseteq C when AA is nonempty. If AA were empty, the desired conclusion A⊆CA \subseteq C would already be true, regardless of BB or CC.

Spotted an error? Send a correction. Read how we write and check articles in our editorial policy.