Fields
[15/87%]The collection is a field on .
Let be such that and whenever . Then is a field on .
Every -system that is closed under arbitrary differences is a field.
Let satisfy (F1) and (F2), and suppose that is closed under finite disjoint unions. Then is not necessarily a field.
Suppose that , where is a field on for each . Then is a field on .
The collection consisting of , and all -dimensional rectangles of all forms fails to be a field on .
The collection consisting of and the finite disjoint unions of -dimensional rsc subrectangles of the given -dimensional rsc rectangle is a field on .
An arbitrary intersection of fields on is a field on .
Let be arbitrary, and let . There exists a unique field on with the properties that (i) , and (ii) if is a field with , then . This field is called the [minimal] field [on ] generated by A.
Let be disjoint. What does a typical element in the minimal field generated by look like?
Let be finite, and denote the set of sequences of elements of . For each , write
so that denotes the -th term of for all . For and , let
Let
Then is a field of subsets of . [The sets are called cylinders of rank , and is collection of all cylinders of all ranks.]
Suppose that is a semiring on with . The collection of finite disjoint unions of -sets is a field on . [Compare with Example 3 and Exercise 1.2.7.]
Let . Given , let , where is the usual inverse image of under .
If is a field on , then is a field on .
may not be a field over even if is a field on .
Let be infinite, and let have cardinality . Let denote the minimal field generated by [Exercise 1.2.9]. We will show that .
a. Given a collection , let denote the collection of
-
finite unions of -sets,
-
finite unions of differences of -sets, and
-
finite unions of complements of -sets.
If , then . If , then .
Some books work with a system of sets called an algebra. An algebra on is a nonempty collection of subsets of that satisfies (F2) and (F3).
is an algebra on iff is a ring on with .
is an algebra iff is a field. Thus algebra and field are synonymous. proof. (a: ⟹) Suppose is an algebra. Then, (R1) by assumption. (R2) is -stable follows (F3). (R3) The assumption of and (F2) imply that if , then and . Then
This proves that is closed under difference. (a: ⇐) Suppose is a ring and . To prove is an algebra on , note that (A1) since is a ring. (F2) Let . Because and (R3), we have . This proves that is closed under difference. (F3) -stability follows (R2). (b) We need only to prove that is an field if is an algebra since the reverse direction is trivial.
Suppose is an algebra. We want to show . Since by definition of an algebra, there must exist . Then by (F2), and so by (F3).