ORDINAL ARITHMETIC JULIAN J. SCHLÖDER
|
|
- Φίλιππος Θεοτόκης
- 7 χρόνια πριν
- Προβολές:
Transcript
1 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. 1. Ordinals Definition 1.1. A set x is called transitive iff y x z y : z x. Definition 1.2. A set α is called an ordinal iff α transitive and all β α are transitive. Write α Ord. Lemma 1.3. If α is an ordinal and β α, then β is an ordinal. Proof. β is transitive, since it is in α. Let γ β. By transitivity of α, γ α. Hence γ is transitive. Thus β is an ordinal. Definition 1.4. If a is a set, define a + 1 = a {a}. Remark 1.5. is an ordinal. Write 0 =. If α is an ordinal, so is α + 1. Definition 1.6. If α and β are ordinals, say α < β iff α β. Lemma 1.7. For all ordinals α, α < α + 1. Proof. α {α}, so α α {α} = α + 1. Notation 1.8. From now on, α, β, γ, δ, ε, ζ, η denote ordinals. Theorem 1.9. The ordinals are linearly ordered i.e. i. α : α α (strictness). ii. α β γ : α < β β < γ α < γ (transitivity). iii. α β : α < β β < α α = β (linearity). Proof. i. follows from (Found). ii. follows from transitivity of the ordinals. iii. : Assume this fails. By (Found), choose a minimal α such that some β is neither smaller, larger or equal to α. Choose the minimal such β. Show towards a contradiction that α = β: 1
2 2 JULIAN J. SCHLÖDER Let γ α. By minimality of α, γ < β β < γ β = γ. If β = γ, β < α. If β < γ then by ii. β < α. Thus γ < β, i.e. γ β. Hence α β. Let γ β. By minimality of β, γ < α α < γ α = γ. If α = γ, α < β. If α < γ then by ii α < β. Thus γ < α, i.e. γ α. Hence β α. Lemma If α 0 is an ordinal, 0 < α, i.e. 0 is the smallest ordinal. Proof. Since α 0, by linearity α < 0 or 0 < α, but α < 0 would mean α. Definition An ordinal α is called a successor iff there is a β with α = β + 1. Write α Suc. An ordinal α is called a limit if it is no successor. Write α Lim. Remark By definition, every ordinal is either or a successor or a limit. Lemma For all ordinals α, β: If β < α+1, then β < α β = α, i.e. β α. Proof. Let β < α + 1, i.e. β α {α}. By definition of, β α or β {α}, i.e. β α β = α. Lemma For all ordinals α, β: If β < α, then β + 1 α. Proof. Suppose this fails for some α, β. Then by linearity, β + 1 > α, hence by the previous lemma α β. Hence by transitivity β < α β, contradicting strictness. Lemma For all α, there is no β with α < β < α + 1. Proof. Assume there are such α and β. Then, since β < α + 1, β α, but since α < β, by linearity α < α, contradicting strictness. Lemma For all α, β, if there is no γ with α < γ < β, then β = α + 1. Proof. Suppose β α + 1. Since α < β, α + 1 β, so α + 1 < β. Then α + 1 is some such γ. Lemma The operation +1 : Ord Ord is injective. Proof. Let α β be ordinals. Wlog α < β. Then by the previous lemmas, α + 1 β < β + 1, i.e α + 1 β + 1. Lemma α Lim iff β < α : β + 1 < α and α 0.
3 ORDINAL ARITHMETIC 3 Proof. Let α Lim, β < α. By linearity, β + 1 < α α < β + 1 β + 1 = α. The last case is excluded by definition of limits. So suppose α < β + 1. Then α = β α < β. Since β < α, α = β implies α < α, contradicting strictness. By linearity, α < β implies β < β, contradicting strictness. Thus β + 1 < α. Now suppose α 0 and β < α : β + 1 < α. Assume α Suc. Then there is β such that α = β + 1. Then β < β + 1 = α, thus β < α, i.e. β + 1 < α. Then α = β + 1 < α, contradicting strictness. Hence α is a limit. Theorem 1.19 (Ordinal Induction). Let ϕ be a property of ordinals. Suppose the following holds: i. ϕ( ) (base step). ii. α : ϕ(α) ϕ(α + 1) (successor step). iii. α Lim : ( β < α : ϕ(β)) ϕ(α) (limit step). Then ϕ(α) holds for all ordinals α. Proof. Suppose i, ii and iii hold. Assume there is some α such that ϕ(α). By (Found), take the smallest such α. Suppose α =. This contradicts i. Suppose α Suc. Then there is β such that α = β + 1, since β < β + 1, β < α and hence by minimality of α, ϕ(β). By ii, ϕ(α). Suppose α Lim. By minimality of α, all β < α satisfy ϕ(β). Thus by iii, ϕ(α). Hence there can t be any such α. Definition Let ω be the (inclusion-)smallest set that contains 0 and is closed under +1, i.e. x ω : x + 1 ω. More formally, ω = {w 0 w v w : v + 1 w}. Remark ω is a set by the Axiom of Infinity. Theorem ω is an ordinal. Proof. Consider ω Ord. This set contains 0 and is closed under +1, as ordinals are closed under +1. So ω must by definition be a subset of ω Ord, i.e. ω contains only ordinals. Hence it suffices to show that ω is transitive. Consider ω = {x x ω y x : y ω}. Clearly, 0 ω. Let x ω and show that x + 1 ω. By definition, x + 1 ω. Let y x + 1, i.e. y = x y x. If y = x, y ω. If y x then y ω by definition of ω. Hence x + 1 ω. Thus ω contains 0 and is closed under +1, i.e. ω ω. But ω ω by defintion, hence ω = ω, i.e. ω is transitive.
4 4 JULIAN J. SCHLÖDER Theorem ω is a limit, in particular, it is the smallest limit ordinal. Proof. ω 0, since 0 ω. Let α < ω. Then α + 1 < ω by definition. Assume γ < ω is a limit ordinal. Since γ, 0 γ. Also, as a limit, γ is closed under +1. Hence γ contradicts the minimality of ω. 2. Ordinal Arithmetic Definition 2.1. Define an ordinal 1 := = { }. Lemma ω. Proof. 0 ω and ω is closed under +1. Definition 2.3. Let α, β be ordinals. Define ordinal addition recursively: i. α + 0 = α. ii. If β Suc, β = γ + 1, define α + β = (α + γ) + 1. iii. If β Lim, define α + β = γ<β (α + γ). Remark 2.4. By this definition, the sum α + 1 of an ordinal α and the ordinal 1 = {0} is the same as α + 1 = α {α}. Definition 2.5. Let α, β be ordinals. recursively: Define ordinal multiplication i. α 0 = 0. ii. If β Suc, β = γ + 1, define α β = (α γ) + α. iii. If β Lim, define α β = γ<β (α γ). Definition 2.6. Let α, β be ordinals. Define ordinal exponentiation recursively: i. α 0 = 1. ii. If β Suc, β = γ + 1, define α β = (α γ ) α. iii. If β Lim and α > 0, define α β = γ<β (αγ ). If α = 0, define α β = 0. Lemma 2.7. If A is a set of ordinals, A is an ordinal. Proof. Let A be a set of ordinals, define a = A. Let x y a, then there is an α A such that x y α, so x α hence x a. Thus, a is transitive. Let z a. There is α A such that z α, hence z is transitive. Thus a is transitive and every element of a is transitive, i.e. a is an ordinal.
5 ORDINAL ARITHMETIC 5 Remark 2.8. By induction and this lemma, the definitions of +, and exponentiation above are well-defined, i.e. if α, β are ordinals, α + β, α β and α β are again ordinals. Definition 2.9. Let A be a set of ordinals. The supremum of A is definied as: sup A = min{α β A : β α}. Lemma Let A be a set of ordinals, then sup A = A. Proof. Since sup A is again an ordinal, it is just the set of all ordinals smaller than it. Hence by linearity, sup A = {α β A : α < β}. Which equals A by definition. Lemma Let A be a set of ordinals. If sup A is a successor, then sup A A. Proof. Assume sup A = α + 1 / A, then for all β A, β < α + 1, i.e. β α. Then sup A = α < α + 1 = sup A. Lemma Let A be a set of ordinals, B A such that α A β B : α β. Then sup A = sup B. Proof. Show {γ α A : γ α} = {γ β B : γ β}. Then the minima of these sets, and hence the suprema of A and B, are equal. Suppose γ α for all α A. Then, since B A, γ α for all β B. Suppose γ β for all β B. Let α A, then there is some β B with β α, hence γ β α. Thus γ α for all α A. Lemma If γ is a limit, γ = sup γ = α<γ α = sup α<γ α = γ. Proof. We ve shown a more general form of the first equality, the second and third are just a different ways of writing the same set. Assume γ sup α<γ α, i.e. γ < sup α<γ α or sup α<γ α < γ by linearity. In the first case, there is α < γ such that γ < α, i.e. γ < γ contradicting strictness. In the second case, (sup α<γ α) + 1 < γ, since γ is a limit. But then, by definition of sup, (sup α<γ α) + 1 sup α<γ α while sup α<γ α < (sup α<γ α) + 1, again contradicting strictness. Lemma For all α, 0 + α = α. Proof. By induction on α. Since = 0, the base step is trivial. Suppose α = β + 1 and 0 + β = β. Then 0 + α = 0 + (β + 1) = (0 + β) + 1 = β + 1 = α. Suppose α Lim and for all β < α, 0 + β = β. Then 0 + α = β<α (0 + β) = β<α β = α. Lemma For all α, 1 α = α 1 = α.
6 6 JULIAN J. SCHLÖDER Proof. α 1 = α (0 + 1) = (α 0) + α = α. Prove 1 α = α by induction on α. Since 1 0 = 0, the base step holds. Suppose α = β +1 and 1 β = β. Then 1 α = (1 β)+1 = β +1 = α. Suppose α is a limit and for all β < α, 1 β = β. Then 1 α = β<α (1 β) = β<α β = α. Lemma For all α, α 1 = α. Proof. α 1 = α 0+1 = α 0 α = 1 α = α. Lemma For all α, 1 α = 1. Proof. If α = 0, 1 α = 1 by definition. If α = β + 1, 1 β+1 = 1 β 1 = 1. If α is a limit, 1 α = sup β<α 1 β = sup β<α 1 = 1. Lemma Let α be an ordinal. If α > 0, 0 α = 0. Otherwise 0 α = 1. Proof. 0 0 = 1 by definition, so let α > 0. If α = β + 1, 0 α = 0 β 0 = 0. If α is a limit, 0 α = 0 by defnition. Theorem 2.19 (Subtraction). For all β α there is some γ α with β + γ = α. Proof. By induction on α. α = 0 is trivial. Suppose α = δ + 1 and β α. If β = α, set γ = 0. So suppose β < α, i.e. β δ. Find γ β with β + γ = δ. Set γ = γ + 1, then β + γ = β + (γ + 1) = (β + γ ) + 1 = δ + 1 = α. If α is a limit and β < α then for all δ < α, β δ, find γ δ such that β + γ δ = δ. If δ < β, set γ δ = 0. Set γ = sup β<δ<α γ δ. If γ is a successor, then there is some δ with γ = γ δ. But δ + 1 < α and as in the successor case, γ δ+1 = γ δ + 1 > γ δ = γ, so this can t be the supremum. Also, γ 0, since if it were, for all β < δ < γ, β = δ, i.e. there are no such δ. This implies β + 1 = α, but α is no successor. So, γ is a limit. In particular for all δ < α, γ δ < γ: If there were any δ < γ with γ δ = γ, then since γ 0, β < δ. Then again γ δ+1 = γ δ + 1 > γ δ = γ, contradicting that γ is the supremum. Hence, β + γ = sup ε<γ (β + ε) = sup γδ <γ(β + γ δ ) = sup γδ <γ δ = sup δ<α δ = α. Theorem ω is closed under +, and exponentiation, i.e. n, m ω : n + m ω n m ω n m ω. Proof. By induction on m. Since ω does not contain any limits, we may omit the limit step.
7 ORDINAL ARITHMETIC 7 First consider addition. If m = 0 then n + m = m ω. Suppose m = k + 1. n + m = (n + k) + 1. By induction n + k ω and since ω is closed under +1, (n + k) + 1 ω. Now consider multiplication. If m = 0, n 0 = 0 ω. Suppose m = k + 1. n m = (n k) + n. By induction n k ω and since ω is closed under +, (n k) + n ω. Finally consider exponentiation. If m = 0, n 0 = 1 ω. Suppose m = k + 1. n m = n k n. By induction, n k ω and since ω is closed under, n k n ω Comparisons of Addition. 3. Monotonicity Laws Lemma 3.1. If α and β are ordinals, and α β, then α + 1 β + 1. Proof. Assume α β and α + 1 > β + 1. By transitivity it suffices to now derive a contradiction. Since β + 1 < α + 1, β + 1 = α β + 1 < α. If β + 1 = α, β + 1 β, but β < β + 1. If β + 1 < α, by transitivity β + 1 β, but β < β + 1. Lemma 3.2. If α and β are ordinals, then α α + β. Proof. By induction on β: If β = 0, α = α + β. If β = γ + 1 and α α + γ, then α + β = (α + γ) + 1 α + 1 α. If β Lim and for all γ < β, α α+γ, then: α+β = γ<β (α+γ) = sup γ<β (α + γ) sup γ<β α = α. Lemma 3.3. If α and β are ordinals, then β α + β. Proof. By induction on β: β = 0 is trivial, since 0 is the smallest ordinal. If β = γ + 1 and γ α + γ, then α + β = (α + γ) + 1 γ + 1 = β. If β Lim and for all γ < β, γ α+γ, then: α+β = γ<β (α+γ) = sup γ<β (α + γ) sup γ<β γ = β. Lemma 3.4. If γ is a limit, then for all α: α + γ is a limit. Proof. γ 0, so α + γ γ > 0, i.e. α + γ 0. So let x α + γ. Show that x + 1 < α + γ. x α + γ = β<γ (α + β), i.e. there is β < γ such that x α + β. By a previous lemma, x + 1 α + β. If x + 1 α + β, x + 1 < α + γ. So suppose α + β = x + 1. Since γ is a limit, β + 1 < γ and by definition α + (β + 1) = (α + β) + 1, and x + 1 (α + β) + 1, hence x + 1 α + γ. Lemma 3.5. Suppose γ is a limit, α, β are ordinals and β < γ. then α + β < α + γ.
8 8 JULIAN J. SCHLÖDER Proof. By definition, α+γ = δ<γ (α+δ). Since γ is a limit, β +1 < γ. Also by definition: α + β < (α + β) + 1 = α + (β + 1) {α + δ δ < γ}. Hence α + β δ<γ α + δ. Lemma 3.6. Suppose α, β, γ are ordinals and β < γ. then α + β < α + γ. Proof. By induction over γ. γ = 0 is clear, since there is no β < 0. And the previous lemma is the limit step. So we need to cover the successor step. Suppose γ = δ + 1. Then β < γ means β δ. If β = δ, notice: α + β = α + δ < (α + δ) + 1 = α + (δ + 1) = α + γ. If β < δ, apply induction: α+β < α+δ. Hence α+β < (α+δ)+1 = α + (δ + 1) = α + γ. Theorem 3.7 (Left-Monotonicity of Ordinal Addition). Let α, β, γ be ordinals. The following are equivalent: i. β < γ. ii. α + β < α + γ. Proof. The previous lemma shows the forward direction. So assume α + β < α + γ and not β < γ. By linearity, γ β. If γ = β, α + γ = α + β < α + γ. If γ < β, by the forward direction, α + γ < α + β < α + γ. Lemma ω = ω. Proof. 1 + ω is a limit by a lemma above, so ω 1 + ω (since ω is the smallest limit). ω is a limit, so 1 + ω = sup α<ω 1 + α. Since ω is closed under +, 1 + α < ω for all α < ω, hence sup α<ω ω. It follows that 1 + ω = ω. Remark 3.9. Right-Monotoniticy does not hold: Clearly, 0 < 1 and we ve seen that 0 + ω = ω and 1 + ω = ω. So 0 + ω 1 + ω Comparisons of Multiplications. Lemma For all α, β: α + β = 0 iff α = β = 0. Proof. Reverse direction is trivial. So suppose α + β = 0 and not α = β = 0. If β = 0, then 0 = α + β = α and if β > 0, by Left- Monotonicity 0 α + 0 < α + β = 0. Lemma If α and β 0 are ordinals, then α α β. Proof. By induction on β. Suppose β = γ+1, then α β = (α γ)+α α, by induction and the corresponding lemma on addition. Suppose β is a limit. α β = γ<β (α γ) = sup γ<β(α γ) sup γ<β α = α.
9 ORDINAL ARITHMETIC 9 Lemma If α 0 and β are ordinals, then β α β. Proof. By induction on β. β = 0 is trivial. Suppose β = γ + 1, then: α β = (α γ) + α > α γ γ (since α > 0 and by Left-Monotonicity) (by induction). And α β > γ implies α β γ + 1 = β. Suppose β is a limit. α β = γ<β (α γ) = sup γ<β(α γ) sup γ<β γ = β. Lemma If γ is a limit, then for all α 0: α γ is a limit. Proof. γ 0, so α γ γ > 0, i.e. α γ 0. So let x α γ. Show that x + 1 < α γ. x α γ = β<γ (α β), i.e. there is β < γ such that x α β. By a previous lemma, x + 1 α β. If x + 1 α β, x + 1 < α γ. So suppose α β = x + 1. Since γ is a limit, β + 1 < γ and by definition α (β + 1) = (α β) + α, and x + 1 (α β) + 1 (α β) + α by Left-Monotonicity (since α 1). Hence x + 1 α γ. Lemma Suppose γ is a limit, α 0 and β are ordinals and β < γ. Then α β < α γ. Proof. By definition, α γ = δ<γ (α δ). Since γ is a limit, β + 1 < γ. By Left-Monotonicity: α β < (α β) + α = α (β + 1) {α δ δ < γ}. Hence α β δ<γ α δ. Lemma Suppose α 0 and β, γ are ordinals and β < γ. Then α β < α γ. Proof. By induction over γ. γ = 0 is clear and the previous lemma is the limit step. So we need to cover the successor step. Suppose γ = δ+1. Then β < γ means β δ. If β = δ, apply Left-Monotonicity: α β = α δ < (α δ) + α = α (δ + 1) = α γ. If β < δ, apply induction: α β < α δ. Hence (by Left-Monotonicity) α β < α δ < (α δ) + α = α (δ + 1) = α γ. Theorem 3.16 (Left-Monotonicity of Ordinal Multiplication). Let α, β, γ be ordinals. The following are equivalent: i. β < γ α > 0. ii. α β < α γ. Proof. The previous lemma shows the forward direction. So assume α β < α γ and not β < γ. If α = 0, then α β = 0 = α γ. So α > 0. By linearity, γ β. If γ = β, α γ = α β < α γ. If γ < β, by the forward direction, α γ < α β < α γ.
10 10 JULIAN J. SCHLÖDER Lemma Let 2 = ω = ω. Proof. Since ω is the smallest limit and by a lemma above 2 ω is a limit, ω 2 ω. Since ω is closed under, for all α < ω, 2 α ω. Hence 2 ω = sup α<ω 2 α ω. Remark Right-Monotonicity does not hold: Clearly, 1 < 2 and since 1 ω = ω and 2 ω = ω, 1 ω 2 ω Comparisons of Exponentation. Lemma If α and β 0 are ordinals, then α α β. Proof. If α = 0 the lemma is trivial. So suppose α > 0. By induction on β. Suppose β = γ + 1, then α β = (α γ ) α α, by induction and the corresponding lemma on multiplication. Suppose β is a limit. α β = γ<β (αγ ) = sup γ<β (α γ ) sup γ<β α = α. Lemma If α > 1 and β are ordinals, then β α β. Proof. If β = 0 the lemma is trivial. So suppose β > 0. By induction on β. Suppose β = γ + 1, then: α β = (α γ ) α > α γ 1 (by Left-Monotonicity) = α γ γ (by induction). And α β > γ implies α β γ + 1 = β. Suppose β is a limit. α β = γ<β (αγ ) = sup γ<β (α γ ) sup γ<β γ = β. Lemma If γ is a limit, then for all α > 1: α γ is a limit. Proof. γ 0, so α γ γ > 0, i.e. α γ 0. So let x α γ. Show that x + 1 < α γ. x α γ = β<γ (αβ ), i.e. there is β < γ such that x α β. By a previous lemma, x + 1 α β. If x + 1 α β, x + 1 < α γ. So suppose α β = x+1. Since γ is a limit, β +1 < γ and by definition α β+1 = (α β ) α, and x + 1 (α β ) + 1 α β + α β α β 2 α β α by Left-Monotonicity (since α 2). Hence x + 1 α γ. Lemma Suppose γ is a limit, α > 1 and β are ordinals and β < γ. Then α β < α γ. Proof. By definition, α γ = δ<γ (αδ ). Since γ is a limit, β + 1 < γ. By Left-Monotonicity: α β < (α β ) α = α β+1 {α δ δ < γ}. Hence α β δ<γ αδ.
11 ORDINAL ARITHMETIC 11 Lemma Suppose α > 1 and β, γ are ordinals and β < γ. Then α β < α γ. Proof. By induction over γ. γ = 0 is clear and the previous lemma is the limit step. So we need to cover the successor step. Suppose γ = δ+1. Then β < γ means β δ. If β = δ, apply Left-Monotonicity: α β = α δ < (α δ ) α = α δ+1 = α γ. If β < δ, apply induction: α β < α δ. Hence (by Left-Monotonicity) α β < α δ < (α δ ) α = α δ+1 = α γ. Theorem 3.24 (Left-Monotonicity of Ordinal Exponentiation). Let α, β, γ be ordinals and α > 0. The following are equivalent: i. β < γ α > 1. ii. α β < α γ. Proof. The previous lemma shows the forward direction. So assume α β < α γ and not β < γ. If α = 1, α β = 1 = α γ. By linearity, γ β. If γ = β, α γ = α β < α γ. If γ < β, by the forward direction, α γ < α β < α γ. Lemma Let 0 < n ω. n ω = ω. Proof. ω is the smallest limit and n ω is a limit by a lemma above. So ω n ω. Since ω is closed under exponentiation, for all α < ω, n α ω. Then n ω = sup α<ω n α ω. Remark Right-Monotonicity does not hold: Define 3 = ω. Clearly, 2 < 3 and since 2 ω = ω and 3 ω = ω, 2 ω 3 ω. 4. Associativity, Distributivity and Commutativity Theorem , and exponentiation are not commutative, i.e. there are α, β, γ, δ, ε, ζ such that α + β β + α, γ δ δ γ and ε ζ ζ ε. Proof. Let α = 1, β = ω, γ = 2, δ = ω, ε = 0, ζ = ω = ω as shown above. ω ω {ω} = ω + 1, so α + β < β + α. 2 ω = ω as shown above. By Left-Monotonicity, ω < ω + ω = ω 2. So γ δ < δ γ. 0 1 = = 0, but 1 0 = 1 by definition. Hence ε ζ < ζ ε. Theorem 4.2 (Associativity of Ordinal Addition). Let α, β, γ be ordinals. Then (α + β) + γ = α + (β + γ).
12 12 JULIAN J. SCHLÖDER Proof. By induction on γ. γ = 0 is trivial. Suppose γ = δ + 1. (α + β) + (δ + 1) = ((α + β) + δ) + 1 (by definition) = (α + (β + δ)) + 1 (by induction) = α + ((β + δ) + 1) (by definition) = α + (β + (δ + 1)) (by definition) = α + (β + γ). Now suppose γ is a limit, in particular γ > 1. Then β + γ is a limit, so α + (β + γ) and (α + β) + γ are limits. (α + β) + γ = sup((α + β) + ε) (by definition) ε<γ = sup ((α + β) + ε) (by Left-Monotonicity) β+ε<β+γ = sup β+ε<β+γ (α + (β + ε)) (by induction) = sup (α + δ) (see below) δ<β+γ = α + (β + γ) (by definition). Recall Lemma Write B = {α + (β + ε) β + ε < β + γ} and A = {α + δ δ < β + γ}. Clearly B A. Let α + δ A. Let ε = min{ζ β + ζ δ}. Obviously ε γ. Assume ε = γ, then for each ζ < γ, β + ζ < δ. Then δ < β + γ = sup ζ<γ β + ζ δ. Hence, ε < γ, i.e. β + ε < β + γ. By construction, δ β + ε. Thus, by Left-Monotonicity, α + δ α + (β + ε) B. Thus, the conditions of Lemma 2.12 are satisfied. Theorem 4.3 (Distributivity). Let α, β, γ be ordinals. Then α (β + γ) = α β + α γ. Proof. Note that the theorem is trivial if α = 0, so suppose α > 0. Proof by induction on γ. γ = 0 is trivial. Suppose γ = δ + 1. α (β + (δ + 1)) = α ((β + δ) + 1) (by definition) = α (β + δ) + α (by definition) = α β + α δ + α (by induction) = α β + α (δ + 1) (by definition). Suppose γ is a limit. Hence α γ and β + γ are limits.
13 ORDINAL ARITHMETIC 13 α (β + γ) = sup δ<β+γ α δ (by definition) = sup β+ε<β+γ (α (β + ε)) (see below) = sup(α (β + ε)) (by Left-Monotonicity) ε<γ = sup(α β + α ε) (by induction) ε<γ = sup α ε<α γ (α β + α ε) (by Left-Monotonicity) = sup (α β + ζ) (see below) ζ<α γ = α β + α γ (by definition). Recall Lemma Write B = {α (β + ε) β + ε < β + γ} and A = {α δ δ < β + γ}. Clearly B A. Let α δ A. Let ε = min{η β + η δ}. Obviously ε γ. Assume ε = γ, then for each η < γ, β + η < δ. Then δ < β + γ = sup η<γ β + η δ. Hence, ε < γ, i.e. β + ε < β + γ. By construction, δ β + ε. Thus, by Left-Monotonicity, α δ α (β + ε) B. Thus, the conditions of Lemma 2.12 are satisfied. Write B = {α β + α ε α ε < α γ} and A = {α β + ζ ζ < α γ}. Clearly B A. Let α β+ζ A. Let ε = min{η α η ζ}. Obviously ε γ. Assume ε = γ, then for each η < γ, α η < ζ. Then ζ < α γ = sup η<γ α η ζ. Hence, ε < γ, i.e. α ε < α γ. By construction, ζ α ε. Thus, by Left-Monotonicity, α β + ζ α β + α ε B. Thus, the conditions of Lemma 2.12 are satisfied. Theorem 4.4 (Associativity of Ordinal Multiplication). Let α, β, γ be ordinals. Then (α β) γ = α (β γ). Proof. Note that the theorem is trivial if β = 0. So suppose β > 0. Proof by induction on γ. γ = 0 is trivial. Suppose γ = δ + 1. (α β) (δ + 1) = ((α β) δ) + (α β) (by definition) = (α (β δ)) + (α β) (by induction) = α ((β δ) + β) (by Distributivity) = α (β (δ + 1)) (by definition) = α (β γ).
14 14 JULIAN J. SCHLÖDER Now suppose γ is a limit, in particular γ > 1. Then β γ is a limit, so α (β γ) and (α β) γ are limits. (α β) γ = sup((α β) ε) (by definition) ε<γ = sup ((α β) ε) (by Left-Monotonicity) β ε<β γ = sup β ε<β γ (α (β ε)) (by induction) = sup (α δ) (see below) δ<β γ = α (β γ) (by definition). Recall Lemma Write B = {α (β ε) β ε < β γ} and A = {α δ δ < β γ}. Clearly B A. If A =, B = A. Let α δ A. Let ε = min{ζ β ζ δ}. Obviously ε γ. Assume ε = γ, then for each ζ < γ, β ζ < δ. Then δ < β γ = sup ζ<γ β ζ δ. Hence, ε < γ, i.e. β ε < β γ. By construction, δ β ε. Thus, by Left-Monotonicity, α δ α (β ε) B. Thus, the conditions of Lemma 2.12 are satisfied. Notation 4.5. As of now, we may omit bracketing ordinal addition and multiplication. Remark 4.6. Ordinal exponentiation is not associative, i.e. there are α, β, γ with α (βγ) (α β ) γ. Proof. Let α = ω, β = 1, γ = ω. Then β γ = 1, i.e. α (βγ) = α 1 = ω. But α β = ω, hence (α β ) γ = ω ω. And ω < ω ω by Left-Monotonicity. Theorem 4.7. Let α, β, γ be ordinals. Then α β+γ = α β α γ. Proof. Recall that β + γ = 0 iff β = γ = 0, so the theorem holds for α = 0. Also note that the theorem is trivial for α = 1, so suppose α > 1. Proof by induction on γ. γ = 0 is trivial. Suppose γ = δ + 1. α β+δ+1 = α β+δ α (by definition) = α β α δ α (by induction) = α β α δ+1 (by definition).
15 ORDINAL ARITHMETIC 15 Suppose γ is a limit. Then α γ and α β+γ are limits. α β+γ = sup α δ δ<β+γ = sup α β+ε β+ε<β+γ = sup α β+ε ε<γ (by definition) (see below) (by Left-Monotonicity) = sup(α β α ε ) (by induction) ε<γ = sup α ε <α γ (α β α ε ) = sup ζ<α γ (α β ζ) (by Left-Monotonicity) (see below) = α β + α γ (by definition). Recall Lemma Write B = {α β+ε β +ε < β +γ} and A = {α δ δ < β + γ}. Clearly B A. Let α δ A. Let ε = min{η β + η δ}. Obviously ε γ. Assume ε = γ, then for each η < γ, β + η < δ. Then δ < β + γ = sup η<γ β + η δ. Hence, ε < γ, i.e. β + ε < β + γ. By construction, δ β + ε. Thus, by Left-Monotonicity, α δ α β+ε B. Thus, the conditions of Lemma 2.12 are satisfied. Write B = {α β α ε α ε < α γ } and A = {α β ζ ζ < α γ }. Clearly B A. Let α β ζ A. Let ε = min{η α η ζ}. Obviously ε γ. Assume ε = γ, then for each η < γ, α η < ζ. Then ζ < α γ = sup η<γ α η ζ. Hence, ε < γ, i.e. α ε < α γ. By construction, ζ α ε. Thus, by Left-Monotonicity, α β ζ α β +α ε B. Thus, the conditions of Lemma 2.12 are satisfied. 5. The Cantor Normal Form Lemma 5.1. If α < β and n, m ω \ {0}, ω α n < ω β m. Proof. α + 1 β, so ω α+1 ω β by Left-Monotonicity (of exponentiation). Hence (by Left-Monotonicity of multiplication), ω α n < ω α ω = ω α+1 ω β ω β m. Lemma 5.2. If α 0 > α 1 >... > α n, and m 1,..., m n ω, then ω α 0 > 1 i n ωαi m i. Proof. If any m i = 0 it may just be omitted from the sum. So suppose all m i > 0. n = 0 and n = 1 are the trivial cases. Consider n = 2: ω α1 m 1 + ω α2 m 2 ω α1 m 1 + ω α1 m 1 by the lemma above and Left-Monotonicity of addition. Then again by the previous lemma ω α1 m 1 2 < ω α 0.
16 16 JULIAN J. SCHLÖDER Continue via induction: Suppose the lemma holds for n. Then consider the sequence α 1,..., α n. It follows that 2 i n+1 ωαi m i < ω α 1. By the n = 2 case, ω α 0 > ω α1 m 1 + ω α 1 and by Left-Monotonicity of addition, ω α1 m 1 + ω α 1 > 1 i n ωαi m i. Theorem 5.3 (Cantor Normal Form (CNF)). For every ordinal α, there is a unique k ω and unique tuples (m 0,..., m k ) (ω \ {0}) k, (α 0,..., α k ) of ordinals with α 0 >... > α k such that: α = ω α0 m ω αk m k Proof. Existence by induction on α: If α = 0, then k = 0. Suppose that every β < α has a CNF. Let ˆα = sup{γ ω γ α} and let ˆm = sup{m ω ω ˆα m α}. Note that ω ˆα α: If not, then α ω ˆα. Then there is γ, ω γ α with α γ. But since ω α+1 > ω α α, γ < α + 1, i.e. γ α. Also note that ˆm ω: If not, then ˆm = ω, hence: α < ω ˆα+1 = ω ˆα ω = sup n ω ω ˆα n α. By construction, ω ˆα ˆm α, so there is ε α with α = ω ˆα ˆm + ε. Show that ε < α: Suppose not, then ε α, hence ε ω ˆα, so there is ζ ε with ε = ω ˆα + ζ, i.e. α = ω ˆα ˆm + ω ˆα + ζ. By left-distributivity, α = ω ˆα ( ˆm + 1) + ζ ω ˆα ( ˆm + 1), contradicting the choice of ˆm. Thus, by induction, ε has a CNF i l n ωβi i. Note that β 0 ˆα: If not, β 0 > ˆα, i.e. by the choice of ˆα, ω β 0 > α, so ε ω β 0 > α. Now state the CNF of α: If β 0 < ˆα set k = l + 1, α 0 = ˆα, m 0 = ˆm and α i = β i 1, m i = n i 1 for 1 i k. And if β 0 = ˆα set k = l, m 0 = n 0 + ˆm, α 0 = ˆα and α i = β i, m i = n i for 1 i k. Uniqueness: Suppose not and let α be the minimal counterexample. Let α = ω α0 m ω αm m m = ω β0 n ω βn n n. Obviously α > 0, i.e. the sums are not empty. Show α 0 = β 0 : Suppose not, wlog assume α 0 > β 0. Consider the previous lemma. Then α ω α0 m 0 > ω β0 n ω βn n n = α. Then show m 0 = n 0 : Suppose not, wlog assume m 0 < n 0. Then, again by the previous lemma, ω α 0 > 1 i m ωαi m i. So, by Left- Monotonicity of addition, α < ω α0 m 0 + ω α 0, i.e. α < ω α0 (m 0 + 1) ω α0 n 0 α. So ω α0 m 0 = ω β0 n 0, so by Left-Monotonicity, ω α1 m ω αm m m = ω β1 n ω βn n n. These terms are strictly smaller than α by the previous lemma. By minimality of α, m = n, and the α s, β s, m s and n s are equal. Thus α has a unique CNF.
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
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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,
Διαβάστε περισσότερα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
Διαβάστε περισσότεραChapter 2. Ordinals, well-founded relations.
Chapter 2. Ordinals, well-founded relations. 2.1. 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
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότεραω ω ω ω ω ω+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 +
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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:
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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)
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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 :
Διαβάστε περισσότερα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.
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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 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
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότεραTHE GENERAL INDUCTIVE ARGUMENT FOR MEASURE ANALYSES WITH ADDITIVE ORDINAL ALGEBRAS
THE GENERAL INDUCTIVE ARGUMENT FOR MEASURE ANALYSES WITH ADDITIVE ORDINAL ALGEBRAS STEFAN BOLD, BENEDIKT LÖWE In [BoLö ] we gave a survey of measure analyses under AD, discussed the general theory of order
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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,
Διαβάστε περισσότερα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,
Διαβάστε περισσότερα( 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
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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 α
Διαβάστε περισσότεραOn density of old sets in Prikry type extensions.
On density of old sets in Prikry type extensions. Moti Gitik December 31, 2015 Abstract Every set of ordinals of cardinality κ in a Prikry extension with a measure over κ contains an old set of arbitrary
Διαβάστε περισσότερα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
Διαβάστε περισσότεραLecture 21: Properties and robustness of LSE
Lecture 21: Properties and robustness of LSE BLUE: Robustness of LSE against normality We now study properties of l τ β and σ 2 under assumption A2, i.e., without the normality assumption on ε. From Theorem
Διαβάστε περισσότερα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) =
Διαβάστε περισσότεραSolutions to Selected Homework Problems 1.26 Claim: α : S S which is 1-1 but not onto β : S S which is onto but not 1-1. y z = z y y, z S.
Solutions to Selected Homework Problems 1.26 Claim: α : S S which is 1-1 but not onto β : S S which is onto but not 1-1. Proof. ( ) Since α is 1-1, β : S S such that β α = id S. Since β α = id S is onto,
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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).
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότεραΚΥΠΡΙΑΚΗ ΕΤΑΙΡΕΙΑ ΠΛΗΡΟΦΟΡΙΚΗΣ CYPRUS COMPUTER SOCIETY ΠΑΓΚΥΠΡΙΟΣ ΜΑΘΗΤΙΚΟΣ ΔΙΑΓΩΝΙΣΜΟΣ ΠΛΗΡΟΦΟΡΙΚΗΣ 19/5/2007
Οδηγίες: Να απαντηθούν όλες οι ερωτήσεις. Αν κάπου κάνετε κάποιες υποθέσεις να αναφερθούν στη σχετική ερώτηση. Όλα τα αρχεία που αναφέρονται στα προβλήματα βρίσκονται στον ίδιο φάκελο με το εκτελέσιμο
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότεραde Rham Theorem May 10, 2016
de Rham Theorem May 10, 2016 Stokes formula and the integration morphism: Let M = σ Σ σ be a smooth triangulated manifold. Fact: Stokes formula σ ω = σ dω holds, e.g. for simplices. It can be used to define
Διαβάστε περισσότερα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)
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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,...,
Διαβάστε περισσότερα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
Διαβάστε περισσότερα3.2 Simple Roots and Weyl Group
44 CHAPTER 3. ROOT SYSTEMS 3.2 Simple Roots and Weyl Group In this section, we fix a root system Φ of rank l in a euclidean space E, with Weyl group W. 3.2.1 Bases and Weyl chambers Def. A subset of Φ
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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 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.
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότεραMA 342N Assignment 1 Due 24 February 2016
M 342N ssignment Due 24 February 206 Id: 342N-s206-.m4,v. 206/02/5 2:25:36 john Exp john. Suppose that q, in addition to satisfying the assumptions from lecture, is an even function. Prove that η(λ = 0,
Διαβάστε περισσότεραΑπόκριση σε Μοναδιαία Ωστική Δύναμη (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
Διαβάστε περισσότερα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,
Διαβάστε περισσότεραSCITECH Volume 13, Issue 2 RESEARCH ORGANISATION Published online: March 29, 2018
Journal of rogressive Research in Mathematics(JRM) ISSN: 2395-028 SCITECH Volume 3, Issue 2 RESEARCH ORGANISATION ublished online: March 29, 208 Journal of rogressive Research in Mathematics www.scitecresearch.com/journals
Διαβάστε περισσότερα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
Διαβάστε περισσότεραUNIT - I LINEAR ALGEBRA. , such that αν V satisfying following condition
UNIT - I LINEAR ALGEBRA Definition Vector Space : A non-empty set V is said to be vector space over the field F. If V is an abelian group under addition and if for every α, β F, ν, ν 2 V, such that αν
Διαβάστε περισσότεραKnaster-Reichbach Theorem for 2 κ
Knaster-Reichbach Theorem for 2 κ Micha l Korch February 9, 2018 In the recent years the theory of the generalized Cantor and Baire spaces was extensively developed (see, e.g. [1], [2], [6], [4] and many
Διαβάστε περισσότεραSOLUTIONS TO MATH38181 EXTREME VALUES AND FINANCIAL RISK EXAM
SOLUTIONS TO MATH38181 EXTREME VALUES AND FINANCIAL RISK EXAM Solutions to Question 1 a) The cumulative distribution function of T conditional on N n is Pr T t N n) Pr max X 1,..., X N ) t N n) Pr max
Διαβάστε περισσότεραChap. 6 Pushdown Automata
Chap. 6 Pushdown Automata 6.1 Definition of Pushdown Automata Example 6.1 L = {wcw R w (0+1) * } P c 0P0 1P1 1. Start at state q 0, push input symbol onto stack, and stay in q 0. 2. If input symbol is
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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(θ + θ)
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότεραCyclic or elementary abelian Covers of K 4
Cyclic or elementary abelian Covers of K 4 Yan-Quan Feng Mathematics, Beijing Jiaotong University Beijing 100044, P.R. China Summer School, Rogla, Slovenian 2011-06 Outline 1 Question 2 Main results 3
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότεραCompleteness Theorem for System AS1
11 The Completeness Theorem for System AS1 1. Introduction...2 2. Previous Definitions...2 3. Deductive Consistency...2 4. Maximal Consistent Sets...5 5. Lindenbaum s Lemma...6 6. Every Maximal Consistent
Διαβάστε περισσότερα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)
Διαβάστε περισσότεραΑλγόριθμοι και πολυπλοκότητα NP-Completeness (2)
ΕΛΛΗΝΙΚΗ ΔΗΜΟΚΡΑΤΙΑ ΠΑΝΕΠΙΣΤΗΜΙΟ ΚΡΗΤΗΣ Αλγόριθμοι και πολυπλοκότητα NP-Completeness (2) Ιωάννης Τόλλης Τμήμα Επιστήμης Υπολογιστών NP-Completeness (2) x 1 x 1 x 2 x 2 x 3 x 3 x 4 x 4 12 22 32 11 13 21
Διαβάστε περισσότεραPg The perimeter is P = 3x The area of a triangle is. where b is the base, h is the height. In our case b = x, then the area is
Pg. 9. The perimeter is P = The area of a triangle is A = bh where b is the base, h is the height 0 h= btan 60 = b = b In our case b =, then the area is A = = 0. By Pythagorean theorem a + a = d a a =
Διαβάστε περισσότεραSEMIGROUP ACTIONS ON ORDERED GROUPOIDS. 1. Introduction and prerequisites
ao DOI: 10.2478/s12175-012-0080-3 Math. Slovaca 63 (2013), No. 1, 41 52 SEMIGROUP ACTIONS ON ORDERED GROUPOIDS Niovi Kehayopulu* Michael Tsingelis** (Communicated by Miroslav Ploščica ) ABSTRACT. In this
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότεραw o = R 1 p. (1) R = p =. = 1
Πανεπιστήµιο Κρήτης - Τµήµα Επιστήµης Υπολογιστών ΗΥ-570: Στατιστική Επεξεργασία Σήµατος 205 ιδάσκων : Α. Μουχτάρης Τριτη Σειρά Ασκήσεων Λύσεις Ασκηση 3. 5.2 (a) From the Wiener-Hopf equation we have:
Διαβάστε περισσότεραNew bounds for spherical two-distance sets and equiangular lines
New bounds for spherical two-distance sets and equiangular lines Michigan State University Oct 8-31, 016 Anhui University Definition If X = {x 1, x,, x N } S n 1 (unit sphere in R n ) and x i, x j = a
Διαβάστε περισσότεραStrukturalna poprawność argumentu.
Strukturalna poprawność argumentu. Marcin Selinger Uniwersytet Wrocławski Katedra Logiki i Metodologii Nauk marcisel@uni.wroc.pl Table of contents: 1. Definition of argument and further notions. 2. Operations
Διαβάστε περισσότερα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
Διαβάστε περισσότερα