SINGULAR CARDINALS AND SQUARE PROPERTIES

Μέγεθος: px
Εμφάνιση ξεκινά από τη σελίδα:

Download "SINGULAR CARDINALS AND SQUARE PROPERTIES"

Transcript

1 SINGULAR CARDINALS AND SQUARE PROPERTIES MENACHEM MAGIDOR AND DIMA SINAPOVA Abstract. We analyze the effect of singularizing cardinals on square properties. By work of Džamonja-Shelah and of Gitik, if you singularize an inaccessible cardinal to countable cofinality while preserving its successor, then κ,ω holds in the bigger model. We extend this to the situation where every regular cardinal in an interval [κ, ν] is singularized, for some regular cardinal ν. More precisely, we show that if V W, κ < ν are cardinals, where ν is regular in V, κ is a singular cardinal in W of countable cofinality, cf W (τ) = ω for all V -regular κ τ ν, and (ν + ) V = (κ + ) W, then W = κ,ω. 1. Introduction The square principle was isolated by Jensen in his fine structure analysis of L. Square at κ, κ, states that there exists a sequence C α α < κ + such that each C α is a club subset of α, o.t.(c α ) κ, and if lim C α, then C α = C. There are various weakenings allowing multiple guesses for the clubs at each point. More precisely, the principle κ,λ states that there is a sequence C α α < κ +, such that: (1) 1 C α λ, (2) every C C α is a club in α, o.t.(c) κ, (3) if C C α and lim(c), then C C. Square principles hold in models that sufficiently resemble L. On the other hand they are at odds with reflection properties and fail above large cardinals. For example, there is tension between failure of SCH and failure of the weaker square properties. One reason is that it is difficult to avoid weaker square principles at singular cardinals. The standard way of singularizing cardinals is by Prikry forcing, and Cummings and Schimmerling showed in [2] that after Prikry forcing at κ, κ,ω holds in the generic extension. More generally, by arguments in Gitik [4] and independently in Džamonja-Shelah [3], it was implicit that if V W are transitive class models of ZFC such that κ is an inaccessible cardinal in V, singular of countable cofinality in W, and (κ + ) V = (κ + ) W, then W = κ,ω. On the other hand in Gitik-Sharon [5], a forcing was constructed where κ is singularized, (κ +ω+1 ) V becomes the successor of κ, and weak square of κ fails in the generic extension. The second author is partially supported by the National Science Foundation under Grant No. DMS

2 2 MENACHEM MAGIDOR AND DIMA SINAPOVA The natural question is what happens if κ is singularized and an interval of cardinals above κ is collapsed. In this paper we show that if V W are such that κ is a cardinal in V and W, cf W (κ) = ω, ν > κ is a regular cardinal, every V -regular cardinal τ, κ τ ν has cofinality ω in W, and (ν + ) V = (κ + ) W, then κ,ω holds in the outer model. Similarly to what was done in [3] and [4], we show the existence of a pseudo Prikry sequence witnessing that ν is singular in the bigger model. Moreover, for ν = κ +n for some n, we generalize these arguments to obtain a pseudo Prikry sequence in W through P κ ((κ +n ) V ). We use the term pseudo Prikry because the properties of these sequences will be the best approximation of the genericity of a Prikry sequence, without referring to any measure. We will use the following notation: cof(τ) and cof(< τ) denote points of cofinality τ and less than τ, respectively. Similarly, we write cof W (τ) to denote the points of cofinality τ in W. For a set C, lim(c) is the set of all limit points of C and nacc(c) is the non-limit points of C. 2. Pseudo Prikry sequences We start with a fact due to Shelah, whose proof can be found in [6], Theorem Proposition 2.1. Suppose that ν > κ > ℵ 1 are cardinals, where ν is regular. Then there is a sequence S < ν of stationary subsets of ν +, such that <ν S = ν + cof(< κ) and each S carries a partial square sequence C α α S Lim. More precisely: each C α is a club subset of α with o.t.(c α) < κ, and if β lim(c α), then β S and C α β = C β. Theorem 2.2. Suppose V W are such that κ < ν are cardinals in V, ν is regular in V, (ω 1 ) W < κ, cf W (κ) = ω, for all V -regular cardinals, τ, κ τ ν, cf W τ = ω, and (ν + ) V = (κ + ) W. Suppose that D α α < (ν + ) V V is a sequence of club subsets of ν. Then in W there is a sequence n n < ω cofinal in ν, such that for every α < (ν + ) V, for all large n, n D α. Furthermore, for any λ < κ, such that λ is regular in W, we may assume that for all n, cf W ( n ) λ. Proof. Note that we are not assuming that κ remains a cardinal in W. Denote µ := ν +, and let D α α < µ V be club subsets of ν. First we will construct a sequence n n < ω meeting each of these sets on a final segment. Then we will amend the argument to ensure that the cofinality is as desired. In V, let S < ν be as in Proposition 2.1. In particular, each S carries a partial square sequence of clubs of order type less than κ. Since <ν S = µ cof V (< κ) µ cof W (ω 1 ), let < ν be such that in W, S cof W (ω 1 ) is stationary, and denote S := S. Let C α α S be the corresponding partial square sequence.

3 SINGULAR CARDINALS AND SQUARE PROPERTIES 3 Claim 2.3. In V there is a sequence D α α < µ of club subsets of ν, such that (1) For each α < µ, D α D α, (2) For every α < β < µ, D β \ D α < ν (3) For every α < β < µ, β S, if α C β, then D β D α. Proof. Work in V. Let D 0 = D 0. Suppose we have defined D α α < β, β < µ. If β S, set D β = D β α<β D α α C β D α. If β / S, let D β = D β α<β D α. In W, let λ n n < ω be an increasing cofinal sequence in ν. Let I n be the interval (λ n, λ n+1 ). For every α < µ, let d α = {n D α I n }, and define a sequence λ α n n d α, by setting λ α n = sup(d α I n ). Note that for α < β, d β \ d α is finite, and if β S, α C β, then d β d α. Also, it follows that for all large n, if λ β n is defined, then so is λ α n and λ β n λ α n. Denote E α := λ α n n d α. For α < β, we say that there is a major change between α and β if E α E β is infinite. We claim that for α < β < γ, if there is a major change between α and β, then there is a major change between α and γ. For otherwise, if E α E γ is finite, then for all large n, λ α n = λ γ n, when defined. So, for all large n, λ γ n λ β n λ α n = λ γ n, which means that E α E β must have been finite as well. Claim 2.4. There is some α, such that for every α < β < µ, there is no major change between α and β. Proof. Otherwise, for every α, let f(α) > α be such that there is a major change between α and f(α). The set C := {α < µ ( β < α)(f(β) < α)} is club, so pick α lim(c) S cof W (ω 1 ). Let α i i < ω 1 be a cofinal sequence through lim(c α ) C. Then if i < j < ω 1, Dα j Dα i, and so d αj d αi. Then d αi i < ω 1 must be eventually constant. So, let d be such that for all large i, d = d αi. Now for every n d, the sequence λ α i n i < ω 1 is weakly decreasing, so for some i n < ω 1 and λ n, we have that for all i i n, λ α i n = λ n. Set i = sup n d i n < ω 1. Let E := { λ n n d}. Then for all ξ i, E αξ = E. But for i < ξ < ξ, since α ξ C, we have that f(α ξ ) < α ξ, so there is a major change between α ξ and α ξ. But E αξ = E = E αξ. Contradiction Now let α be as in the claim and set E := E α. Then E is the desired sequence, i.e. for all β < µ, on a final segment E is contained in D β.

4 4 MENACHEM MAGIDOR AND DIMA SINAPOVA Next, we show how to get a sequence n n < ω as obtained above, but with the additional requirement that for all n, cf( n ) λ (in W ). We follow the argument in Džamonja-Shelah [3]. First note that for any club D ν, the set { D o.t.(d ) is divisible by λ} is club, such that if is a non-limit point in that set, then cf W () λ. Fix a sequence a < ν V, such that each a is a club subset of with order type cf V (). We define a sequence of clubs Dα α < µ by induction on α. Set D0 = { D 0 o.t.(d 0 ) is divisible by λ}. Suppose we have already defined Dα α < β. If β S, let D β = D β α<β Dα α C β Dα. If β / S, let D β = D β α<β Dα. Then set Dβ := { D β o.t.(d β ) is divisible by λ}. Then Dα α < µ satisfy (1), (2), and (3) in Claim 2.3, with the new key property that if nacc(dα ), then cf W () λ. Now, for α < µ, let T0 α := E α, where E α is defined above, but with respect to Dα, and let Tn+1 α := Tn α {sup(ρ Dα ) ( T α n cof W (< λ))ρ a, ρ > sup(d α ρ T α n )}. Set T α = n T α n. Note that T α D α. Claim 2.5. If nacc(t α ), then cf W () λ. Proof. Otherwise, suppose nacc(t α ) and cf W () < λ. Then, by definition of Dα, / nacc(dα ) i.e. lim(dα ). So = sup({sup(ρ Dα ) ρ a }). Since nacc(t α ), a T α must be bounded in. Let < be such that T α ( \ ) =. Then for all ρ a \, ρ > sup(dα ρ Tn α ). Now let n be such that Tn α. Then since cf W () < λ, {sup(ρ Dα ) ρ a \ } Tn+1 α. So sup(a Dα ) <. Then nacc(dα ), and so cf W () λ. We say that there is a major change between α and β if T α T β is unbounded in ν. By running the same argument as above we get that there is some α, such that for all α < β < µ, there is no major change between α, β. The only difference here is that we take S, such that S cof W (λ) is stationary. Then setting T := T α, we have that for all β < µ, for some, T \ Dβ. Then let n n < ω be cofinal in nacc(t ). This sequence is as desired. Next we generalize to club subsets of P κ (κ +m ). In the arguments below, for a set of ordinals y we define the characteristic function of y, χ y to be a function defined on the regular cardinals η sup(y) where χ y (η) = sup(y η). We will need the following claim.

5 SINGULAR CARDINALS AND SQUARE PROPERTIES 5 Claim 2.6. Let κ be a regular cardinal, m a natural number. Then there is a club D of P κ (κ +m ) such that for all x, y D if for all i m, χ x (κ +i ) = χ y (κ +i ) and cf(χ x (κ +i )) is uncountable, then x = y. Proof. Let χ be some big enough cardinal, and < χ be a well-ordering of H χ. Let D = {M κ +m M H χ,, < χ..., M < κ, ( i < m)κ +i M, M κ κ}. Then D {x ( i m)(cf(χ x (κ +i )) > ω) x is ω-closed} contains a club, so let D be a club contained in it. Suppose x, y D are such that for all i m, χ x (κ +i ) = χ y (κ +i ) and cf(χ x (κ +i )) is uncountable. Since x, y are both ω-club in α := sup(x), x y is also ω-club in α. Now let M, N witness that x, y D. By induction on i, we show that x κ +i y κ +i. For i = 0, this is is given. Fix i > 0. For every ρ x y κ +i, with ρ = κ +i 1, by elementarity the < χ -least bijection from κ +i 1 to ρ is in M N. Since by induction M κ +i 1 = N κ +i 1, we get that M ρ N ρ. By doing this for all ρ x y κ +i, we get x κ +i y κ +i. Taking i = m, we get x y. By an identical argument y x, and so they are equal. Below V W are two transitive models of set theory. When we use some set theoretic terminology or notation like a regular cardinal, + etc. we shall mean it in the sense of V, unless otherwise stated. Theorem 2.7. Suppose that κ is a regular cardinal in V, and m < ω is such that in W κ, κ +,... κ +m all have cofinality ω, (ω 1 ) W < κ, and (κ + ) W = κ +m+1. In V let D α α < κ +m+1 be a sequence of clubs of P κ (κ +m ). Then in W there is a sequence x n n < ω of elements of P κ (κ +m ), such that for every α < κ +m+1 for large enough n < ω, x n D α. Moreover, if λ < κ is an uncountable regular cardinal in W, we can assume that for n < ω and k m, cf W (χ xn (κ +k )) λ. Proof. We shall prove the theorem by induction on m. The case m = 0 follows from Theorem 2.2. Suppose the theorem is true for m. In order to prove the theorem for m + 1 we shall use the theorem for m and η := κ + in place of κ. Set = κ +m+1 = η +m and µ = +. Using Claim 2.1, fix a stationary set S µ cof W ( λ) such that there is a partial square sequence on S, C α α S, and such that S cof W (λ) is stationary. As usual we can assume that the order type of C α for α S is λ. Let D α α < µ be a sequence of clubs in P κ (). We can assume without loss of generality that for all α < µ, D α D, where D is the club defined in Claim 2.6. Claim 2.8. In V there is a sequence D α α < µ of club subsets of P κ (), such that: (1) For each α < µ, D α D α, (2) For all α < β < µ, there is γ <, such that D β \ D α {x γ / x} (3) For all α < β < µ, with β S, if α C β, then D β D α.

6 6 MENACHEM MAGIDOR AND DIMA SINAPOVA Proof. Work in V. For every β < µ, fix a one-to-one function f β : β. Let D 0 = D 0. Suppose we have defined D α α < β. If β S, set D β = D β {x x D f 1 (γ)} D α. β γ x α C β Otherwise, let D β = D β {x x γ x D f 1 (γ)}. β D α α < µ is as desired. The γ in item (2) is γ = f β (α). By applying the above claim and shrinking the D α s if necessary, we may assume they satisfy the conclusion of the claim. For α < µ, fix an algebra with λ many operations on, A α, such that every x P κ () which is a subalgebra of A α is in D α. By our assumptions about D α, we can arrange that for α < β there is ρ < such that a subalgebra of A β containing ρ is also closed under the operations of A α. Also we can arrange that if α is a limit point of C β, then a subalgebra of A β is closed under the operations of A α. (The last clause is the one that requires the algebras to have λ many operations.) For α < µ, let Dα be the club in P η () defined by being a subalgebra of A α. By the induction assumption for m, η and λ (ω 1 ) W and the sequence of clubs Dα α < µ, we get a sequence z k k < ω, such that for every α < µ for large enough k, z k Dα. Without loss of generality, we can assume that z k k < ω is increasing and κ z 0. Also we choose the z k s, so that the characteristic function χ zk (κ +i ) has W -cofinality at least λ. Since for i m + 1, cf W (κ +i ) = ω, we fix in W a -increasing sequence t n n < ω of elements of P κ () such that n<ω t n = and for all n < ω t n z n. Below, we will construct the desired sequence x n n < ω to be such that t n x n z n and for 0 < i m + 1 χ xn (κ +i ) = χ zn (κ +i ). Note that since cf W (χ zn (κ +i )) λ, we have that the cofinality of this ordinal in V is uncountable and below κ. For α < µ, n < ω, in V, define Eα n to be the set of ξ < κ, such that there exists y P κ (), such that: y is closed under the operations of A α, y κ = ξ, for 0 < i m + 1, χ y (κ +i ) = χ zn (κ +i ), and t n y. Note that because of Claim 2.6 above the y in the definition of E n α is uniquely determined by y κ, and that y z n. It is easily seen that E n α is a club in κ. Claim 2.9. (1) Let α < β < µ then for large enough n < ω, E n β En α. (2) If α < β are both in S such that α is a limit point of C β then for every n, E n β En α.

7 SINGULAR CARDINALS AND SQUARE PROPERTIES 7 Proof. Pick ρ < such that any subalgebra of A β containing ρ is closed under the operations of A α. Let n be large enough such that ρ t n. Then for ξ E n β let y be the (unique) witness for this. Then since t n y, ρ y, and then y also witnesses ξ E n α. The argument for the second clause in the claim is completely analogous. In order to deal with the requirement that the cofinality in W of the values of the characteristic function of the required x n will be at least λ, for every ξ < κ with cf W (ξ) < λ, we fix (in W ) a club e ξ in ξ of order type less than λ. Let C be a club in κ, and for γ < σ < κ define the operation T (C, γ, σ) by induction as follows: If C [γ, σ] =, let T (C, γ, σ) =. Otherwise, let ξ = sup(c [γ, σ]). If cf(ξ) W λ, then T (C, γ, σ) = {ξ}. If the two previous cases fail let T (C, γ, σ) := {ξ} {T (C, γ, σ) γ, σ are two consecutive memebrs of (e ξ \ γ) {γ}}. It is easily seen by induction that T (C, γ, σ) is a subset of C [γ, σ] of cardinality less than λ. Claim Let C be a club in κ and γ < σ < κ. Assume that C [γ, σ] cof W ( λ) then T (C, γ, σ) cof W ( λ). Proof. By induction on σ. Denote T = T (C, γ, σ). By assumption we can pick ζ C [γ, σ] cof W ( λ). Since ξ := sup(c [γ, σ]) T, there is ρ T, such that ρ ζ. Let ρ be the least such. If cf W (ρ) λ we are done. Otherwise γ ζ < ρ. Then there are two consecutive members of (e ξ \ γ) {γ}, γ < σ, such that ζ [ γ, σ]. Since σ < ρ σ, by the induction assumption, we get ζ T (C, γ, σ) with cf W ( ζ) λ. But T (C, γ, σ) T, so ζ T. Claim Let G ρ ρ < λ be a -decreasing sequence of clubs of κ, each of them in V. (The sequence does not have to be in V ). Let γ < σ < κ. Then the sequence T (G ρ, γ, σ) ρ < λ is eventually constant. Proof. We prove the claim by induction on σ. If for some ρ < λ, G ρ [γ, σ] =, then for ρ ρ, T (G ρ, γ, σ) =, and we are done. So assume otherwise and let ξ ρ = sup(g ρ [γ, σ]) = sup(t (G ρ, γ, σ)). This is a non increasing sequence of ordinals, so without loss of generality we can assume that it is a constant ξ for all ρ. If cf W (ξ) λ, then for every ρ T (G ρ, γ, σ) = {ξ}, and so it is constant. If cf W (ξ) < λ then for each two successive points in e ξ, γ, σ, by the induction assumption T (G ρ, γ, σ) is eventually constant. Since e ξ < λ, we can find ρ < λ and T ( γ, σ) such that for ρ ρ, T (G ρ, γ, σ) = T ( γ, σ). Then for all ρ ρ, by definition, T (G ρ, γ, σ) is {ξ} {T ( γ, σ) γ, σare two consecutive memebrs of (e ξ \ γ) {γ}} and so we are done.

8 8 MENACHEM MAGIDOR AND DIMA SINAPOVA Claim Let E G H be three clubs in κ and γ < σ < κ. Assume that T (H, γ, σ) T (G, γ, σ) then T (E, γ, σ) T (H, γ, σ).. Proof. By induction on σ. The only nontrivial case is when T (E, γ, σ). Then clearly T (G, γ, σ) and T (H, γ, σ). So ξ E = sup(e [γ, σ]) = sup(t (E, γ, σ)),ξ G = sup(e [γ, σ]) = sup(t (G, γ, σ)), ξ H = sup(h [γ, σ]) = sup(t (H, γ, σ)) are all defined and ξ E ξ G ξ H. If ξ G < ξ H then ξ E < ξ H and the claim is proved. So assume ξ G = ξ H. If ξ E < ξ G then again the claim is verified. So assume ξ = ξ E = ξ G = ξ H. If cf W (ξ) λ then T (H, γ, σ) = T (G, γ, σ) = {ξ}, contradiction with the assumption of the claim. Then cf W (ξ) < λ, and so there must be two successive points in e ξ γ, σ such that T (G, γ, σ) T (H, γ, σ). By the inductive hypothesis T (E, γ, σ) T (H, γ, σ), and so T (E, γ, σ) T (H, γ, σ). Fix a sequence of order type ω, cofinal in κ, κ n n < ω. For α < µ and n < ω, define d n α = T (Eα, n κ k, κ k+1 ). k<ω For α < β < µ we say that there is a major change between α and β, if there are infinitely many n s such that d n α d n β. Claim Let α < β < γ < µ and suppose that there is a major change between α and β. Then there is a major change between α and γ. Proof. By claim 2.9 there is n < ω, such that for every n n, we have that Eγ n Eβ n En α. By assumptions the set R = {n d n α d n β } is infinite. By claim 2.12 for n R, n n, d n α d n γ. Lemma There is α < µ, such that for α β < γ, there is no major change between β and γ. Proof. By claim 2.13 it is enough to see that there is α < µ such for all α < β there is no major change between α and β. If this fails, then for every α < µ, let f(α) > α be such that, there is a major change between α and f(α). Let G be the club of the ordinals in µ which are closed under the function f. Since S cof W (λ) is stationary in µ, pick ζ S G such that cf W (ζ) = λ. Let H = G lim(c ζ ). Since λ is uncountable, H is a club in ζ of order type λ, and H S. If α < β are both in H, then α is a limit point of C β, and so by claim 2.9, for all n < ω, Eβ n En α. Then for all n < ω, the sequence Eα n α H is a decreasing sequence of λ-many clubs in κ. Hence by applying claim 2.11 ω-many times, for each n, we get that there is α H, such that for all n and all β H, α < β, d n α = d n β. By definition of G, α < f(α) < β. Then there is

9 SINGULAR CARDINALS AND SQUARE PROPERTIES 9 major change between α and f(α), but there is no change at all between α and β, which contradicts claim Fix α < µ, such that there is no major change after α and define d n = d n α. For every n < ω, as a club in κ, E n α contains unboundedly many ordinals of cofinality λ. Then, by claim 2.10, for every n < ω, d n also contains unboundedly many ordinals of cofinality λ. Hence we can define an increasing sequence of ordinals cofinal in κ, ρ n n < ω, such that for all n, ρ n d n and cf W (ρ n ) λ. Claim For every β < µ, for large enough n, ρ n E n β. Proof. If β < α, then for large enough n Eα n Eβ n, so for large enough n, d n Eα n Eβ n. If α β, then by definition of α, for large enough n, d n β = dn α = d n, and so again d n Eβ n. This implies that for for every β < µ, for large enough n, ρ n Eβ n. We can now finish the proof of the theorem. For n < ω, let x n be the unique member of P κ () such that x n D, for all 0 < i m + 1 sup(x n κ +i ) = sup(z n κ +i ) and x n κ = ρ n. Such x n exists since ρ n Eα. n Also note that automatically we get t n x n. We claim that the sequence x n n < ω is as desired. Let β < µ, and let n be large enough, so that ρ n Eβ n. Then by definition of En β, x n D β. 3. Consequences on square properties Theorem 3.1. Suppose V W and κ < ν are such that, ν is a regular cardinal in V, κ is a singular cardinal in W of countable cofinality, for all V - regular cardinals τ, with κ τ ν, W = cf(τ) = ω, and (ν + ) V = (κ + ) W. Then in W, κ,ω holds. Proof. Work in V. Denote µ := ν +. Let χ be some big enough cardinal, and < χ be a well-ordering of H χ. For α < µ with cf(α) < κ, let M α < ν be a continuous -increasing sequence of elementary submodels of H χ,, < χ..., such that: (1) α, κ M0 α, (2) for each < ν, M α < ν, (3) for each < ν, M α ν ν. Claim 3.2. For all α < µ, < ν with cf() > ω, if M α α is cofinal in α, then M α α is ω-closed. Proof. Suppose for contradiction that β i i < ω is an increasing sequence of points in M α α, such that β := sup i β i / M α α. Let β be the least ordinal in M α α above β. If cf(β ) = λ < ν, then λ M α ν ν. Then λ + 1 M α, and so M α is cofinal in β, which is a contradiction. It follows that the cofinality of β must be ν. Say M α = h : ν β is cofinal. For every i, let βi ran(h)\β i. The order type of ran(h) is ν M α.

10 10 MENACHEM MAGIDOR AND DIMA SINAPOVA And cf(ν M α ) = cf() > ω. So there is something in the range of h above β. Contradiction with the choice of β. Claim 3.3. Let α < µ. D α := {sup(m α ν) < ν} is club in ν. Proof. D α is closed by construction since the sequence is continuous. To see that it is unbounded, note that ν M α. Note that this also implies that α M α, since the < χ-least function in H χ from ν onto α is in each M α. By Theorem 2.2 there is a sequence λ i i < ω W, such that for all large i, λ i D α and for all i, cf W (λ i ) > ω. For α < µ with cf V (α) < κ, define C α := {M β α α β < µ, < ν, M β is cofinal in β and α, ( i)m β (ν) V = λ i }. Here M β α denotes the closure of M β α. Otherwise, cf W (α) = ω and we let C α be a singleton of some ω-sequence cofinal in α. Claim C α ω. Proof. Each C α is nonempty because for all large i, λ i D α. Now suppose β, β,, are such that: M β ν = M β ν = λ i, M β, M β are both cofinal in α. We want to show that M β α = M β α. If cf(α) = ω, then α M β, M β. By elementarity, the χ -least function from ν onto α is in M β β ν = M ν, and the result follows. Now suppose that cf(α) > ω. We have cf() = cf( ) = cf(λ i ) > ω. Then M β β α, M α are both ω-clubs in α, and so M β M β α is an ω-club in α. By the above for any η M β M β α, M β η = M β η, and so M β α = M β α. Next we use C α α < µ to obtain a κ,ω sequence. Since ν has cardinality κ in W, there is a sequence F β β < ν, such that each F β is a club in β of order type at most κ, and for lim(f β ), F β = F. This is similar to arguments in Section 6.1 of [1]. Now enumerate C α := {Cn α n < ω} and let each Cn α = {γ α,n ξ ξ < νn α }, where νn α = o.t.(cn α ) < ν. Define En α := {γ α,n ξ ξ F γ α n } and let E α = {En α n < ω}. It is routine to verify that E α α < µ is a κ,ω sequence. We conclude with some open question. Question 1. Can we replace κ +m in Theorem 2.7 with any (possibly singular) V -cardinal ν? We remark that by [5], we cannot take ν to be singular in Theorem 3.1.

11 SINGULAR CARDINALS AND SQUARE PROPERTIES 11 Question 2. Can we get a similar result as in Theorem 3.1 for uncountable cofinality? The main obstacle here would be to deal with the points whose V - cofinality is κ when trying to build a square sequence. References [1] James Cummings, Matthew Foreman and Menachem Magidor, Squares, scales and stationary reflection, J. of Math. Log., vol. 1(2001), pp [2] James Cummings, Ernest Schimmerling, Indexed Squares, Israel J. Math., 131:61-99, [3] Mirna Džamonja and Saharon Shelah, On squares, outside guessing of clubs and I <f [λ], Fund. Math., 148(2): , [4] Moti Gitik, Some results on the nonstationary ideal II, Israel J. Math., 99: , [5] Moti Gitik and Assaf Sharon, On SCH and the approachability property, Proc. of the AMS, vol. 136 (2008), pp [6] Saharon Shelah, Cardinal arithmetic., Oxford Logic Guides, 29, Oxford Uniersity Press 1994.

Every set of first-order formulas is equivalent to an independent set

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

Διαβάστε περισσότερα

Ordinal Arithmetic: Addition, Multiplication, Exponentiation and Limit

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

Διαβάστε περισσότερα

2 Composition. Invertible Mappings

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,

Διαβάστε περισσότερα

On density of old sets in Prikry type extensions.

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

Διαβάστε περισσότερα

ST5224: Advanced Statistical Theory II

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

Διαβάστε περισσότερα

NOTES ON SQUARES, SCALES, AND REFLECTION

NOTES ON SQUARES, SCALES, AND REFLECTION NOTES ON SQUARES, SCALES, AND REFLECTION MAXWELL LEVINE 1. Some Basic Facts Proposition 1. If κ

Διαβάστε περισσότερα

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. 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.

Διαβάστε περισσότερα

Splitting stationary sets from weak forms of Choice

Splitting stationary sets from weak forms of Choice Splitting stationary sets from weak forms of Choice Paul Larson and Saharon Shelah February 16, 2008 Abstract Working in the context of restricted forms of the Axiom of Choice, we consider the problem

Διαβάστε περισσότερα

ORDINAL ARITHMETIC JULIAN J. SCHLÖDER

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.

Διαβάστε περισσότερα

C.S. 430 Assignment 6, Sample Solutions

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

Διαβάστε περισσότερα

Chapter 3: Ordinal Numbers

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

Διαβάστε περισσότερα

EE512: Error Control Coding

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

Διαβάστε περισσότερα

Uniform Convergence of Fourier Series Michael Taylor

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

Διαβάστε περισσότερα

ω ω ω ω ω ω+2 ω ω+2 + ω ω ω ω+2 + ω ω+1 ω ω+2 2 ω ω ω ω ω ω ω ω+1 ω ω2 ω ω2 + ω ω ω2 + ω ω ω ω2 + ω ω+1 ω ω2 + ω ω+1 + ω ω ω ω2 + ω

ω ω ω ω ω ω+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 +

Διαβάστε περισσότερα

Matrices and Determinants

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

Διαβάστε περισσότερα

Section 8.3 Trigonometric Equations

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.

Διαβάστε περισσότερα

Homework 3 Solutions

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

Διαβάστε περισσότερα

4.6 Autoregressive Moving Average Model ARMA(1,1)

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

Διαβάστε περισσότερα

Example Sheet 3 Solutions

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

Διαβάστε περισσότερα

Fractional Colorings and Zykov Products of graphs

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

Διαβάστε περισσότερα

Bounding Nonsplitting Enumeration Degrees

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,

Διαβάστε περισσότερα

MINIMAL CLOSED SETS AND MAXIMAL CLOSED SETS

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

Διαβάστε περισσότερα

P-IDEAL DICHOTOMY AND WEAK SQUARES

P-IDEAL DICHOTOMY AND WEAK SQUARES P-IDEAL DICHOTOMY AND WEAK SQUARES DILIP RAGHAVAN Abstract. We answer a question of Cummings and Magidor by proving that the P-ideal dichotomy of Todorčević refutes κ,ω for any uncountable κ. We also show

Διαβάστε περισσότερα

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 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

Διαβάστε περισσότερα

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 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:

Διαβάστε περισσότερα

Other Test Constructions: Likelihood Ratio & Bayes Tests

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 :

Διαβάστε περισσότερα

Lecture 2. Soundness and completeness of propositional logic

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

Διαβάστε περισσότερα

CHAPTER 25 SOLVING EQUATIONS BY ITERATIVE METHODS

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) =

Διαβάστε περισσότερα

A Note on Intuitionistic Fuzzy. Equivalence Relation

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

Διαβάστε περισσότερα

Statistical Inference I Locally most powerful tests

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

Διαβάστε περισσότερα

Phys460.nb Solution for the t-dependent Schrodinger s equation How did we find the solution? (not required)

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

Διαβάστε περισσότερα

derivation of the Laplacian from rectangular to spherical coordinates

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

Διαβάστε περισσότερα

SOME PROPERTIES OF FUZZY REAL NUMBERS

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

Διαβάστε περισσότερα

Congruence Classes of Invertible Matrices of Order 3 over F 2

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

Διαβάστε περισσότερα

ANSWERSHEET (TOPIC = DIFFERENTIAL CALCULUS) COLLECTION #2. h 0 h h 0 h h 0 ( ) g k = g 0 + g 1 + g g 2009 =?

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

Διαβάστε περισσότερα

THE GENERAL INDUCTIVE ARGUMENT FOR MEASURE ANALYSES WITH ADDITIVE ORDINAL ALGEBRAS

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

Διαβάστε περισσότερα

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)

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

Διαβάστε περισσότερα

HOMEWORK 4 = G. In order to plot the stress versus the stretch we define a normalized stretch:

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

Διαβάστε περισσότερα

Concrete Mathematics Exercises from 30 September 2016

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)

Διαβάστε περισσότερα

Partial Differential Equations in Biology The boundary element method. March 26, 2013

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

Διαβάστε περισσότερα

6.3 Forecasting ARMA processes

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

Διαβάστε περισσότερα

Approximation of distance between locations on earth given by latitude and longitude

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

Διαβάστε περισσότερα

Homomorphism in Intuitionistic Fuzzy Automata

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

Διαβάστε περισσότερα

Finite Field Problems: Solutions

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

Διαβάστε περισσότερα

Knaster-Reichbach Theorem for 2 κ

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

Διαβάστε περισσότερα

6.1. Dirac Equation. Hamiltonian. Dirac Eq.

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

Διαβάστε περισσότερα

3.4 SUM AND DIFFERENCE FORMULAS. NOTE: cos(α+β) cos α + cos β cos(α-β) cos α -cos β

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

Διαβάστε περισσότερα

Lecture 15 - Root System Axiomatics

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

Διαβάστε περισσότερα

Areas and Lengths in Polar Coordinates

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. 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)

Διαβάστε περισσότερα

Problem Set 3: Solutions

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

Διαβάστε περισσότερα

Areas and Lengths in Polar Coordinates

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

Διαβάστε περισσότερα

Reminders: linear functions

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

Διαβάστε περισσότερα

The challenges of non-stable predicates

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

Διαβάστε περισσότερα

Chapter 2. Ordinals, well-founded relations.

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

Διαβάστε περισσότερα

Section 9.2 Polar Equations and Graphs

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

Διαβάστε περισσότερα

arxiv: v4 [math.lo] 15 Jun 2010

arxiv: v4 [math.lo] 15 Jun 2010 DIAMONDS arxiv:0711.3030v4 [math.lo] 15 Jun 2010 SAHARON SHELAH Abstract. If λ = χ + = 2 χ > ℵ 1 then diamond on λ holds. Moreover, if λ = χ + = 2 χ and S {δ < λ : cf(δ) cf(χ)} is stationary then S holds.

Διαβάστε περισσότερα

k A = [k, k]( )[a 1, a 2 ] = [ka 1,ka 2 ] 4For the division of two intervals of confidence in R +

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

Διαβάστε περισσότερα

The Simply Typed Lambda Calculus

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

Διαβάστε περισσότερα

Solutions to Exercise Sheet 5

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

Διαβάστε περισσότερα

Απόκριση σε Μοναδιαία Ωστική Δύναμη (Unit Impulse) Απόκριση σε Δυνάμεις Αυθαίρετα Μεταβαλλόμενες με το Χρόνο. Απόστολος Σ.

Απόκριση σε Μοναδιαία Ωστική Δύναμη (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

Διαβάστε περισσότερα

Econ 2110: Fall 2008 Suggested Solutions to Problem Set 8 questions or comments to Dan Fetter 1

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

Διαβάστε περισσότερα

12. Radon-Nikodym Theorem

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

Διαβάστε περισσότερα

Some new generalized topologies via hereditary classes. Key Words:hereditary generalized topological space, A κ(h,µ)-sets, κµ -topology.

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

Διαβάστε περισσότερα

Online Appendix I. 1 1+r ]}, Bψ = {ψ : Y E A S S}, B W = +(1 s)[1 m (1,0) (b, e, a, ψ (0,a ) (e, a, s); q, ψ, W )]}, (29) exp( U(d,a ) (i, x; q)

Online Appendix I. 1 1+r ]}, Bψ = {ψ : Y E A S S}, B W = +(1 s)[1 m (1,0) (b, e, a, ψ (0,a ) (e, a, s); q, ψ, W )]}, (29) exp( U(d,a ) (i, x; q) Online Appendix I Appendix D Additional Existence Proofs Denote B q = {q : A E A S [0, +r ]}, Bψ = {ψ : Y E A S S}, B W = {W : I E A S R}. I slightly abuse the notation by defining B q (L q ) the subset

Διαβάστε περισσότερα

Strain gauge and rosettes

Strain gauge and rosettes Strain gauge and rosettes Introduction A strain gauge is a device which is used to measure strain (deformation) on an object subjected to forces. Strain can be measured using various types of devices classified

Διαβάστε περισσότερα

Inverse trigonometric functions & General Solution of Trigonometric Equations. ------------------ ----------------------------- -----------------

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

Διαβάστε περισσότερα

Main source: "Discrete-time systems and computer control" by Α. ΣΚΟΔΡΑΣ ΨΗΦΙΑΚΟΣ ΕΛΕΓΧΟΣ ΔΙΑΛΕΞΗ 4 ΔΙΑΦΑΝΕΙΑ 1

Main source: Discrete-time systems and computer control by Α. ΣΚΟΔΡΑΣ ΨΗΦΙΑΚΟΣ ΕΛΕΓΧΟΣ ΔΙΑΛΕΞΗ 4 ΔΙΑΦΑΝΕΙΑ 1 Main source: "Discrete-time systems and computer control" by Α. ΣΚΟΔΡΑΣ ΨΗΦΙΑΚΟΣ ΕΛΕΓΧΟΣ ΔΙΑΛΕΞΗ 4 ΔΙΑΦΑΝΕΙΑ 1 A Brief History of Sampling Research 1915 - Edmund Taylor Whittaker (1873-1956) devised a

Διαβάστε περισσότερα

On a four-dimensional hyperbolic manifold with finite volume

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

Διαβάστε περισσότερα

Math221: HW# 1 solutions

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

Διαβάστε περισσότερα

arxiv: v2 [math.lo] 21 Jun 2010

arxiv: v2 [math.lo] 21 Jun 2010 BLACK BOXES arxiv:0812.0656v2 [math.lo] 21 Jun 2010 SAHARON SHELAH Abstract. We shall deal comprehensively with Black Boxes, the intention being that provably in ZFC we have a sequence of guesses of extra

Διαβάστε περισσότερα

ΚΥΠΡΙΑΚΗ ΕΤΑΙΡΕΙΑ ΠΛΗΡΟΦΟΡΙΚΗΣ CYPRUS COMPUTER SOCIETY ΠΑΓΚΥΠΡΙΟΣ ΜΑΘΗΤΙΚΟΣ ΔΙΑΓΩΝΙΣΜΟΣ ΠΛΗΡΟΦΟΡΙΚΗΣ 19/5/2007

ΚΥΠΡΙΑΚΗ ΕΤΑΙΡΕΙΑ ΠΛΗΡΟΦΟΡΙΚΗΣ 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 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 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

Διαβάστε περισσότερα

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 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

Διαβάστε περισσότερα

5.4 The Poisson Distribution.

5.4 The Poisson Distribution. The worst thing you can do about a situation is nothing. Sr. O Shea Jackson 5.4 The Poisson Distribution. Description of the Poisson Distribution Discrete probability distribution. The random variable

Διαβάστε περισσότερα

Second Order RLC Filters

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

Διαβάστε περισσότερα

( y) Partial Differential Equations

( 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

Διαβάστε περισσότερα

1. Introduction and Preliminaries.

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

Διαβάστε περισσότερα

Homework 8 Model Solution Section

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

Διαβάστε περισσότερα

SOLUTIONS TO MATH38181 EXTREME VALUES AND FINANCIAL RISK EXAM

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

Διαβάστε περισσότερα

2. THEORY OF EQUATIONS. PREVIOUS EAMCET Bits.

2. THEORY OF EQUATIONS. PREVIOUS EAMCET Bits. EAMCET-. THEORY OF EQUATIONS PREVIOUS EAMCET Bits. Each of the roots of the equation x 6x + 6x 5= are increased by k so that the new transformed equation does not contain term. Then k =... - 4. - Sol.

Διαβάστε περισσότερα

Chapter 6: Systems of Linear Differential. be continuous functions on the interval

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

Διαβάστε περισσότερα

de Rham Theorem May 10, 2016

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

Διαβάστε περισσότερα

A COHERENT SEQUENCE IN Lp GΣ (R)

A COHERENT SEQUENCE IN Lp GΣ (R) A COHERENT SEQUENCE IN Lp GΣ (R) NAM TRANG MARTIN ZEMAN 1. INTRODUCTION Suppose (P, Σ) is a hod pair such that Σ has branch condensation (here P is countable). We work under the assumption AD + +Θ = Θ

Διαβάστε περισσότερα

Commutative Monoids in Intuitionistic Fuzzy Sets

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,

Διαβάστε περισσότερα

SCITECH Volume 13, Issue 2 RESEARCH ORGANISATION Published online: March 29, 2018

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

Διαβάστε περισσότερα

Physical DB Design. B-Trees Index files can become quite large for large main files Indices on index files are possible.

Physical DB Design. B-Trees Index files can become quite large for large main files Indices on index files are possible. B-Trees Index files can become quite large for large main files Indices on index files are possible 3 rd -level index 2 nd -level index 1 st -level index Main file 1 The 1 st -level index consists of pairs

Διαβάστε περισσότερα

ON INCOMPACTNESS FOR CHROMATIC NUMBER OF GRAPHS SH1006 SAHARON SHELAH

ON INCOMPACTNESS FOR CHROMATIC NUMBER OF GRAPHS SH1006 SAHARON SHELAH ON INCOMPACTNESS FOR CHROMATIC NUMBER OF GRAPHS SH1006 SAHARON SHELAH Abstract. We deal with incompactness. Assume the existence of non-reflecting stationary subset of the regular cardinal λ of cofinality

Διαβάστε περισσότερα

Overview. Transition Semantics. Configurations and the transition relation. Executions and computation

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

Διαβάστε περισσότερα

Instruction Execution Times

Instruction Execution Times 1 C Execution Times InThisAppendix... Introduction DL330 Execution Times DL330P Execution Times DL340 Execution Times C-2 Execution Times Introduction Data Registers This appendix contains several tables

Διαβάστε περισσότερα

Space-Time Symmetries

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

Διαβάστε περισσότερα

ΚΥΠΡΙΑΚΗ ΕΤΑΙΡΕΙΑ ΠΛΗΡΟΦΟΡΙΚΗΣ CYPRUS COMPUTER SOCIETY ΠΑΓΚΥΠΡΙΟΣ ΜΑΘΗΤΙΚΟΣ ΔΙΑΓΩΝΙΣΜΟΣ ΠΛΗΡΟΦΟΡΙΚΗΣ 6/5/2006

ΚΥΠΡΙΑΚΗ ΕΤΑΙΡΕΙΑ ΠΛΗΡΟΦΟΡΙΚΗΣ CYPRUS COMPUTER SOCIETY ΠΑΓΚΥΠΡΙΟΣ ΜΑΘΗΤΙΚΟΣ ΔΙΑΓΩΝΙΣΜΟΣ ΠΛΗΡΟΦΟΡΙΚΗΣ 6/5/2006 Οδηγίες: Να απαντηθούν όλες οι ερωτήσεις. Ολοι οι αριθμοί που αναφέρονται σε όλα τα ερωτήματα είναι μικρότεροι το 1000 εκτός αν ορίζεται διαφορετικά στη διατύπωση του προβλήματος. Διάρκεια: 3,5 ώρες Καλή

Διαβάστε περισσότερα

A Bonus-Malus System as a Markov Set-Chain. Małgorzata Niemiec Warsaw School of Economics Institute of Econometrics

A Bonus-Malus System as a Markov Set-Chain. Małgorzata Niemiec Warsaw School of Economics Institute of Econometrics A Bonus-Malus System as a Markov Set-Chain Małgorzata Niemiec Warsaw School of Economics Institute of Econometrics Contents 1. Markov set-chain 2. Model of bonus-malus system 3. Example 4. Conclusions

Διαβάστε περισσότερα

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 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

Διαβάστε περισσότερα

SCHOOL OF MATHEMATICAL SCIENCES G11LMA Linear Mathematics Examination Solutions

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)

Διαβάστε περισσότερα

New bounds for spherical two-distance sets and equiangular lines

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

Διαβάστε περισσότερα

Arithmetical applications of lagrangian interpolation. Tanguy Rivoal. Institut Fourier CNRS and Université de Grenoble 1

Arithmetical applications of lagrangian interpolation. Tanguy Rivoal. Institut Fourier CNRS and Université de Grenoble 1 Arithmetical applications of lagrangian interpolation Tanguy Rivoal Institut Fourier CNRS and Université de Grenoble Conference Diophantine and Analytic Problems in Number Theory, The 00th anniversary

Διαβάστε περισσότερα

Μηχανική Μάθηση Hypothesis Testing

Μηχανική Μάθηση Hypothesis Testing ΕΛΛΗΝΙΚΗ ΔΗΜΟΚΡΑΤΙΑ ΠΑΝΕΠΙΣΤΗΜΙΟ ΚΡΗΤΗΣ Μηχανική Μάθηση Hypothesis Testing Γιώργος Μπορμπουδάκης Τμήμα Επιστήμης Υπολογιστών Procedure 1. Form the null (H 0 ) and alternative (H 1 ) hypothesis 2. Consider

Διαβάστε περισσότερα

TMA4115 Matematikk 3

TMA4115 Matematikk 3 TMA4115 Matematikk 3 Andrew Stacey Norges Teknisk-Naturvitenskapelige Universitet Trondheim Spring 2010 Lecture 12: Mathematics Marvellous Matrices Andrew Stacey Norges Teknisk-Naturvitenskapelige Universitet

Διαβάστε περισσότερα