New game
Download
Get Academic Plan
Share game
Integrate it into your platform

You can integrate the game into an LMS compatible with LTI 1.1 or LTI 1.3 such as Canvas, Moodle, or Blackboard. This way, the scores will be automatically saved into the platform’s gradebook.
Download
You have exceeded the maximum number of games you can integrate into Google Classroom with your current Plan.

To integrate as many games as you want in Google Classroom, you need an Academic Plan or a Commercial Plan.

You have exceeded the maximum number of games you can integrate into Microsoft Teams with your current Plan.

To integrate as many games as you want in Microsoft Teams, you need an Academic Plan or a Commercial Plan.

Downloading games is an exclusive feature for users with an Academic Plan or a Commercial Plan.

Get your Academic Plan or your Commercial Plan now and start integrating your games into your LMS, website or blog.

If you wish, you can download a demo game here and test its integration:

%
Anonymous
Anonymous
%
%
%
You have exceeded the maximum number of games you can print with your current Plan.

To print as many games as you want, you need an Academic Plan or a Commercial Plan.

Print your game
Binary Relations II (Lowersixth Science Mathematics)
 

Binary Relations II (Lowersixth Science Mathematics)Online version

True/false on Cartesian products, Venn diagrams, and partial orders.

by YAKILI LMS
1

A × B is commutative for all sets A and B.

2

The intersection of A and B always has more elements than the union of A and B.

3

The diagonal of A × A contains all pairs (a,a) with a in A.

4

A partial order can be visualized by Hasse diagrams.

5

In a Venn diagram with two sets, the overlap region represents elements common to both sets.

6

The universal set in a Venn diagram can be any finite set chosen for the problem.

7

The set A × B is always finite if A and B are finite.

8

A partial order cannot have cycles.

9

The empty set is not a subset of any set.

10

The projection map from A × B to A is always injective.

11

The Cartesian product A × B consists of all ordered pairs (a,b) with a in A and b in B.

12

The intersection of A and B is always equal to A if A is a subset of B.

13

A partial order requires symmetry to be valid.

14

The map that assigns to each pair (a,b) its first component is a surjective function from A × B to A.

15

The empty set is a valid function from the empty domain to any codomain.

16

The relation 'divides' on natural numbers is a partial order.

17

In a poset, every two elements have a greatest lower bound and least upper bound if it is a lattice.

18

Transitivity does not imply antisymmetry in general.

19

The union of A and B contains all elements that are in A or in B or in both.

20

The subset relation ⊆ is a partial order on the power set of a given universal set.

21

The set A × ∅ is the empty set.

22

The empty set is a subset of every set.

23

A poset must be reflexive on its elements.

24

In a Venn diagram, a universal set U contains all elements under consideration.

25

A total order is a partial order with complete comparability.

26

A Cartesian product is non-empty if both A and B are non-empty.

27

The intersection of two sets is a subset of both sets.

28

A Venn diagram with two circles can represent intersection, union, and difference regions.

29

If A = {1,2} and B = {3,4}, then A × B has 4 elements.

30

The order relation ≤ on real numbers is a partial order.

31

The cardinality of A × B equals the product of the cardinalities of A and B.

32

In a Venn diagram, the union region is only outside the circles.

33

The Cartesian product of two sets depends on the elements, not only their sizes.

34

The map that assigns to each pair (a,b) its second component is a surjective function from A × B to B.

35

For any sets A and B, |A × B| = |A| × |B|.

36

A Venn diagram with three sets can illustrate all possible region combinations.

37

A total order cannot be visualized with a Hasse diagram.

38

If A is empty, A × B is empty for any B.

39

For sets A and B, the projection maps from A × B to A and to B are well-defined.

40

The Cartesian product A × B has pairs where the first component comes from A and the second from B.

41

A partial order is a binary relation that is reflexive, antisymmetric, and transitive.

42

The power set of A is ordered by subset inclusion as a poset.

43

The Cartesian product is associative: (A × B) × C is isomorphic to A × (B × C).

44

In a Venn diagram, shading can indicate a complement region as well.

45

In a Venn diagram, the region inside a single circle corresponds to that set.

46

If A and B are non-empty, A ∩ B is always non-empty.

47

A universal relation on a set is the set of all ordered pairs (x,y) with x,y in the set.

48

In a Hasse diagram, edges indicate cover relations in a poset.

49

The complement of a region in a Venn diagram is represented by shading outside the region with respect to the universal set.

50

The subset relation ⊆ is antisymmetric on sets: if A ⊆ B and B ⊆ A then A = B.

Are you sure you want to leave the page?

If you leave the page, you will lose your game progress.