Chapter 2. Ordinals, well-founded relations.
|
|
- ĒΔανιήλ Κορνάρος
- 6 χρόνια πριν
- Προβολές:
Transcript
1 Chapter 2. Ordinals, well-founded relations Well-founded Relations. We start with some definitions and rapidly reach the notion of a well-ordered set. Definition. For any X and any binary relation < on X, (X, <) is a partially ordered set (p.o. set) if < is a transitive and anti-symmetric relation on X: x Xx x and x X y X z X (x < y & y < z x < z). Let us say that < partially orders X or < is a partial order of X. (X, <) is a linearly ordered set (l.o. set) ou a totally ordered set (t.o. set) if (X, <) is a partially ordered set and x X y X (x < y or x = y or y < x) as well. Definition. Now let < be any binary relation on X. If Y X, then (Y, <) is an initial segment of (X, <) if x X y X (x < y & y Y x Y ). Often we will just say that Y is an initial segment of X when it is clear about which relation < we are talking. (Y, <) is a proper initial segment of (X, <) if Y X as well. For all s X and Y X, we say that s is a successor of Y if s / Y and {y X y < s} Y. And if Y X and y X we say that y is <-minimal in Y if y Y and x X (x < y x / Y ). Theorem. The following conditions are equivalent for any X and any binary relation on X. (1) Each proper initial segment of X has a successor. (2) Each non-empty subset of X has a <-minimal element. (3) The principle of induction on < is true: x X (( y X (y < x φ(y)) ) φ(x) ) x X φ(x). Proof. (2) = (3). Suppose that x X (( y X (y < x φ(y)) ) φ(x) ) but x X φ(x). Then {x X φ(x)} is non-empty and, by (2), has a member, let us say x 0, which is <-minimal. But then we have that y < x 0 φ(y) and hence φ(x), a contradiction. (3) = (2). If Y X and Y does not have a <-minimal element, then we have that x X ( y X(y < x & y / Y )) x / Y. Applying (3), we have that x X x / Y. Thus Y is empty. (2) = (1). If Y is a proper initial segment of X, then X \ Y (= {x X x / Y }) is non-empty, and (2) says that there is a member, let us call it s, that is <-minimal. Hence s is a successor of Y. (1) = (2). For all x, y X let x < y if there are x 0,..., x n 1 X and x < x 0 <... < x n 1 < y. < is the transitive closure of <: it is transitive, < < and if R is a transitive binary relation with < R, then < R. (In order to see that < is transitive take x < y and y < z and suppose that we have this because x < x 0 <... < x n 1 < y and y < y 0 <... < y m 1 < z for some x 0,..., x n 1, y 0,..., y m 1 X. Thus, x < x 0 <... < x n 1 < y < y 0 <... < y m 1 < z, and so x < z. It is clear that x < y = x < y: take n = 0 in the definition of <. And if x < y there are x 0 <... < x n 1 with version 1.1, 12/2/06 1
2 x < x 0 <... < x n 1 < y, so if < R we have x R x 0 R... Rx n 1 Ry, and hence, if R is transitive, we have x R y.) Now suppose that Y X and Y is non-empty. {x X x / Y & y X (y < x y / Y )}, = Z, let us say, is an initial segment and is proper. If s is a successor of Z we have that s Y and s is <-minimal in Y. Definition. A binary relation < on a set X is well-founded if satisfies the conditions (1)-(3) of the above theorem. A well-founded total order is called well-ordered or a well-ordering. (X, <) is then a well-ordered set (a w.o. set). 2.2 Ordinals. Thus, a well-ordered set is a set along which we can count one step at a time. The ordinals are well-ordered sets that will be crucial for us. In fact we will see later that any well-ordered set is isomorphic to some ordinal via an isomorphism which is order-preserving, hence one can say that if we want to count we have to use the ordinals. Definition. An ordinal is a transitive set that is well-ordered by. (Frequently we will write < instead of when we are dealing with ordinals.) Examples. 0, 1, 2, 3,..., ω,... are (the first) ordinals. Exercise: if this is not apparent to you then check it. Proposition. If α is an ordinal and z α, then z is a transitive set and hence is a ordinal as well. Proof. Let us suppose that x y z α. We have to show that x z. But α is transitive, so y α, and thus x α. α is also well-ordered by, hence is a transitive relation on α. Because we have x y and y z, one has x z. Definition. If α is an ordinal define s(α) = α {α}. Proposition. If α is an ordinal, then s(α) is an ordinal as well. Proof. If z y s(α), then either z y α or z y {α}. In the first case z α because is transitive on α, and in the second case z y = α. Hence, in any caso z s(α). Thus s(α) is transitive. And it is clear that s(α) is well-ordered by. Proposition. If x is a set of ordinals, then x is also an ordinal. Proof. It is clear that any intersection of transitive sets is transitive. And if α x, then x α and must be well-ordered by α is well-ordered by. Proposition. If α, β are ordinals and α β, then (a) α is an initial segment of β, and (b) α β = α β. Proof. (a) If γ β, δ α and γ δ (i.e., γ comes before δ in the well-order of β by ), so γ δ α, and thus γ α by the transitivity of on α. (b) If α β, then, by the equivalent of being well-founded, there is a sucessor, let us call it s, of α as a subset of β. Note that s is unique because is a l.o. of β. Also, because is a l.o. of β, γ α implies that γ s, thus α s. On the other hand, S = α {s} is an initial segment of β and, thus, it is transitive and, so, for any γ s( S) we have γ S. Because s / s (by the axiom of foundation), γ s implies γ α and s α. Hence α = s, β. 2
3 2.3. Trichotomy. Theorem. If α and β are ordinals one and exactly one of the following holds: α β or α = β or β < α. Proof. α β = α or α β α and α β α. Similarly α β = β or α β β and α β β, giving four cases for us to consider. (i) α β = α and α β = β. Then α = β. (ii) α β = α and α β β and α β β. Then the last proposition of 2.2 immediately gives that α β. (iii) α β = β and α β α and α β α. Then the last proposition of 2.2 gives that β α. (iv) α β α, β, α β α and α β β. Note that we have already shown that α β is an ordinal. Then the last proposition of 2.2 gives that α β α and that α β β. Henceα β α β, a contradiction! (To the axiom of foundation.) Corollary. For all ordinals α and β, α β or β α. Proof. α β = α β because β is transitive; β α = β α because α is transitive; α = β = α β & β α. Notation. We write α β if α β or α = β. Corollary. The collection of all ordinals is well-ordered by. Proof. It is easy to see that the collection is partially ordered by by the transitivity of ordinals. The trichotomy theorem gives that totally orders the collection. Hence what remains to be shown is that is well-founded on the collection. Suppose that Z is a subset of the collection of all ordinals and Z. Let α Z. Either α is -minimal (when we are finished), or Y = α Z. Y is a non-empty subset of α, hence there is some β Y that is -minimal. But β must be -minimal in Z as well, because if γ β we have that β α and, by the transitity of α, γ α. Hence γ Z. Corollary. The collection of all ordinals is not a set: it is a proper class. Proof. Suppose the collection was a set, x, let us say. Then we would have that x x by the previous corollary and the definition of ordinal. This would contradict the axiom of foundation (again). This corollary is sometimes called the Burali-Forti paradox. As you ve already see, as with Cantor s paradox, this is not in fact a true paradox. Again, as with V, it is convenient to have a name for the (proper) class of all ordinals, and so we write On for this class. Corollary. If x is a set of ordinals, then x is also an ordinal. Proof. It is clear that x is transitive. And because x On, trichotomy gives that totally orders x. So, suppose that = Z x. Take α Z. As in the corollary two ago, either α already is -minimal, or α Z has a member that is -minimal and that is -minimal in Z as well Successors and limits. Let α be an ordinal. There are two things that can happen. 3
4 Either there is a -maximal element of α, i.e., a β α such that γ α γ β. In this case α = {β } {γ γ < β }, = {β } β, = s(β). If there is some β such that α = s(β) we say that α is a successor ordinal. Or there is no -maximal element (at the top) of α, i.e., β α γ α β < γ. In this case α = {β β < α} = {β γ α β γ } = α. If α = α we say that α is a limit ordinal. We must check that if α = s(β), then β = α. Examples. 1, 2, 3,... are successor ordinals. ω is a limit ordinal. (And by our definition, 0 is a limit ordinal as well, albeit that this is a special caso and is typically treated separately.) In general, if x is a set of ordinals, x is the supremum of the ordinals in x, and if x is non-empty, x is the infimum of the ordinals in x, and also the minimal element de x. (This latter is true because we have already seen that x has -minimal member when = x On, α, let us say, and so β x α β i.e., β x α β or α = β, whence α = x.) 2.5. Recursion Theorems. Now we want to define + and. on the ordinals, in a similar manner to that in which we did on the natural numbers. But before we can do this we need to know that we can make definitions using recursion and how to make these defintions. So this section is devoted to that theme. Perhaps at first glance it will seem very technical, but it will be highly useful in the end. Weak recursion theorem. Let X, Y be two sets. Let < be a well-founded relation on X, and let g : X P(Y ) Y be a function. Then there is a unique function f : X Y such that f(x) = g(x, {f(z) z < x}) for all x X. Proof. (Part 1.) We say that φ : Z Y is an attempt if Z is an initial segment of X and φ(x) = g(x, {φ(z) z < x}) for all x Z. If φ 0 : Z 0 Y and φ 1 : Z 1 Y are two attempts, they agree on Z 1 Z 2 : φ 1 Z 1 Z 2 = φ 2 Z 1 Z 2. Because X 1 X 2 is clearly an initial segment of X and if as attempts they do not agree there is some x 0 which is <-minimal in {x Z 1 Z 2 φ 1 (x) φ 2 (x)}. But in that case we have φ 1 (x 0 ) = g(x 0, {φ 0 (x) x < x 0 }) = g(x 0, {φ 1 (x) x < x 0 }) = φ 2 (x), a contradiction! (Part 2.) Now let f = {φ φ is an attempt}, so f(x) = φ(x) if there is an attempt φ with x dom(φ). It is clear that dom(f) = {dom(φ) φ is an attempt} is an initial segment of X, and that f satisfies f(x) = g(x, {f(z) z < x}) for allx dom(f). So all that remains to be shown is that dom(f) = X. But if dom(f) X there is some x 0 that is <-minimal in {x X x / dom(f)}. For such an x define f : dom(f) {x 0 } Y by f(x) = f(x) if x dom(f) and f(x 0 ) = g(x 0, {f(x) x < x 0 }). Then one would clearly have that f is an attempt, but is not a subset of f. contradiction! Hence f : X Y as we want. Now we shall see a stronger recursion theorem which deals with classes. Definition. Let A and B be classes. Thus A B = {(x, y) x A & y B } is a class as well, because if A = {x φ(x, ā)} and B = {x ψ(x, b)} for two formulas φ(x, ā) and ψ(x, b) in LTC, then A B = {z z = {{x}, {x, y }} & φ(x, ā) & φ(y, b)}. Let A be a class. < is a well-founded Relation (note the capital R ) on A if < is a subclass do A A, a A {b A b < a} is a set, and any B with B A has <-minimal elements. Let A, B be classes. G : A B is a Function (note the capital F ) if G is a subclass of A B 4
5 and for each x A there is a unique y B such that (x, y) G. If x A, y B and (x, y) G we shall write (naturally) G(x) = y. (Note that to say that G is a (sub)class means that there is a formula χ(z, c) in LTC such that x G if and only if χ(x, c) is true.) Remember that sets are classes as well and if A and B are sets, then A B is a set, < is a well-founded relation and G is a function, respectively. Strong recursion theorem. Let < be a well-founded Relation on a class A and G : A V V a Function. Then there is a unique Function F : A V such that for all x A we have that F (x) = G(x, {F (y) y < x}). Proof. (Part 1.) The first part is just as in the weak recursion theorem. Define φ to be an attempt if φ : B V, where B is a set that is an initial segment of A and φ(x) = G(x, {φ(y) y < x}). Then any two attempts agree on the intersection of their initial segments. (Part 2.) Let F = {φ φ is an attempt} (that is (x, z) F if there is an attempt φ with φ(x) = z). Note that the last time this was a set, but here we merely have that F P(A V ) and we do not know that F is a set, since it will not be one if A is not. On the other hand we have that F (x) = G(x, {F (y) y < x}) for all x dom(f ). Suppose that dom(f ) A, and choose a 0 that is <-minimal in the set A \ dom(f ). Now we have that b < a 0 φ (φ is an attempt and b dom(φ). By this we can apply the Axiom of Collection which gives that v b < a 0 φ v (φ is an attempt and b dom(f). Hence w = v {φ φ is anattempt} is a set by the Axiom of Comprehension. Clearly f = w is an attempt and we can consider f = f {(a 0, G(a 0, {f(b) b < a 0 }))} which is an attempt but is not a subset do f. Thus, as in the weak recursion theorem we have a contradiction! Hencedom(F ) = A. Why are there differences in the proof from that of the weak recursion theory? Well, in order to imitate that proof you would have to know that G(a 0, {F (a) a < a 0 }) makes sense before defining F = F {(a 0, G(a 0, {F (a) a < a 0 }))}. And in order to know this you would have to know that {F (a) a < a 0 } is a set, which is a consequence of applying Replacement to the set {a a < a 0 }. Hence one sees that it is not possible to avoid the use of Collection or Replacement. I ought to warn that one cannot avoid the use of Collection in the strong recursion theorem even if A is a set if G is not one, and this is also so even if < is a well-order A and rather than just a well-founded relation. 2.6 Comparison theorems. Definition. A function f : (X, < X ) (Y, < Y ) is an isomorphism which preserves order if f is a bijetion between X and Y and x, y X (x < X y f(x) < Y f(y)). Note. If f : (X, < X ) (Y, < Y ) is a function that preserves order f is injective, and so you only need to know that f is also a surjection in order to have that f is an isomorphism. Theorem. For any well-ordered set (X, <) there is a unique ordinal α for which there is an (unique) isomorphism from (X, <) to α which preserves order. Proof. Define, by the (weak) recursion theorem, a function f : X V (On) which satisfies f(x) = {f(y) y < x}. (i) x X f(x) On. If not choose some x 0 which is <-minimal in the set {x X f(x) / On}. Suppose that x X and for all y < x we have that f(y) On. Then f(x) On by the definition of f, and f(x) is well-ordered by. But also, if z y f(x), we have that y = f(v) for some 5
6 v < x. Thus z {f(u) u < v } and there is some u < v < x such that z = f(u). Consequently, z f(x), and f(x) is transitive. Hence f(x) On. So, by the principle of indution on <, we have that x X f(x) On. (ii) im(f) is a set (by the axioms of collection and comprehension or by replacement), and (i) shows that im(f) On, thus im(f) is well-ordered by. Suppose that z y im(f), hence there is some x X such that z y = f(x), and so there is some v X such that v < x and z = f(v). This gives that z im(f) and im(f) On. Finally if g : X β is another isomorphism which preserves order, then f g 1 would be an isomorphism from β to α which preserves the order given by. Thus β = α and f g 1 is equal to the identity function by (the first corollary to) trichotomy. Comparison Theorem. Let (X, < X ) and (Y, < Y ) be two w.o.sets. Then there is an isomorphism that preserves order between one of them and an initial segment of the other. Proof. The previous theorem says that there are α, β On and isomorphisms f : (X, < X ) α and g : (Y, < Y ) β which preserve order. Now we apply trichotomy. If α = β we have that g 1 f is an order-preserving isomorphism between (X, < X ) and (Y, < Y ). If α β we have that g 1 f is an order-presrving isomorphism between (X, < X ) and a proper initial segment of (Y, < Y ) (of which g 1 (α) is a successor). And if β α we have that f 1 g is an isomorphism which preserves order between (Y, < Y ) and a proper initial segment of (X, < X ) (of which f 1 (β) is a successor) The V α hierarchy. Now we can rigorously define (from the axioms) the V α hierarchy. Define, by the strong recursion theorem, a Function V : On V (the collection of all sets) such that V α = {P(V β ) β < α}. Proposition. α V α is transitive. Proof. If not choose α (<-)minimal such that V α not transitive. We have already seen (in the first proposition of 1.5) that P(X) is transitive if X is transitive. So β < α P(V β ) is transitive. But V α = {P(V β ) β < α} is a union of transitive sets and so is also transitive. Proposition. If α β we have that V α V β. Proof. If α = β it is trivial. If α < β, then V α P(V α ), because V α and, so, P(V α ) are transitive, and P(V α ) V β. Corollary. If α is a successor ordinal, then V s(α) = V α+1 = P(V α ). Proof. V s(α) = {P(V β ) β α} = {P(V β ) β α} P(V α ). But V β V α if β < α, and so P(V β ) P(V α ) if β < α. Hence {P(V β ) β α} P(V α ). Corollary. If λ is a limit ordinal then V λ = {V α α < λ}. Proof. {V α α < λ} V λ = {P(V α ) α < λ} = {V s(α) α < λ} {V α α < λ} because s(α) < λ if α < λ. Theorem. The axiom of foundation is equivalent to x α On x V α. Proof. =. If not let x 0 be -minimal such that β On x / V β. So x x 0 β x V β. If we apply the axiom of Collection we have v x x 0 β v x V β. Let u = v On. Then x x 0 β sup(u) x V β, and this gives that x x 0 x V sup(u). It follows that x 0 V sup(u), 6
7 and so that x 0 V s(sup(u)). contradiction! =. Let A be a class with A {V α α On}. Take α minimal such that A V α. Then any a A V α is -minimal in A. Definition. Define a function rk : V V (On) by rk(x) = {s(rk(y)) y x}, using the (strong) recursion theorem. Proposition. (i) x V rk(x) On. (ii) rk(x) = the minimal α such that x V α. (iii) rk(x)+1 = the minimal α such that x V α. Proof. Exercise. (Use induction over (V, ).) 2.8. Transitive closures. For each set define, by recursion over (ω, ), a function t(n, x) such that t(0, x) = x and t(n + 1, x) = t(n, x) t(n, x). At the end, define TC(x) = {t(n, x) n ω }. TC(x) is the transitive closure of x Proposition. For every x, TC(x) is the minimal transitive set z with x z. (That is, if y is transitive and x y, then TC(x) y.) Proof. Let u v TC(x). Then there is some n < ω such that u v t(n, x). So u t(n, x) t(n + 1, x) TC(x). Thus TC(x) is transitive. Let y be transitive x y. We shall show by induction on ω that each t(n, x) y. This is clear when n = 0. Suppose that t(n, x) y. If z t(n + 1, x) we either have z t(n, x), when z y, or z t(n, x). So there is some v t(n, x) such that z v. But if z v t(n, x) y, we have that z y by the transitivity of y. So we have t(n + 1, x) y, and thus TC(x) = t(n, x) y. Proposition. The axiom of foundation for sets (each non-empty set has a -minimal element) implies the axiom of foundation for classes (each non-empty class has a -minimal element). Proof. Let A,, be a class. Let x A. Either x is -minimal (when we are done) or x A. Then TC(x) A. Let y be -minimal in the set TC(x) A. (We know that it is a set by the previous proposition.) We have that y A. Now suppose that z y. Then z / TC(x) A. But z y TC(x) and TC(x) is transitive, so z TC(x). Thus z / A, and we have shown that y is -minimal in the class A Ordinal arithmetic: addition of ordinals. We will use recursion to define addition and mutlipication on On. Definition. Define, for α fixed and β variable, α + β = α {α + γ γ < β } Proposition. Let α, β On. Then α + β On. Proof. If not, let β 0 be minimal with α + β 0 / On. Then for all γ < β 0 we have that α + γ On, so α + β 0 = α {α + γ γ < β 0 } On and, hence, is well-ordered by. Now we will show that α + β 0 is transitive, and so is an element of On, giving a contradiction to the supposition. Let z y α {α + γ γ < β 0 }. Then, either y α, when z α, because α is 7
8 an ordinal, or there is some γ < β such that y = α + γ On, hence, again, z {α + δ δ < γ }. In each case we have that z α + {α + γ γ < β 0 }, giving the desired contradiction. So α + β 0 On. Lemma. α, β, γ, δ On: (i) β < γ = α + β < α + γ; (ii) α δ = α + β δ + β. Proof. (i) If β < γ, then α + β α + γ. (ii) Suppose that the Lemma is false for some pair α and δ, and let β 0 be minimal such that α + β δ + β. Then β < β 0 we have that α + β δ + β and so either α + β = δ + β or α + β < δ + β. In the latter case either there is some γ < β such that α + β = δ + γ, or α + β δ. So α + β 0 = α {α + β β < β 0 } δ {δ + γ γ < β 0 } = δ + β 0. Proposition. (i) α + 0 = α; (ii) α + s(β) = s(α + β); (iii) if λ is a limit ordinal, then α + λ = {α + γ γ < λ}. Proof. (i) Trivial. (ii) α + s(β) = α {α + γ γ < s(β)} = α {α + γ γ < s(β)} = α {α + γ γ < β } {α + β } = (α + β) {α + β } = s(α + β). (iii) if x {α + γ γ < λ} then there is some γ < λ such that x α {α + β β < γ }. Thus x α {α+β β < λ}. But we know that λ = λ = {γ γ < λ}, hence if x α {α+β β < λ} either x α or x = α + β for some β < λ and there is some γ < λ such that β < γ. Hence x {α + γ γ < λ}. Theorem. Let α, β On and let be the anti-lexicografic order on α {0} β {1} defined by (γ, i) (δ, j) if and only if either i < j or i = j and γ < δ. So this order is isomorphic to (α + β, ) Proof. Define a function f : α {0} β {1} α + β by f(γ, 0) = γ and f(δ, 1) = α + δ. It is clear that f is surjective and also that is a total order on dom(f). We shall show that (γ, i) (δ, j) implies f(γ, i) < f(δ, j). If i < j then i = 0 and j = 1, f(γ, i) = γ and f(δ, j) = α + δ, and we have that γ < α α + δ. If i = j = 0, then f(γ, i) = γ and f(δ, j) = δ and we have γ < δ. And if i = j = 1 we have that α + γ < α + δ by the previous lemma. Note. 1 + ω = ω, while ω + 1 = s(ω), so + is non-comutative in general. INSERT Pictures of 1 + ω and ω + 1. Proposition. If x On is a non-empty set then α + x = {α + β β x}. (+ is continuous in the second place/variable.) Proof. If β x then β x, and so β x (α+β α+ x). Hence {α+β β x} α+ x. Let ρ = {α + β β x} If ρ α + x, then either ρ α or there is some γ x such that ρ = α + γ. If ρ α, then β x α + β ρ < α, a contradiction. And if ρ = α + γ with γ x, then there is some β x such that γ < β and so ρ < α + β and ρ < {α + β β x} = ρ, a contradiction again. So, ρ / α + x and we have that ρ = α + x. We can define subtraction as well, but because addition is not commutativity it is not as useful as addition. Definition. α β = {γ β + γ < α}. Alternatively one can define α β by recursion: α β = 0 8
9 if β > α and α β = {α γ γ < β } if β α. Proposition. Let α, β On and β α. Then β + (α β) = α. Proof. β + (α β) = β {β + γ γ < α β } = β {β + γ β + γ < α} α. Suppose that β + (α β) < α. Then (α β) {γ β + γ < α} = α β. A contradiction. So β + (α β) = α. Note. (α β) + β α in general. For example, ω 1 = ω, hence (ω 1) + 1 = s(ω) ω Ordinal aritmetic: multiplication of ordinals. By the recursion theorem define α.β = {α.γ + δ γ < β & δ < α}. Proposition. α, β On (α.β On). Proof. Suppose that α.γ On for each γ < β. So α.γ + δ On for each γ < β by the proposition that ξ + ζ On if ξ, ζ On, and we have that α.β On and hence is well-ordered by. Also, for each γ < β the function f γ : α {α.γ + δ δ < α} given by f γ (δ) = α.γ + δ has f γ α = {α.γ+δ δ < α}, and hence {α.γ+δ δ < α}, A γ let s call it, is a set by Replacement. Let g be the function given by γ A γ for all γ < β. Then g β is again a set and so α.β = {A γ γ < β } is the union g β of a set and is also a set. Finally, if x y α.β, then there is some γ < β and δ < α such that x y = α.γ + δ. Hence either x α.γ or there is some σ < δ such that x = α.γ + σ. In the first case there are some ɛ < γ and τ < α such that x = α.ɛ + τ. So in each case we have that x α.β. Because we now have that β ( γ < β (α.γ On) α.β On), we have that β On α.β On. Lemma. α On (i) 0.α = 0; (ii) 1.α = α; (iii) β, γ On (β < γ) = α.β < α.γ; and (iv) δ β On, (α δ = α.β δ.β). Proof. (i) (iii) are obvious. (iv) Suppose that α, δ On, β On and for all γ < β we have that α.γ δ.γ. Using the lemma about addition from 2.8, we have for all γ < β and all ɛ < α that α.γ + ɛ δ.γ + ɛ. Hence either α.γ + ɛ = δ.γ + ɛ, when α.γ + ɛ δ.β, or α.γ + ɛ δ.γ + ɛ δ.β, and α.γ + ɛ δ.β, by the transitivity of δ.β. In each case we have that α.β δ.β and so α.β δ.β. But this shows that ( γ < β α.β δ.γ) α.β δ.β. Hence, because < is well-founded on the ordinals, β On α.β δ.β. Proposition. (i) α.0 = 0; (ii) α.s(α) = α.β + α; and (iii) if λ On is a limit ordinal, then α.λ = {α.γ γ < λ}. Proof. (i) Trivial. (ii) α.s(β) = {α.γ + δ γ β & δ < α} = {α.γ + δ γ < β & δ < α} {α.β + δ δ < α} = α.β + α. (iii) If λ is a limit ordinal then {α.β β < λ} = {α.γ + δ ( β < λ γ < β) & δ < α} = with this last step because λ is a limit ordinal. {α.γ + δ γ λ & δ < α} = {α.γ + δ γ < λ & δ < α, } Theorem. Let α, β On and let be the anti-lexicographic order on α β, defined by (δ 0, γ 0 ) (δ 1, γ 1 ) if γ 0 < γ 1 or if γ 0 = γ 1 and δ 0 < δ 1. Hence (α β, ) is isomorphic to (α.β, ) via an order-preserving isomorphism. Proof. Define f : α β α.β by f(δ, γ) = α.γ + δ. It is clear that f is a surjection. If (δ 0, γ 0 ) (δ 1, γ 1 ) either γ 0 < γ 1 when α.γ 0 + δ 0 < α.s(γ 0 ) α.γ 1 α.γ 1 + δ 1, or γ 0 = γ 1 and 9
10 δ 0 < δ 1, when α.γ 0 + δ 0 < α.γ 0 + δ 1 by the lemma about addition. Hence, f preserves order, and so is an isomorphism. Note. 2.ω = ω, 3.ω = ω,..., but ω.ω ω. Note also that (ω + 1).ω = ω.ω Theorem. Let α, β On, β > 0. Then there are unique σ, τ with τ < β such that α = β.σ + τ. Proof. Let σ = {γ β.s(γ) α} and τ = α β.σ, = {δ β.σ + δ < α}. Hence α = β.σ + τ. In order to see that τ < β, observe that if not either β = τ, when α = β.σ + β = β.s(σ) or β {δ β.σ + δ < α} and, so, β.σ + β = β.s(σ) < α. So in any case β.s(σ) α and σ σ, a contradiction! Proposition. If x On then α. x = {α.β β x}. (Which means that. is continuous in the second place/variable.) Proof. α. x = {α.γ + δ δ < α & ( β x γ < β)} = {α.γ + δ β x (γ < β & δ < α)} = {α.β β x}. Note. In the previous theorem σ = {γ β.γ α}. Ordinals arithmetic: 2.11 Exponentiation of ordinals. Next we make another definition by recursion and define exponentiation. Definition. Let α, β On. Then α β = {0} {α γ.δ + ɛ γ < β & δ < α & ɛ < α γ }. Proposition. Let α, β On. Then α β On. Lemma. α, β, γ δ On we have (i) α β.α γ = α β+γ ; (ii) (α β ) γ = α β.γ ; (iii) β < γ = α β < α γ ; and (iv) α δ = α β δ β. Proposition. Let α On. (i) α 0 = 1; (ii) α s(β) = α β.α for each β On; and (iii) if λ is a limit ordinal, then α λ = {α γ γ < λ}. The proofs are similar to the proofs of the equivalents for.. You should check these if you desire. Note. n ω n ω = ω, but ω ω ω, when ω.ω ω = ω ω. And if we define ɛ 0 = {ω, ω ω, ω ωω,...}, then ω ɛ 0 = ɛ 0. When you come back to this section later you should remember that all of these facts are for exponentiations of ordinals, that is very different from the theory of cardinal exponentiation that we will see in Chapter (4). 10
Ordinal Arithmetic: Addition, Multiplication, Exponentiation and Limit
Ordinal Arithmetic: Addition, Multiplication, Exponentiation and Limit Ting Zhang Stanford May 11, 2001 Stanford, 5/11/2001 1 Outline Ordinal Classification Ordinal Addition Ordinal Multiplication Ordinal
Διαβάστε περισσότεραChapter 3: Ordinal Numbers
Chapter 3: Ordinal Numbers There are two kinds of number.. Ordinal numbers (0th), st, 2nd, 3rd, 4th, 5th,..., ω, ω +,... ω2, ω2+,... ω 2... answers to the question What position is... in a sequence? What
Διαβάστε περισσότεραORDINAL ARITHMETIC JULIAN J. SCHLÖDER
ORDINAL ARITHMETIC JULIAN J. SCHLÖDER Abstract. We define ordinal arithmetic and show laws of Left- Monotonicity, Associativity, Distributivity, some minor related properties and the Cantor Normal Form.
Διαβάστε περισσότερα2 Composition. Invertible Mappings
Arkansas Tech University MATH 4033: Elementary Modern Algebra Dr. Marcel B. Finan Composition. Invertible Mappings In this section we discuss two procedures for creating new mappings from old ones, namely,
Διαβάστε περισσότεραEvery set of first-order formulas is equivalent to an independent set
Every set of first-order formulas is equivalent to an independent set May 6, 2008 Abstract A set of first-order formulas, whatever the cardinality of the set of symbols, is equivalent to an independent
Διαβάστε περισσότεραEE512: Error Control Coding
EE512: Error Control Coding Solution for Assignment on Finite Fields February 16, 2007 1. (a) Addition and Multiplication tables for GF (5) and GF (7) are shown in Tables 1 and 2. + 0 1 2 3 4 0 0 1 2 3
Διαβάστε περισσότεραFinite Field Problems: Solutions
Finite Field Problems: Solutions 1. Let f = x 2 +1 Z 11 [x] and let F = Z 11 [x]/(f), a field. Let Solution: F =11 2 = 121, so F = 121 1 = 120. The possible orders are the divisors of 120. Solution: The
Διαβάστε περισσότεραHomework 3 Solutions
Homework 3 Solutions Igor Yanovsky (Math 151A TA) Problem 1: Compute the absolute error and relative error in approximations of p by p. (Use calculator!) a) p π, p 22/7; b) p π, p 3.141. Solution: For
Διαβάστε περισσότεραUniform Convergence of Fourier Series Michael Taylor
Uniform Convergence of Fourier Series Michael Taylor Given f L 1 T 1 ), we consider the partial sums of the Fourier series of f: N 1) S N fθ) = ˆfk)e ikθ. k= N A calculation gives the Dirichlet formula
Διαβάστε περισσότερα3.4 SUM AND DIFFERENCE FORMULAS. NOTE: cos(α+β) cos α + cos β cos(α-β) cos α -cos β
3.4 SUM AND DIFFERENCE FORMULAS Page Theorem cos(αβ cos α cos β -sin α cos(α-β cos α cos β sin α NOTE: cos(αβ cos α cos β cos(α-β cos α -cos β Proof of cos(α-β cos α cos β sin α Let s use a unit circle
Διαβάστε περισσότεραA Note on Intuitionistic Fuzzy. Equivalence Relation
International Mathematical Forum, 5, 2010, no. 67, 3301-3307 A Note on Intuitionistic Fuzzy Equivalence Relation D. K. Basnet Dept. of Mathematics, Assam University Silchar-788011, Assam, India dkbasnet@rediffmail.com
Διαβάστε περισσότεραExample Sheet 3 Solutions
Example Sheet 3 Solutions. i Regular Sturm-Liouville. ii Singular Sturm-Liouville mixed boundary conditions. iii Not Sturm-Liouville ODE is not in Sturm-Liouville form. iv Regular Sturm-Liouville note
Διαβάστε περισσότεραω ω ω ω ω ω+2 ω ω+2 + ω ω ω ω+2 + ω ω+1 ω ω+2 2 ω ω ω ω ω ω ω ω+1 ω ω2 ω ω2 + ω ω ω2 + ω ω ω ω2 + ω ω+1 ω ω2 + ω ω+1 + ω ω ω ω2 + ω
0 1 2 3 4 5 6 ω ω + 1 ω + 2 ω + 3 ω + 4 ω2 ω2 + 1 ω2 + 2 ω2 + 3 ω3 ω3 + 1 ω3 + 2 ω4 ω4 + 1 ω5 ω 2 ω 2 + 1 ω 2 + 2 ω 2 + ω ω 2 + ω + 1 ω 2 + ω2 ω 2 2 ω 2 2 + 1 ω 2 2 + ω ω 2 3 ω 3 ω 3 + 1 ω 3 + ω ω 3 +
Διαβάστε περισσότεραConcrete Mathematics Exercises from 30 September 2016
Concrete Mathematics Exercises from 30 September 2016 Silvio Capobianco Exercise 1.7 Let H(n) = J(n + 1) J(n). Equation (1.8) tells us that H(2n) = 2, and H(2n+1) = J(2n+2) J(2n+1) = (2J(n+1) 1) (2J(n)+1)
Διαβάστε περισσότεραProblem Set 3: Solutions
CMPSCI 69GG Applied Information Theory Fall 006 Problem Set 3: Solutions. [Cover and Thomas 7.] a Define the following notation, C I p xx; Y max X; Y C I p xx; Ỹ max I X; Ỹ We would like to show that C
Διαβάστε περισσότεραPhys460.nb Solution for the t-dependent Schrodinger s equation How did we find the solution? (not required)
Phys460.nb 81 ψ n (t) is still the (same) eigenstate of H But for tdependent H. The answer is NO. 5.5.5. Solution for the tdependent Schrodinger s equation If we assume that at time t 0, the electron starts
Διαβάστε περισσότεραC.S. 430 Assignment 6, Sample Solutions
C.S. 430 Assignment 6, Sample Solutions Paul Liu November 15, 2007 Note that these are sample solutions only; in many cases there were many acceptable answers. 1 Reynolds Problem 10.1 1.1 Normal-order
Διαβάστε περισσότεραLecture 2. Soundness and completeness of propositional logic
Lecture 2 Soundness and completeness of propositional logic February 9, 2004 1 Overview Review of natural deduction. Soundness and completeness. Semantics of propositional formulas. Soundness proof. Completeness
Διαβάστε περισσότερα4.6 Autoregressive Moving Average Model ARMA(1,1)
84 CHAPTER 4. STATIONARY TS MODELS 4.6 Autoregressive Moving Average Model ARMA(,) This section is an introduction to a wide class of models ARMA(p,q) which we will consider in more detail later in this
Διαβάστε περισσότεραNowhere-zero flows Let be a digraph, Abelian group. A Γ-circulation in is a mapping : such that, where, and : tail in X, head in
Nowhere-zero flows Let be a digraph, Abelian group. A Γ-circulation in is a mapping : such that, where, and : tail in X, head in : tail in X, head in A nowhere-zero Γ-flow is a Γ-circulation such that
Διαβάστε περισσότεραSection 8.3 Trigonometric Equations
99 Section 8. Trigonometric Equations Objective 1: Solve Equations Involving One Trigonometric Function. In this section and the next, we will exple how to solving equations involving trigonometric functions.
Διαβάστε περισσότεραTHE SECOND ISOMORPHISM THEOREM ON ORDERED SET UNDER ANTIORDERS. Daniel A. Romano
235 Kragujevac J. Math. 30 (2007) 235 242. THE SECOND ISOMORPHISM THEOREM ON ORDERED SET UNDER ANTIORDERS Daniel A. Romano Department of Mathematics and Informatics, Banja Luka University, Mladena Stojanovića
Διαβάστε περισσότεραReminders: linear functions
Reminders: linear functions Let U and V be vector spaces over the same field F. Definition A function f : U V is linear if for every u 1, u 2 U, f (u 1 + u 2 ) = f (u 1 ) + f (u 2 ), and for every u U
Διαβάστε περισσότεραOther Test Constructions: Likelihood Ratio & Bayes Tests
Other Test Constructions: Likelihood Ratio & Bayes Tests Side-Note: So far we have seen a few approaches for creating tests such as Neyman-Pearson Lemma ( most powerful tests of H 0 : θ = θ 0 vs H 1 :
Διαβάστε περισσότερα6.1. Dirac Equation. Hamiltonian. Dirac Eq.
6.1. Dirac Equation Ref: M.Kaku, Quantum Field Theory, Oxford Univ Press (1993) η μν = η μν = diag(1, -1, -1, -1) p 0 = p 0 p = p i = -p i p μ p μ = p 0 p 0 + p i p i = E c 2 - p 2 = (m c) 2 H = c p 2
Διαβάστε περισσότεραTridiagonal matrices. Gérard MEURANT. October, 2008
Tridiagonal matrices Gérard MEURANT October, 2008 1 Similarity 2 Cholesy factorizations 3 Eigenvalues 4 Inverse Similarity Let α 1 ω 1 β 1 α 2 ω 2 T =......... β 2 α 1 ω 1 β 1 α and β i ω i, i = 1,...,
Διαβάστε περισσότεραCRASH COURSE IN PRECALCULUS
CRASH COURSE IN PRECALCULUS Shiah-Sen Wang The graphs are prepared by Chien-Lun Lai Based on : Precalculus: Mathematics for Calculus by J. Stuwart, L. Redin & S. Watson, 6th edition, 01, Brooks/Cole Chapter
Διαβάστε περισσότεραFractional Colorings and Zykov Products of graphs
Fractional Colorings and Zykov Products of graphs Who? Nichole Schimanski When? July 27, 2011 Graphs A graph, G, consists of a vertex set, V (G), and an edge set, E(G). V (G) is any finite set E(G) is
Διαβάστε περισσότεραderivation of the Laplacian from rectangular to spherical coordinates
derivation of the Laplacian from rectangular to spherical coordinates swapnizzle 03-03- :5:43 We begin by recognizing the familiar conversion from rectangular to spherical coordinates (note that φ is used
Διαβάστε περισσότεραLecture 15 - Root System Axiomatics
Lecture 15 - Root System Axiomatics Nov 1, 01 In this lecture we examine root systems from an axiomatic point of view. 1 Reflections If v R n, then it determines a hyperplane, denoted P v, through the
Διαβάστε περισσότεραLecture 2: Dirac notation and a review of linear algebra Read Sakurai chapter 1, Baym chatper 3
Lecture 2: Dirac notation and a review of linear algebra Read Sakurai chapter 1, Baym chatper 3 1 State vector space and the dual space Space of wavefunctions The space of wavefunctions is the set of all
Διαβάστε περισσότεραStatistical Inference I Locally most powerful tests
Statistical Inference I Locally most powerful tests Shirsendu Mukherjee Department of Statistics, Asutosh College, Kolkata, India. shirsendu st@yahoo.co.in So far we have treated the testing of one-sided
Διαβάστε περισσότεραCardinals. Y = n Y n. Define h: X Y by f(x) if x X n X n+1 and n is even h(x) = g
Cardinals 1. Introduction to Cardinals We work in the base theory ZF. The definitions and many (but not all) of the basic theorems do not require AC; we will indicate explicitly when we are using choice.
Διαβάστε περισσότεραMath221: HW# 1 solutions
Math: HW# solutions Andy Royston October, 5 7.5.7, 3 rd Ed. We have a n = b n = a = fxdx = xdx =, x cos nxdx = x sin nx n sin nxdx n = cos nx n = n n, x sin nxdx = x cos nx n + cos nxdx n cos n = + sin
Διαβάστε περισσότεραMINIMAL CLOSED SETS AND MAXIMAL CLOSED SETS
MINIMAL CLOSED SETS AND MAXIMAL CLOSED SETS FUMIE NAKAOKA AND NOBUYUKI ODA Received 20 December 2005; Revised 28 May 2006; Accepted 6 August 2006 Some properties of minimal closed sets and maximal closed
Διαβάστε περισσότεραforms This gives Remark 1. How to remember the above formulas: Substituting these into the equation we obtain with
Week 03: C lassification of S econd- Order L inear Equations In last week s lectures we have illustrated how to obtain the general solutions of first order PDEs using the method of characteristics. We
Διαβάστε περισσότεραSCHOOL OF MATHEMATICAL SCIENCES G11LMA Linear Mathematics Examination Solutions
SCHOOL OF MATHEMATICAL SCIENCES GLMA Linear Mathematics 00- Examination Solutions. (a) i. ( + 5i)( i) = (6 + 5) + (5 )i = + i. Real part is, imaginary part is. (b) ii. + 5i i ( + 5i)( + i) = ( i)( + i)
Διαβάστε περισσότεραCHAPTER 25 SOLVING EQUATIONS BY ITERATIVE METHODS
CHAPTER 5 SOLVING EQUATIONS BY ITERATIVE METHODS EXERCISE 104 Page 8 1. Find the positive root of the equation x + 3x 5 = 0, correct to 3 significant figures, using the method of bisection. Let f(x) =
Διαβάστε περισσότεραMath 446 Homework 3 Solutions. (1). (i): Reverse triangle inequality for metrics: Let (X, d) be a metric space and let x, y, z X.
Math 446 Homework 3 Solutions. (1). (i): Reverse triangle inequalit for metrics: Let (X, d) be a metric space and let x,, z X. Prove that d(x, z) d(, z) d(x, ). (ii): Reverse triangle inequalit for norms:
Διαβάστε περισσότεραThus X is nonempty by supposition. By (i), let x be a minimal element of X. Then let
4. Ordinals July 26, 2011 In this chapter we introduce the ordinals, prove a general recursion theorem, and develop some elementary ordinal arithmetic. A set A is transitive iff x A y x(y A); in other
Διαβάστε περισσότεραHOMEWORK 4 = G. In order to plot the stress versus the stretch we define a normalized stretch:
HOMEWORK 4 Problem a For the fast loading case, we want to derive the relationship between P zz and λ z. We know that the nominal stress is expressed as: P zz = ψ λ z where λ z = λ λ z. Therefore, applying
Διαβάστε περισσότεραSequent Calculi for the Modal µ-calculus over S5. Luca Alberucci, University of Berne. Logic Colloquium Berne, July 4th 2008
Sequent Calculi for the Modal µ-calculus over S5 Luca Alberucci, University of Berne Logic Colloquium Berne, July 4th 2008 Introduction Koz: Axiomatisation for the modal µ-calculus over K Axioms: All classical
Διαβάστε περισσότεραMatrices and Determinants
Matrices and Determinants SUBJECTIVE PROBLEMS: Q 1. For what value of k do the following system of equations possess a non-trivial (i.e., not all zero) solution over the set of rationals Q? x + ky + 3z
Διαβάστε περισσότεραThe Simply Typed Lambda Calculus
Type Inference Instead of writing type annotations, can we use an algorithm to infer what the type annotations should be? That depends on the type system. For simple type systems the answer is yes, and
Διαβάστε περισσότερα2. Let H 1 and H 2 be Hilbert spaces and let T : H 1 H 2 be a bounded linear operator. Prove that [T (H 1 )] = N (T ). (6p)
Uppsala Universitet Matematiska Institutionen Andreas Strömbergsson Prov i matematik Funktionalanalys Kurs: F3B, F4Sy, NVP 2005-03-08 Skrivtid: 9 14 Tillåtna hjälpmedel: Manuella skrivdon, Kreyszigs bok
Διαβάστε περισσότεραSOLVING CUBICS AND QUARTICS BY RADICALS
SOLVING CUBICS AND QUARTICS BY RADICALS The purpose of this handout is to record the classical formulas expressing the roots of degree three and degree four polynomials in terms of radicals. We begin with
Διαβάστε περισσότεραChapter 6: Systems of Linear Differential. be continuous functions on the interval
Chapter 6: Systems of Linear Differential Equations Let a (t), a 2 (t),..., a nn (t), b (t), b 2 (t),..., b n (t) be continuous functions on the interval I. The system of n first-order differential equations
Διαβάστε περισσότεραST5224: Advanced Statistical Theory II
ST5224: Advanced Statistical Theory II 2014/2015: Semester II Tutorial 7 1. Let X be a sample from a population P and consider testing hypotheses H 0 : P = P 0 versus H 1 : P = P 1, where P j is a known
Διαβάστε περισσότεραANSWERSHEET (TOPIC = DIFFERENTIAL CALCULUS) COLLECTION #2. h 0 h h 0 h h 0 ( ) g k = g 0 + g 1 + g g 2009 =?
Teko Classes IITJEE/AIEEE Maths by SUHAAG SIR, Bhopal, Ph (0755) 3 00 000 www.tekoclasses.com ANSWERSHEET (TOPIC DIFFERENTIAL CALCULUS) COLLECTION # Question Type A.Single Correct Type Q. (A) Sol least
Διαβάστε περισσότεραApproximation of distance between locations on earth given by latitude and longitude
Approximation of distance between locations on earth given by latitude and longitude Jan Behrens 2012-12-31 In this paper we shall provide a method to approximate distances between two points on earth
Διαβάστε περισσότεραEcon 2110: Fall 2008 Suggested Solutions to Problem Set 8 questions or comments to Dan Fetter 1
Eon : Fall 8 Suggested Solutions to Problem Set 8 Email questions or omments to Dan Fetter Problem. Let X be a salar with density f(x, θ) (θx + θ) [ x ] with θ. (a) Find the most powerful level α test
Διαβάστε περισσότεραBounding Nonsplitting Enumeration Degrees
Bounding Nonsplitting Enumeration Degrees Thomas F. Kent Andrea Sorbi Università degli Studi di Siena Italia July 18, 2007 Goal: Introduce a form of Σ 0 2-permitting for the enumeration degrees. Till now,
Διαβάστε περισσότεραDIRECT PRODUCT AND WREATH PRODUCT OF TRANSFORMATION SEMIGROUPS
GANIT J. Bangladesh Math. oc. IN 606-694) 0) -7 DIRECT PRODUCT AND WREATH PRODUCT OF TRANFORMATION EMIGROUP ubrata Majumdar, * Kalyan Kumar Dey and Mohd. Altab Hossain Department of Mathematics University
Διαβάστε περισσότερα6.3 Forecasting ARMA processes
122 CHAPTER 6. ARMA MODELS 6.3 Forecasting ARMA processes The purpose of forecasting is to predict future values of a TS based on the data collected to the present. In this section we will discuss a linear
Διαβάστε περισσότεραCongruence Classes of Invertible Matrices of Order 3 over F 2
International Journal of Algebra, Vol. 8, 24, no. 5, 239-246 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/.2988/ija.24.422 Congruence Classes of Invertible Matrices of Order 3 over F 2 Ligong An and
Διαβάστε περισσότεραF A S C I C U L I M A T H E M A T I C I
F A S C I C U L I M A T H E M A T I C I Nr 46 2011 C. Carpintero, N. Rajesh and E. Rosas ON A CLASS OF (γ, γ )-PREOPEN SETS IN A TOPOLOGICAL SPACE Abstract. In this paper we have introduced the concept
Διαβάστε περισσότερα5. Choice under Uncertainty
5. Choice under Uncertainty Daisuke Oyama Microeconomics I May 23, 2018 Formulations von Neumann-Morgenstern (1944/1947) X: Set of prizes Π: Set of probability distributions on X : Preference relation
Διαβάστε περισσότεραThe challenges of non-stable predicates
The challenges of non-stable predicates Consider a non-stable predicate Φ encoding, say, a safety property. We want to determine whether Φ holds for our program. The challenges of non-stable predicates
Διαβάστε περισσότεραHomomorphism in Intuitionistic Fuzzy Automata
International Journal of Fuzzy Mathematics Systems. ISSN 2248-9940 Volume 3, Number 1 (2013), pp. 39-45 Research India Publications http://www.ripublication.com/ijfms.htm Homomorphism in Intuitionistic
Διαβάστε περισσότεραSecond Order Partial Differential Equations
Chapter 7 Second Order Partial Differential Equations 7.1 Introduction A second order linear PDE in two independent variables (x, y Ω can be written as A(x, y u x + B(x, y u xy + C(x, y u u u + D(x, y
Διαβάστε περισσότεραHomework 8 Model Solution Section
MATH 004 Homework Solution Homework 8 Model Solution Section 14.5 14.6. 14.5. Use the Chain Rule to find dz where z cosx + 4y), x 5t 4, y 1 t. dz dx + dy y sinx + 4y)0t + 4) sinx + 4y) 1t ) 0t + 4t ) sinx
Διαβάστε περισσότεραSOME PROPERTIES OF FUZZY REAL NUMBERS
Sahand Communications in Mathematical Analysis (SCMA) Vol. 3 No. 1 (2016), 21-27 http://scma.maragheh.ac.ir SOME PROPERTIES OF FUZZY REAL NUMBERS BAYAZ DARABY 1 AND JAVAD JAFARI 2 Abstract. In the mathematical
Διαβάστε περισσότεραIntuitionistic Fuzzy Ideals of Near Rings
International Mathematical Forum, Vol. 7, 202, no. 6, 769-776 Intuitionistic Fuzzy Ideals of Near Rings P. K. Sharma P.G. Department of Mathematics D.A.V. College Jalandhar city, Punjab, India pksharma@davjalandhar.com
Διαβάστε περισσότεραb. Use the parametrization from (a) to compute the area of S a as S a ds. Be sure to substitute for ds!
MTH U341 urface Integrals, tokes theorem, the divergence theorem To be turned in Wed., Dec. 1. 1. Let be the sphere of radius a, x 2 + y 2 + z 2 a 2. a. Use spherical coordinates (with ρ a) to parametrize.
Διαβάστε περισσότεραk A = [k, k]( )[a 1, a 2 ] = [ka 1,ka 2 ] 4For the division of two intervals of confidence in R +
Chapter 3. Fuzzy Arithmetic 3- Fuzzy arithmetic: ~Addition(+) and subtraction (-): Let A = [a and B = [b, b in R If x [a and y [b, b than x+y [a +b +b Symbolically,we write A(+)B = [a (+)[b, b = [a +b
Διαβάστε περισσότεραOverview. Transition Semantics. Configurations and the transition relation. Executions and computation
Overview Transition Semantics Configurations and the transition relation Executions and computation Inference rules for small-step structural operational semantics for the simple imperative language Transition
Διαβάστε περισσότεραInverse trigonometric functions & General Solution of Trigonometric Equations. ------------------ ----------------------------- -----------------
Inverse trigonometric functions & General Solution of Trigonometric Equations. 1. Sin ( ) = a) b) c) d) Ans b. Solution : Method 1. Ans a: 17 > 1 a) is rejected. w.k.t Sin ( sin ) = d is rejected. If sin
Διαβάστε περισσότεραSection 7.6 Double and Half Angle Formulas
09 Section 7. Double and Half Angle Fmulas To derive the double-angles fmulas, we will use the sum of two angles fmulas that we developed in the last section. We will let α θ and β θ: cos(θ) cos(θ + θ)
Διαβάστε περισσότερα1. Introduction and Preliminaries.
Faculty of Sciences and Mathematics, University of Niš, Serbia Available at: http://www.pmf.ni.ac.yu/filomat Filomat 22:1 (2008), 97 106 ON δ SETS IN γ SPACES V. Renuka Devi and D. Sivaraj Abstract We
Διαβάστε περισσότεραGenerating Set of the Complete Semigroups of Binary Relations
Applied Mathematics 06 7 98-07 Published Online January 06 in SciRes http://wwwscirporg/journal/am http://dxdoiorg/036/am067009 Generating Set of the Complete Semigroups of Binary Relations Yasha iasamidze
Διαβάστε περισσότεραThe Probabilistic Method - Probabilistic Techniques. Lecture 7: The Janson Inequality
The Probabilistic Method - Probabilistic Techniques Lecture 7: The Janson Inequality Sotiris Nikoletseas Associate Professor Computer Engineering and Informatics Department 2014-2015 Sotiris Nikoletseas,
Διαβάστε περισσότεραSolutions to Exercise Sheet 5
Solutions to Eercise Sheet 5 jacques@ucsd.edu. Let X and Y be random variables with joint pdf f(, y) = 3y( + y) where and y. Determine each of the following probabilities. Solutions. a. P (X ). b. P (X
Διαβάστε περισσότεραΚΥΠΡΙΑΚΗ ΕΤΑΙΡΕΙΑ ΠΛΗΡΟΦΟΡΙΚΗΣ CYPRUS COMPUTER SOCIETY ΠΑΓΚΥΠΡΙΟΣ ΜΑΘΗΤΙΚΟΣ ΔΙΑΓΩΝΙΣΜΟΣ ΠΛΗΡΟΦΟΡΙΚΗΣ 6/5/2006
Οδηγίες: Να απαντηθούν όλες οι ερωτήσεις. Ολοι οι αριθμοί που αναφέρονται σε όλα τα ερωτήματα είναι μικρότεροι το 1000 εκτός αν ορίζεται διαφορετικά στη διατύπωση του προβλήματος. Διάρκεια: 3,5 ώρες Καλή
Διαβάστε περισσότεραAreas and Lengths in Polar Coordinates
Kiryl Tsishchanka Areas and Lengths in Polar Coordinates In this section we develop the formula for the area of a region whose boundary is given by a polar equation. We need to use the formula for the
Διαβάστε περισσότερα12. Radon-Nikodym Theorem
Tutorial 12: Radon-Nikodym Theorem 1 12. Radon-Nikodym Theorem In the following, (Ω, F) is an arbitrary measurable space. Definition 96 Let μ and ν be two (possibly complex) measures on (Ω, F). We say
Διαβάστε περισσότεραLecture 13 - Root Space Decomposition II
Lecture 13 - Root Space Decomposition II October 18, 2012 1 Review First let us recall the situation. Let g be a simple algebra, with maximal toral subalgebra h (which we are calling a CSA, or Cartan Subalgebra).
Διαβάστε περισσότεραΚΥΠΡΙΑΚΗ ΕΤΑΙΡΕΙΑ ΠΛΗΡΟΦΟΡΙΚΗΣ CYPRUS COMPUTER SOCIETY ΠΑΓΚΥΠΡΙΟΣ ΜΑΘΗΤΙΚΟΣ ΔΙΑΓΩΝΙΣΜΟΣ ΠΛΗΡΟΦΟΡΙΚΗΣ 19/5/2007
Οδηγίες: Να απαντηθούν όλες οι ερωτήσεις. Αν κάπου κάνετε κάποιες υποθέσεις να αναφερθούν στη σχετική ερώτηση. Όλα τα αρχεία που αναφέρονται στα προβλήματα βρίσκονται στον ίδιο φάκελο με το εκτελέσιμο
Διαβάστε περισσότεραAreas and Lengths in Polar Coordinates
Kiryl Tsishchanka Areas and Lengths in Polar Coordinates In this section we develop the formula for the area of a region whose boundary is given by a polar equation. We need to use the formula for the
Διαβάστε περισσότεραFourier Series. MATH 211, Calculus II. J. Robert Buchanan. Spring Department of Mathematics
Fourier Series MATH 211, Calculus II J. Robert Buchanan Department of Mathematics Spring 2018 Introduction Not all functions can be represented by Taylor series. f (k) (c) A Taylor series f (x) = (x c)
Διαβάστε περισσότερα( y) Partial Differential Equations
Partial Dierential Equations Linear P.D.Es. contains no owers roducts o the deendent variables / an o its derivatives can occasionall be solved. Consider eamle ( ) a (sometimes written as a ) we can integrate
Διαβάστε περισσότεραΑπόκριση σε Μοναδιαία Ωστική Δύναμη (Unit Impulse) Απόκριση σε Δυνάμεις Αυθαίρετα Μεταβαλλόμενες με το Χρόνο. Απόστολος Σ.
Απόκριση σε Δυνάμεις Αυθαίρετα Μεταβαλλόμενες με το Χρόνο The time integral of a force is referred to as impulse, is determined by and is obtained from: Newton s 2 nd Law of motion states that the action
Διαβάστε περισσότεραLecture 34 Bootstrap confidence intervals
Lecture 34 Bootstrap confidence intervals Confidence Intervals θ: an unknown parameter of interest We want to find limits θ and θ such that Gt = P nˆθ θ t If G 1 1 α is known, then P θ θ = P θ θ = 1 α
Διαβάστε περισσότεραSection 9.2 Polar Equations and Graphs
180 Section 9. Polar Equations and Graphs In this section, we will be graphing polar equations on a polar grid. In the first few examples, we will write the polar equation in rectangular form to help identify
Διαβάστε περισσότεραOn a four-dimensional hyperbolic manifold with finite volume
BULETINUL ACADEMIEI DE ŞTIINŢE A REPUBLICII MOLDOVA. MATEMATICA Numbers 2(72) 3(73), 2013, Pages 80 89 ISSN 1024 7696 On a four-dimensional hyperbolic manifold with finite volume I.S.Gutsul Abstract. In
Διαβάστε περισσότεραDESIGN OF MACHINERY SOLUTION MANUAL h in h 4 0.
DESIGN OF MACHINERY SOLUTION MANUAL -7-1! PROBLEM -7 Statement: Design a double-dwell cam to move a follower from to 25 6, dwell for 12, fall 25 and dwell for the remader The total cycle must take 4 sec
Διαβάστε περισσότεραSome new generalized topologies via hereditary classes. Key Words:hereditary generalized topological space, A κ(h,µ)-sets, κµ -topology.
Bol. Soc. Paran. Mat. (3s.) v. 30 2 (2012): 71 77. c SPM ISSN-2175-1188 on line ISSN-00378712 in press SPM: www.spm.uem.br/bspm doi:10.5269/bspm.v30i2.13793 Some new generalized topologies via hereditary
Διαβάστε περισσότεραPartial Differential Equations in Biology The boundary element method. March 26, 2013
The boundary element method March 26, 203 Introduction and notation The problem: u = f in D R d u = ϕ in Γ D u n = g on Γ N, where D = Γ D Γ N, Γ D Γ N = (possibly, Γ D = [Neumann problem] or Γ N = [Dirichlet
Διαβάστε περισσότεραCommutative Monoids in Intuitionistic Fuzzy Sets
Commutative Monoids in Intuitionistic Fuzzy Sets S K Mala #1, Dr. MM Shanmugapriya *2 1 PhD Scholar in Mathematics, Karpagam University, Coimbatore, Tamilnadu- 641021 Assistant Professor of Mathematics,
Διαβάστε περισσότεραSolutions for exercises in chapter 1 = 2, 3, 1, 4 ; = 2, 2, 3, 4, 2 1 S 1 1 S 0 = 2, 2, 3, 4, 2, 1, 4,1,3. 1, 1,..., 1, S 0
E1.1 Verify that and Solutions for exercises in chapter 1 S 0 S 1 = 2, 3, 1, 4 (S 0 S 1 ) ( S 1 S 0 ) = 2, 2, 3, 4, 2, 1, 4, 1,3. S 0 S 1 = 2 S 0 S 1 = 2 3 1 S 1 = 2, 3, 1, 4 ; (S 0 S 1 ) ( S 1 S 0 ) =
Διαβάστε περισσότεραAbstract Storage Devices
Abstract Storage Devices Robert König Ueli Maurer Stefano Tessaro SOFSEM 2009 January 27, 2009 Outline 1. Motivation: Storage Devices 2. Abstract Storage Devices (ASD s) 3. Reducibility 4. Factoring ASD
Διαβάστε περισσότεραSrednicki Chapter 55
Srednicki Chapter 55 QFT Problems & Solutions A. George August 3, 03 Srednicki 55.. Use equations 55.3-55.0 and A i, A j ] = Π i, Π j ] = 0 (at equal times) to verify equations 55.-55.3. This is our third
Διαβάστε περισσότεραPractice Exam 2. Conceptual Questions. 1. State a Basic identity and then verify it. (a) Identity: Solution: One identity is csc(θ) = 1
Conceptual Questions. State a Basic identity and then verify it. a) Identity: Solution: One identity is cscθ) = sinθ) Practice Exam b) Verification: Solution: Given the point of intersection x, y) of the
Διαβάστε περισσότερα9.09. # 1. Area inside the oval limaçon r = cos θ. To graph, start with θ = 0 so r = 6. Compute dr
9.9 #. Area inside the oval limaçon r = + cos. To graph, start with = so r =. Compute d = sin. Interesting points are where d vanishes, or at =,,, etc. For these values of we compute r:,,, and the values
Διαβάστε περισσότεραCardinal and Ordinal Numbers Math Klaus Kaiser
Cardinal and Ordinal Numbers Math 6300 Klaus Kaiser April 9, 2007 Contents 1 Introduction 2 2 The Zermelo Fraenkel Axioms of Set Theory 5 3 Ordinals 14 3.1 Well-Orderings.........................................
Διαβάστε περισσότεραSolution Series 9. i=1 x i and i=1 x i.
Lecturer: Prof. Dr. Mete SONER Coordinator: Yilin WANG Solution Series 9 Q1. Let α, β >, the p.d.f. of a beta distribution with parameters α and β is { Γ(α+β) Γ(α)Γ(β) f(x α, β) xα 1 (1 x) β 1 for < x
Διαβάστε περισσότεραSpace-Time Symmetries
Chapter Space-Time Symmetries In classical fiel theory any continuous symmetry of the action generates a conserve current by Noether's proceure. If the Lagrangian is not invariant but only shifts by a
Διαβάστε περισσότεραSecond Order RLC Filters
ECEN 60 Circuits/Electronics Spring 007-0-07 P. Mathys Second Order RLC Filters RLC Lowpass Filter A passive RLC lowpass filter (LPF) circuit is shown in the following schematic. R L C v O (t) Using phasor
Διαβάστε περισσότερα( ) 2 and compare to M.
Problems and Solutions for Section 4.2 4.9 through 4.33) 4.9 Calculate the square root of the matrix 3!0 M!0 8 Hint: Let M / 2 a!b ; calculate M / 2!b c ) 2 and compare to M. Solution: Given: 3!0 M!0 8
Διαβάστε περισσότεραw o = R 1 p. (1) R = p =. = 1
Πανεπιστήµιο Κρήτης - Τµήµα Επιστήµης Υπολογιστών ΗΥ-570: Στατιστική Επεξεργασία Σήµατος 205 ιδάσκων : Α. Μουχτάρης Τριτη Σειρά Ασκήσεων Λύσεις Ασκηση 3. 5.2 (a) From the Wiener-Hopf equation we have:
Διαβάστε περισσότεραRight Rear Door. Let's now finish the door hinge saga with the right rear door
Right Rear Door Let's now finish the door hinge saga with the right rear door You may have been already guessed my steps, so there is not much to describe in detail. Old upper one file:///c /Documents
Διαβάστε περισσότερα