This preview shows page 1. Sign up to view the full content.
Unformatted text preview: i , j with 1 ≤ i, j ≤ n , we have either A i ⊆ A j or A j ⊆ A i . Prove that there exists an integer k with 1 ≤ k ≤ n such that A k ⊆ A i for all i with 1 ≤ i ≤ n . ( Hint: Argue by induction on n ≥ 1.) 1...
View Full Document
This note was uploaded on 01/31/2011 for the course MATH 300 taught by Professor Ctw during the Spring '08 term at Rutgers.
- Spring '08