Inclusion
Every member of A must belong to B.
LEARN · EXPLAIN · REVISE
Read the idea, work independently, then explain what changed.
高一必修 第一册(A版).pdf · 1.2 · PDF 14 / printed page 7
Revisit first: Concept of a set
TOPIC 01
Build understanding of basic relations between sets through definitions, contrasting cases and justified applications.
Every member of A must belong to B.
Equality requires inclusion in both directions.
PREDICT → EXPLORE → EXPLAIN → TRANSFER
Lesson question: Before calculating, predict how the conclusion changes when one defining condition in basic relations between sets changes. Record a reason.
Model exploration: predict which displayed result changes with the parameters, check the values, and compare the observation with the lesson question.
U={1,…,7}; A={1,2,3}; B={3,4,5}. Result={3}. 3 belongs to the result.
Explain: Compare two admissible cases and one boundary or invalid case. Explain the observed difference using the stated definition.
Transfer: Construct a new example and a tempting incorrect solution. Repair the solution by naming the missing condition.
Use one hint at a time. A correction explains what changed, not just the final answer.
Working and explanation
BUILD THE REASONING
Apply the element-by-element definition of inclusion.
Calculate or simplify this relation.
The empty set and the full set both count.
The requested value is 8.
Checks and common pitfalls: The empty set and the full set both count.
Think first. Reveal a hint when the class is ready.
Working and explanation
BUILD THE REASONING
Apply the element-by-element definition of inclusion.
Calculate or simplify this relation.
For a nonempty set, the empty set remains a proper subset.
The requested value is 7.
Checks and common pitfalls: For a nonempty set, the empty set remains a proper subset.
Think first. Reveal a hint when the class is ready.
Working and explanation
BUILD THE REASONING
Apply the element-by-element definition of inclusion.
Calculate or simplify this relation.
The two restrictions must both be applied.
The requested value is 3.
Checks and common pitfalls: The two restrictions must both be applied.
Think first. Reveal a hint when the class is ready.
Working and explanation
BUILD THE REASONING
Apply the element-by-element definition of inclusion.
Calculate or simplify this relation.
The empty set and the full set both count.
The requested value is 16.
Checks and common pitfalls: The empty set and the full set both count.
Think first. Reveal a hint when the class is ready.
Working and explanation
BUILD THE REASONING
Apply the element-by-element definition of inclusion.
Calculate or simplify this relation.
For a nonempty set, the empty set remains a proper subset.
The requested value is 15.
Checks and common pitfalls: For a nonempty set, the empty set remains a proper subset.
Think first. Reveal a hint when the class is ready.
Working and explanation
BUILD THE REASONING
Apply the element-by-element definition of inclusion.
Calculate or simplify this relation.
A required element contributes no extra binary choice.
The requested value is 8.
Checks and common pitfalls: A required element contributes no extra binary choice.
Think first. Reveal a hint when the class is ready.
Working and explanation
BUILD THE REASONING
Apply the element-by-element definition of inclusion.
Calculate or simplify this relation.
Membership and inclusion use different types of objects.
Both say that zero belongs to A.
Checks and common pitfalls: Membership and inclusion use different types of objects.
Think first. Reveal a hint when the class is ready.
Working and explanation
BUILD THE REASONING
Apply the element-by-element definition of inclusion.
Calculate or simplify this relation.
The proposed counterexample cannot exist.
No element of the empty set can violate inclusion.
Checks and common pitfalls: The proposed counterexample cannot exist.
Think first. Reveal a hint when the class is ready.
Working and explanation
BUILD THE REASONING
Apply the element-by-element definition of inclusion.
Calculate or simplify this relation.
An arbitrary-element argument proves the inclusion for the whole set.
Every member of A is a member of C.
Checks and common pitfalls: An arbitrary-element argument proves the inclusion for the whole set.
Think first. Reveal a hint when the class is ready.
Working and explanation
BUILD THE REASONING
Apply the element-by-element definition of inclusion.
Calculate or simplify this relation.
The two restrictions must both be applied.
The requested value is 7.
Checks and common pitfalls: The two restrictions must both be applied.
Think first. Reveal a hint when the class is ready.
Working and explanation
BUILD THE REASONING
Apply the element-by-element definition of inclusion.
Calculate or simplify this relation.
The empty set and the full set both count.
The requested value is 32.
Checks and common pitfalls: The empty set and the full set both count.
Think first. Reveal a hint when the class is ready.
Working and explanation
BUILD THE REASONING
Apply the element-by-element definition of inclusion.
Calculate or simplify this relation.
For a nonempty set, the empty set remains a proper subset.
The requested value is 31.
Checks and common pitfalls: For a nonempty set, the empty set remains a proper subset.
Think first. Reveal a hint when the class is ready.
Working and explanation
BUILD THE REASONING
Apply the element-by-element definition of inclusion.
Calculate or simplify this relation.
A required element contributes no extra binary choice.
The requested value is 16.
Checks and common pitfalls: A required element contributes no extra binary choice.
Think first. Reveal a hint when the class is ready.
Review your latest checked answers and explanations. A draft change requires a fresh check. Written work needs your self-assessment or a teacher’s review.
Enable JavaScript for a summary of your local work.