smallest algebra
posted by sxxx123456 .
Let F be a family of subsets of a set X such that empty set is the element of F. A subset A of X belongs to F1 if and only if either A is a subset of F or complement of A is the subset of F. A subset B of X belongs to F2 if and only if B is a finite intersection of sets in F1. A subset C of X belongs to F3 if and only if C is a finite union of sets in F2. Show that F3 is the smallest algebra which contains F.

Why not try and trick one of your other profs to do this for you?

becouse they couldn't help me :(
Respond to this Question
Similar Questions

Math
I was to answer this question: How are the idea of subsets and proper subsets used in counting to identify relationships between whole numbers? 
algebra
How many sets are subsets of set B? List the subsets of set B. Which are proper subsets? 
math
22A #2 Rewrite the following using mathematical symbols: a. P is equal to the set containing a, b, c, and d. b. The set consisting of the elements 1 and 2 is a proper subset of {1, 2, 3, 4} c. The set consisting of the elements 0 … 
algebra
Rewrite the following using mathematical symbols: a) P is equal to the set containing a, b, c, and d. b) The set consisting of the elements 1 and 2 is a proper subset of {1, 2, 3, 4}. c) The set consisting of the elements 0 and 1 is … 
math
Rewrite the following using mathematical symbols: a. Q is equal to the set whose elements are a, b, and c. b. The set containing 1 and 3 only is a proper subset of the set of natural numbers. c. The set containing 1 and 3 only is not … 
Maths
For a set of numbers T, we say that T has distinct subset sums if all distinct subsets of T have distinct sums. How many subsets of {1,2,3,4,5,6,7,8} have distinct subset sums? 
math please helppppppp
For a set of numbers T, we say that T has distinct subset sums if all distinct subsets of T have distinct sums. How many subsets of {1,2,3,4,5,6,7,8} have distinct subset sums? 
MATHS
For a set of numbers T, we say that T has distinct subset sums if all distinct subsets of T have distinct sums. How many subsets of {1,2,3,4,5,6,7,8} have distinct subset sums? 
MATH Help please.....
Let S={1,2,3,…11} and T1,T2…,TN be distinct subsets of S such that Ti∩Tj≤2 for all values i≠j. What is the maximum possible value of N? 
MATH hard problem...HELLPPPPPP
Let S={1,2,3,…11} and T1,T2…,TN be distinct subsets of S such that Ti∩Tj≤2 for all values i≠j. What is the maximum possible value of N?