Study guide

1.1 Sets and Set Operations

Gaokao Mathematics Exam

Track your progress as you read

Finished sections get a check mark.

1 Chapter 1: Sets, Logic, and Algebraic Foundations

1.1 Sets and Set Operations 1.2 Propositional Logic and Quantifiers 1.3 Inequalities and Absolute Value Equations

2 Chapter 2: Functions and Fundamental Properties

2.1 Concept, Domain, Range, and Mapping of Functions 2.2 Monotonicity, Parity, and Periodicity of Functions 2.3 Function Graphs, Transformations, and Zeros

3 Chapter 3: Exponential, Logarithmic, and Power Functions

3.1 Exponents and Exponential Functions 3.2 Logarithms and Logarithmic Functions 3.3 Power Functions and Comparative Growth Rates

4 Chapter 4: Complex Numbers and Quadratic Function Views

4.1 Algebraic and Geometric Representations of Complex Numbers 4.2 Complex Number Operations and Equations 4.3 Quadratic Equations and Inequalities from a Function Viewpoint

5 Chapter 5: Trigonometric Functions and Identities

5.1 Angles, Radians, and Unit Circle Definitions 5.2 Trigonometric Identities and Reduction Formulas 5.3 Addition, Subtraction, and Double-Angle Formulas 5.4 Graphs and Properties of Sine, Cosine, and Tangent Functions

6 Chapter 6: Triangles and Trigonometric Applications

6.1 Sine Theorem, Cosine Theorem, and Triangle Area Formulas 6.2 Solving Triangles and Comprehensive Geometric Applications 6.3 Practical Measurement, Optimization, and Trigonometric Modeling

7 Chapter 7: Sequences and Series

7.1 Arithmetic Sequences and Sums 7.2 Geometric Sequences and Sums 7.3 Recurrence Relations and General Term Determination 7.4 Advanced Summation Techniques and Sequence Applications

8 Chapter 8: Plane Vectors

8.1 Vector Concepts, Addition, Subtraction, and Scalar Multiplication 8.2 Coordinate Operations of Vectors 8.3 Dot Products, Angles, Vector Projections, and Geometric Applications

9 Chapter 9: Lines and Circles in Cartesian Coordinates

9.1 Equations of Straight Lines and Positional Relationships 9.2 Standard and General Equations of Circles 9.3 Positional Relationships Between Lines and Circles

10 Chapter 10: Conic Sections: Ellipses

10.1 Standard Equations and Definitions of Ellipses 10.2 Geometric Properties of Ellipses (Vertices, Foci, Eccentricity) 10.3 Intersection of Lines and Ellipses and Chord Problems

11 Chapter 11: Conic Sections: Hyperbolas and Parabolas

11.1 Hyperbola Definitions, Standard Equations, and Asymptotes 11.2 Parabola Definitions, Standard Equations, and Focal Properties 11.3 Unified Properties of Conic Sections and Trajectory Problems

12 Chapter 12: Solid Geometry: Three-Dimensional Figures

12.1 Prisms, Pyramids, Cylinders, Cones, and Spheres 12.2 Three-Dimensional Views and Cross-Sections 12.3 Surface Area and Volume Calculations

13 Chapter 13: Spatial Lines, Planes, and Spatial Vectors

13.1 Positional Relationships of Lines and Planes in Space 13.2 Parallelism and Perpendicularity Proofs in Solid Geometry 13.3 Spatial Coordinates and Spatial Vector Operations 13.4 Using Spatial Vectors to Compute Angles and Distances

14 Chapter 14: Permutations, Combinations, and Binomial Theorem

14.1 Fundamental Counting Principles (Addition and Multiplication Rules) 14.2 Permutations and Combinations 14.3 Binomial Theorem, Expansion Terms, and Coefficients

15 Chapter 15: Probability and Statistics

15.1 Classical Probability and Conditional Probability 15.2 Independent Events and Repeated Bernoulli Trials 15.3 Discrete Random Variables, Probability Distributions, Expectation, and Variance 15.4 Normal Distribution, Statistical Sampling, Correlation, and Regression

16 Chapter 16: Derivatives and Mathematical Modeling

16.1 Limit Concepts and Derivatives of Elementary Functions 16.2 Tangent Lines, Derivatives, Monotonicity, and Extremum Analysis 16.3 Optimization Problems and Curve Sketching with Derivatives 16.4 Real-World Mathematical Modeling and Problem Solving

1.1 Sets and Set Operations

Key Takeaways Explain This Topic AI

Sets are fundamental mathematical structures defined by element determinacy, distinctness, and unorderedness; the empty set ∅ \varnothing ∅ is a subset of every set.

For any finite set with n n n elements, the total number of subsets is 2 n 2^n 2 n , proper subsets is 2 n − 1 2^n - 1 2 n − 1 , and non-empty proper subsets is 2 n − 2 2^n - 2 2 n − 2 .

Set operations (union ∪ \cup ∪ , intersection ∩ \cap ∩ , complement ∁ U \complement_U ∁ U ​ ) satisfy De Morgan's laws: ∁ U ( A ∪ B ) = ( ∁ U A ) ∩ ( ∁ U B ) \complement_U(A \cup B) = (\complement_U A) \cap (\complement_U B) ∁ U ​ ( A ∪ B ) = ( ∁ U ​ A ) ∩ ( ∁ U ​ B ) and ∁ U ( A ∩ B ) = ( ∁ U A ) ∪ ( ∁ U B ) \complement_U(A \cap B) = (\complement_U A) \cup (\complement_U B) ∁ U ​ ( A ∩ B ) = ( ∁ U ​ A ) ∪ ( ∁ U ​ B ) .

In Gaokao problems involving parameters, always evaluate boundary cases where sets may be empty ( A = ∅ A = \varnothing A = ∅ ) when analyzing inclusion conditions ( A ⊆ B A \subseteq B A ⊆ B ).

Last updated: July 2026

1.1 Sets and Set Operations

Set theory serves as the foundational language of modern mathematics and constitutes one of the most reliable scoring sections on the Chinese National Higher Education Entrance Examination (Gaokao). A rigorous understanding of set notation, element properties, set inclusion, and binary operations is essential not only for answering direct set-related problems but also for establishing domains, range restrictions, and solution sets across algebra, calculus, and probability.

1. Fundamentals of Set Theory and Element Properties

A set is a well-defined collection of distinct objects, referred to as elements . We denote sets by capital italic letters ( A , B , C , … A, B, C, \dots A , B , C , … ) and their elements by lowercase italic letters ( a , b , c , … a, b, c, \dots a , b , c , … ). The relation of an element belonging to a set is denoted by a ∈ A a \in A a ∈ A (" a a a belongs to A A A "), while non-membership is written as a ∉ A a \notin A a ∈ / A (" a a a does not belong to A A A ").

Three Core Characteristics of Sets

Every mathematically valid set must strictly satisfy three fundamental properties:

Determinacy (确定性): For any given object x x x and set A A A , it must be unequivocally determinable whether x ∈ A x \in A x ∈ A or x ∉ A x \notin A x ∈ / A . Vague descriptions such as "all tall students" do not form a set, whereas "all students taller than 180 cm" form a valid set.

Distinctness (互异性): All elements within a set must be unique. No element can appear more than once. When solving equations involving parameters in set elements, roots that produce identical elements must be discarded.

Unorderedness (无序性): The order in which elements are listed does not alter the identity of the set. For example, { 1 , 2 , 3 } = { 3 , 1 , 2 } \{1, 2, 3\} = \{3, 1, 2\} { 1 , 2 , 3 } = { 3 , 1 , 2 } .

Standard Number Sets

In Gaokao problems, specific letter symbols represent standard numerical sets:

N \mathbb{N} N : The set of natural numbers (including 0 0 0 , i.e., { 0 , 1 , 2 , 3 , … } \{0, 1, 2, 3, \dots\} { 0 , 1 , 2 , 3 , … } ).

N ∗ \mathbb{N}^* N ∗ or N + \mathbb{N}_+ N + ​ : The set of positive integers ( { 1 , 2 , 3 , … } \{1, 2, 3, \dots\} { 1 , 2 , 3 , … } ).

Z \mathbb{Z} Z : The set of integers ( { … , − 2 , − 1 , 0 , 1 , 2 , … } \{\dots, -2, -1, 0, 1, 2, \dots\} { … , − 2 , − 1 , 0 , 1 , 2 , … } ).

Q \mathbb{Q} Q : The set of rational numbers ( { p q ∣ p ∈ Z , q ∈ N ∗ , gcd ⁡ ( p , q ) = 1 } \{ \frac{p}{q} \mid p \in \mathbb{Z}, q \in \mathbb{N}^*, \gcd(p, q) = 1 \} { q p ​ ∣ p ∈ Z , q ∈ N ∗ , g cd ( p , q ) = 1 } ).

R \mathbb{R} R : The set of real numbers.

C \mathbb{C} C : The set of complex numbers.

Set Representation Methods

Roster Method (列举法): Explicitly listing all elements enclosed in curly braces, appropriate for finite sets or sets with clear discrete patterns, e.g., A = { 2 , 4 , 6 , 8 } A = \{2, 4, 6, 8\} A = { 2 , 4 , 6 , 8 } .

Set-Builder Notation (描述法): Expressed as { x ∈ D ∣ P ( x ) } \{x \in D \mid P(x)\} { x ∈ D ∣ P ( x )} , where x x x is the representative element, D D D is the domain, and P ( x ) P(x) P ( x ) is the defining property or condition satisfied by x x x . For instance, B = { x ∈ R ∣ x 2 − 5 x + 6 = 0 } B = \{x \in \mathbb{R} \mid x^2 - 5x + 6 = 0\} B = { x ∈ R ∣ x 2 − 5 x + 6 = 0 } .

Venn Diagrams (Venn图): Graphical representations using closed planar curves to illustrate sets and their spatial inclusion or overlap relationships.

Loading diagram... Structure of Fundamental Set Operations

  • 2. Set Inclusion, Subsets, and Power Sets
  • Subsets and Set Equality

Subset (子集): A set A A A is a subset of B B B , denoted A ⊆ B A \subseteq B A ⊆ B (or B ⊇ A B \supseteq A B ⊇ A ), if every element of A A A is also an element of B B B . Formally: ∀ x ∈ A ⟹ x ∈ B \forall x \in A \implies x \in B ∀ x ∈ A ⟹ x ∈ B .

Proper Subset (真子集): If A ⊆ B A \subseteq B A ⊆ B and there exists at least one element b ∈ B b \in B b ∈ B such that b ∉ A b \notin A b ∈ / A , then A A A is a proper subset of B B B , written A ⊊ B A \subsetneq B A ⊊ B .

Set Equality (集合相等): Two sets A A A and B B B are equal ( A = B A = B A = B ) if and only if A ⊆ B A \subseteq B A ⊆ B and B ⊆ A B \subseteq A B ⊆ A .

Empty Set (空集): The set containing no elements, denoted ∅ \varnothing ∅ . By convention, the empty set is a subset of every set ( ∅ ⊆ A \varnothing \subseteq A ∅ ⊆ A for any set A A A ), and a proper subset of every non-empty set ( ∅ ⊊ A \varnothing \subsetneq A ∅ ⊊ A for any A ≠ ∅ A \neq \varnothing A  = ∅ ).

Counting Subsets for Finite Sets

If a finite set A A A contains n n n distinct elements ( ∣ A ∣ = n |A| = n ∣ A ∣ = n ):

Total number of subsets of A A A : 2 n 2^n 2 n .

Total number of proper subsets of A A A : 2 n − 1 2^n - 1 2 n − 1 .

Total number of non-empty proper subsets of A A A : 2 n − 2 2^n - 2 2 n − 2 .

3. Operations on Sets: Union, Intersection, and Complement

Let U U U be a reference universal set, with A , B ⊆ U A, B \subseteq U A , B ⊆ U .

1. Intersection (交集)

The intersection of A A A and B B B , denoted A ∩ B A \cap B A ∩ B , is the set of all elements belonging to both A A A and B B B : A ∩ B = { x ∈ U ∣ x ∈ A and x ∈ B } A \cap B = \{x \in U \mid x \in A \text{ and } x \in B\} A ∩ B = { x ∈ U ∣ x ∈ A and x ∈ B }

2. Union (并集)

The union of A A A and B B B , denoted A ∪ B A \cup B A ∪ B , is the set of all elements belonging to A A A , or B B B , or both: A ∪ B = { x ∈ U ∣ x ∈ A or x ∈ B } A \cup B = \{x \in U \mid x \in A \text{ or } x \in B\} A ∪ B = { x ∈ U ∣ x ∈ A or x ∈ B }

3. Complement (补集)

The complement of A A A with respect to U U U , denoted ∁ U A \complement_U A ∁ U ​ A , is the set of all elements in U U U that do not belong to A A A : ∁ U A = { x ∈ U ∣ x ∈ U and x ∉ A } \complement_U A = \{x \in U \mid x \in U \text{ and } x \notin A\} ∁ U ​ A = { x ∈ U ∣ x ∈ U and x ∈ / A }

Fundamental Operational Laws

Commutative Laws: A ∩ B = B ∩ A A \cap B = B \cap A A ∩ B = B ∩ A , A ∪ B = B ∪ A A \cup B = B \cup A A ∪ B = B ∪ A .

Associative Laws: ( A ∩ B ) ∩ C = A ∩ ( B ∩ C ) (A \cap B) \cap C = A \cap (B \cap C) ( A ∩ B ) ∩ C = A ∩ ( B ∩ C ) , ( A ∪ B ) ∪ C = A ∪ ( B ∪ C ) (A \cup B) \cup C = A \cup (B \cup C) ( A ∪ B ) ∪ C = A ∪ ( B ∪ C ) .

Distributive Laws: A ∩ ( B ∪ C ) = ( A ∩ B ) ∪ ( A ∩ C ) A \cap (B \cup C) = (A \cap B) \cup (A \cap C) A ∩ ( B ∪ C ) = ( A ∩ B ) ∪ ( A ∩ C ) , A ∪ ( B ∩ C ) = ( A ∪ B ) ∩ ( A ∪ C ) A \cup (B \cap C) = (A \cup B) \cap (A \cup C) A ∪ ( B ∩ C ) = ( A ∪ B ) ∩ ( A ∪ C ) .

De Morgan's Laws (德·摩根定律): ∁ U ( A ∪ B ) = ( ∁ U A ) ∩ ( ∁ U B ) \complement_U (A \cup B) = (\complement_U A) \cap (\complement_U B) ∁ U ​ ( A ∪ B ) = ( ∁ U ​ A ) ∩ ( ∁ U ​ B ) ∁ U ( A ∩ B ) = ( ∁ U A ) ∪ ( ∁ U B ) \complement_U (A \cap B) = (\complement_U A) \cup (\complement_U B) ∁ U ​ ( A ∩ B ) = ( ∁ U ​ A ) ∪ ( ∁ U ​ B )

Inclusion-Exclusion Principle (容斥原理): For finite sets A A A and B B B , ∣ A ∪ B ∣ = ∣ A ∣ + ∣ B ∣ − ∣ A ∩ B ∣ |A \cup B| = |A| + |B| - |A \cap B| ∣ A ∪ B ∣ = ∣ A ∣ + ∣ B ∣ − ∣ A ∩ B ∣

Critical Boundary Pitfalls in Gaokao Problems

When solving condition problems of the form A ⊆ B A \subseteq B A ⊆ B where A = { x ∣ a x + 1 = 0 } A = \{x \mid ax + 1 = 0\} A = { x ∣ a x + 1 = 0 } or A = { x ∣ a x 2 + b x + c = 0 } A = \{x \mid ax^2 + bx + c = 0\} A = { x ∣ a x 2 + b x + c = 0 } , students frequently forget that A A A may be empty ( ∅ \varnothing ∅ ) . For instance, if a = 0 a = 0 a = 0 in a linear equation, A = ∅ A = \varnothing A = ∅ , which satisfies A ⊆ B A \subseteq B A ⊆ B unconditionally. Always analyze the case A = ∅ A = \varnothing A = ∅ first before proceeding to non-empty subset conditions.

Summary of Set Operations and Algebraic Properties

Operation Symbolic Notation Set-Builder Definition Key Algebraic Property

Intersection A ∩ B A \cap B A ∩ B { x ∣ x ∈ A ∧ x ∈ B } \{x \mid x \in A \land x \in B\} { x ∣ x ∈ A ∧ x ∈ B } A ∩ B ⊆ A , A ∩ A = A A \cap B \subseteq A, A \cap A = A A ∩ B ⊆ A , A ∩ A = A

Union A ∪ B A \cup B A ∪ B { x ∣ x ∈ A ∨ x ∈ B } \{x \mid x \in A \lor x \in B\} { x ∣ x ∈ A ∨ x ∈ B } A ⊆ A ∪ B , A ∪ A = A A \subseteq A \cup B, A \cup A = A A ⊆ A ∪ B , A ∪ A = A

Complement ∁ U A \complement_U A ∁ U ​ A { x ∣ x ∈ U ∧ x ∉ A } \{x \mid x \in U \land x \notin A\} { x ∣ x ∈ U ∧ x ∈ / A } A ∩ ( ∁ U A ) = ∅ , A ∪ ( ∁ U A ) = U A \cap (\complement_U A) = \varnothing, A \cup (\complement_U A) = U A ∩ ( ∁ U ​ A ) = ∅ , A ∪ ( ∁ U ​ A ) = U

De Morgan I ∁ U ( A ∪ B ) \complement_U(A \cup B) ∁ U ​ ( A ∪ B ) ( ∁ U A ) ∩ ( ∁ U B ) (\complement_U A) \cap (\complement_U B) ( ∁ U ​ A ) ∩ ( ∁ U ​ B ) Complement converts Union to Intersection

De Morgan II ∁ U ( A ∩ B ) \complement_U(A \cap B) ∁ U ​ ( A ∩ B ) ( ∁ U A ) ∪ ( ∁ U B ) (\complement_U A) \cup (\complement_U B) ( ∁ U ​ A ) ∪ ( ∁ U ​ B ) Complement converts Intersection to Union

  • 4. Worked Gaokao Exam Examples
  • Worked Example 1: Continuous Interval Set Operations

Problem: Let the universal set U = R U = \mathbb{R} U = R . Given sets A = { x ∈ R ∣ x 2 − 3 x − 4 < 0 } A = \{x \in \mathbb{R} \mid x^2 - 3x - 4 < 0\} A = { x ∈ R ∣ x 2 − 3 x − 4 < 0 } and B = { x ∈ R ∣ log ⁡ 2 ( x − 1 ) ≤ 1 } B = \{x \in \mathbb{R} \mid \log_2(x - 1) \le 1\} B = { x ∈ R ∣ lo g 2 ​ ( x − 1 ) ≤ 1 } . Find:

  • A ∩ B A \cap B A ∩ B
  • ∁ U ( A ∪ B ) \complement_U (A \cup B) ∁ U ​ ( A ∪ B )

Solution:

Step 1: Solve for Set A A A . The inequality x 2 − 3 x − 4 < 0 x^2 - 3x - 4 < 0 x 2 − 3 x − 4 < 0 factorizes as ( x − 4 ) ( x + 1 ) < 0 (x - 4)(x + 1) < 0 ( x − 4 ) ( x + 1 ) < 0 . The roots of the corresponding quadratic equation are x = − 1 x = -1 x = − 1 and x = 4 x = 4 x = 4 . Since the parabola opens upward, the inequality holds between the roots: A = ( − 1 , 4 ) A = (-1, 4) A = ( − 1 , 4 )

Step 2: Solve for Set B B B . For the logarithmic expression log ⁡ 2 ( x − 1 ) \log_2(x - 1) lo g 2 ​ ( x − 1 ) to be defined, the argument must be strictly positive: x − 1 > 0 ⟹ x > 1 x - 1 > 0 \implies x > 1 x − 1 > 0 ⟹ x > 1 .

Next, solve log ⁡ 2 ( x − 1 ) ≤ 1 \log_2(x - 1) \le 1 lo g 2 ​ ( x − 1 ) ≤ 1 . Since the base 2 > 1 2 > 1 2 > 1 , monotonically applying exponentiation yields: x − 1 ≤ 2 1 = 2 ⟹ x ≤ 3 x - 1 \le 2^1 = 2 \implies x \le 3 x − 1 ≤ 2 1 = 2 ⟹ x ≤ 3 Combining the domain restriction x > 1 x > 1 x > 1 and x ≤ 3 x \le 3 x ≤ 3 gives: B = ( 1 , 3 ] B = (1, 3] B = ( 1 , 3 ]

Step 3: Determine A ∩ B A \cap B A ∩ B . Intersecting the intervals A = ( − 1 , 4 ) A = (-1, 4) A = ( − 1 , 4 ) and B = ( 1 , 3 ] B = (1, 3] B = ( 1 , 3 ] on the real line: A ∩ B = ( 1 , 3 ] A \cap B = (1, 3] A ∩ B = ( 1 , 3 ]

Step 4: Determine ∁ U ( A ∪ B ) \complement_U (A \cup B) ∁ U ​ ( A ∪ B ) . First compute the union A ∪ B A \cup B A ∪ B : A ∪ B = ( − 1 , 4 ) ∪ ( 1 , 3 ] = ( − 1 , 4 ) A \cup B = (-1, 4) \cup (1, 3] = (-1, 4) A ∪ B = ( − 1 , 4 ) ∪ ( 1 , 3 ] = ( − 1 , 4 ) The complement in U = R U = \mathbb{R} U = R is the portion of the real line outside ( − 1 , 4 ) (-1, 4) ( − 1 , 4 ) : ∁ U ( A ∪ B ) = ( − ∞ , − 1 ] ∪ [ 4 , + ∞ ) \complement_U (A \cup B) = (-\infty, -1] \cup [4, +\infty) ∁ U ​ ( A ∪ B ) = ( − ∞ , − 1 ] ∪ [ 4 , + ∞ )

Worked Example 2: Parameter Inclusion with Empty Set Boundary Condition

Problem: Given sets A = { x ∈ R ∣ x 2 − 2 x − 3 = 0 } A = \{x \in \mathbb{R} \mid x^2 - 2x - 3 = 0\} A = { x ∈ R ∣ x 2 − 2 x − 3 = 0 } and B = { x ∈ R ∣ a x − 1 = 0 } B = \{x \in \mathbb{R} \mid ax - 1 = 0\} B = { x ∈ R ∣ a x − 1 = 0 } . If B ⊆ A B \subseteq A B ⊆ A , find the set of all possible real values of the parameter a a a .

Solution:

Step 1: Determine set A A A . Solving x 2 − 2 x − 3 = 0 ⟹ ( x − 3 ) ( x + 1 ) = 0 x^2 - 2x - 3 = 0 \implies (x - 3)(x + 1) = 0 x 2 − 2 x − 3 = 0 ⟹ ( x − 3 ) ( x + 1 ) = 0 , we find roots x = 3 x = 3 x = 3 and x = − 1 x = -1 x = − 1 . A = { − 1 , 3 } A = \{-1, 3\} A = { − 1 , 3 }

Step 2: Analyze set B ⊆ A B \subseteq A B ⊆ A by cases.

Case 1: B = ∅ B = \varnothing B = ∅ . If a = 0 a = 0 a = 0 , the equation 0 ⋅ x − 1 = 0 ⟹ − 1 = 0 0 \cdot x - 1 = 0 \implies -1 = 0 0 ⋅ x − 1 = 0 ⟹ − 1 = 0 , which has no real solutions. Thus B = ∅ B = \varnothing B = ∅ . Since ∅ ⊆ A \varnothing \subseteq A ∅ ⊆ A is true for any set A A A , a = 0 a = 0 a = 0 is a valid value.

Case 2: B ≠ ∅ B \neq \varnothing B  = ∅ . If a ≠ 0 a \neq 0 a  = 0 , the equation a x − 1 = 0 ax - 1 = 0 a x − 1 = 0 yields a unique solution x = 1 a x = \frac{1}{a} x = a 1 ​ . Thus B = { 1 a } B = \left\{\frac{1}{a}\right\} B = { a 1 ​ } .

For B ⊆ A B \subseteq A B ⊆ A , the element 1 a \frac{1}{a} a 1 ​ must belong to A = { − 1 , 3 } A = \{-1, 3\} A = { − 1 , 3 } :

1 a = − 1 ⟹ a = − 1 \frac{1}{a} = -1 \implies a = -1 a 1 ​ = − 1 ⟹ a = − 1 .

1 a = 3 ⟹ a = 1 3 \frac{1}{a} = 3 \implies a = \frac{1}{3} a 1 ​ = 3 ⟹ a = 3 1 ​ .

Step 3: Combine all valid cases. Gathering a = 0 a = 0 a = 0 , a = − 1 a = -1 a = − 1 , and a = 1 3 a = \frac{1}{3} a = 3 1 ​ , the set of all real values of a a a is { − 1 , 0 , 1 3 } \left\{-1, 0, \frac{1}{3}\right\} { − 1 , 0 , 3 1 ​ } .