( ) 7 29 ( ) meager (forcing) [12] Sabine Koppelberg 1995 [10] [15], [2], [3] [15] [2] [3] [11]

Size: px
Start display at page:

Download "( ) 7 29 ( ) meager (forcing) [12] Sabine Koppelberg 1995 [10] [15], [2], [3] [15] [2] [3] [11]"

Transcription

1 (Sakaé Fuchino) footnote CH

2 ( ) 7 29 ( ) meager (forcing) [12] Sabine Koppelberg 1995 [10] [15], [2], [3] [15] [2] [3] [11] [7] [11] [2] [7] 1 [14] 2

3 R R R ω N 2.2 N ω ω = {0, 1, 2,...} n ( ) n = {0, 1,..., n 1} 0 = ( ) 1 = {0} = { }, 2 = {0, 1} = {, { }},... ω 0, 1, 2,... 3 X, Y X Y = {f : f X Y } 4 ω 2 2 = {0, 1}! ω 2 0, 1 f : X Y X X f X X f f X = {f(x) : x X } Y Y f 1 Y Y f f 1 Y = {x X : f(x) Y } ω 2 2 = {0, 1} ω 5 2 ω 2 O ( ω 2, O) O ω> 2 = {s : n ω s : n 2} 2 Zermelo-Fraenkel ZFC ZFC [6] [11] f X Y f : X Y 5 X i, i I X i, i I Xi i I X i = {f : f I i I f(i) X i} i I X i X i I Xi = I X 3

4 6 s ω> 2 [s] = {f ω 2 : s f} 7 [s] ω 2 ω 2 O {[s] : s ω> 2} R ω 2 R R 2 ω 2 f (f(2n), f(2n+1)) ( ω 2) 2 ω 2 ( ω 2) 2 R ω 2 R {, } I = [0, 1] k : ω 2 I ; f f(n) 2 (n+1) n ω W = {f ω 2 : f(n) } Q = {x R : x } s ω> 2 s 0 ω 2 n ω (s s(n) n dom(s) 0)(n) = 0 n dom(s) s 1 ω 2 n ω (s s(n) n dom(s) 1)(n) = 1 n dom(s) 1 (a) k (b) k (c) k W k `W W I \ Q (a): x I 2 0. x 0 x 1 x = , 1 = f : ω 2 f(n) = x n k(f) = x k 6 ω> 2 <ω 2 7 f, g f g g f 4

5 (b): Q I O = {(q 0, q 1 ) : 0 q 0 < q 1 1, q 0, q 1 Q } I O k ω 2 (q 0, q 1 ) O k 1 (q 0, q 1 ) = {[s] : s ω> 2, q 0 < k(s 0), k(s 1) < q 1 } ω 2 ω 2 (c): k `W W I \ Q (b) s ω> 2 k [s] \ Q I \ Q q 0 = k(s 0), q 1 = k(s 1) q 0, q 1 Q k [s] = (q 0, q 1 ) (I \ Q ) k [s] I \ Q ( 1) Q ω 2 \ W I ω 2 8 Q ω 2 \ W I ω 2 1 I ω (X, O) Bor(X) Bor(O) O σ- 9 Bor(X) X = (X, O) Bor(X) = {A : O A P(X), A } Bor(X) Bor(X) = {B(α) : α < ω 1 } B(α), α < ω 1 B(0) = O, B (α) = B(α) {X \ b : b B(α)} B(α + 1) = {y : y B (α) } B(γ) = {B(α) : α < γ}, γ limit 10 F σ - G δ -F σ - G δ - S 1 F σ - G δ X S X σ- S

6 1.3 (X, O) D X X (dense) O O D O R Q R (X, O) Y X X nowhere dense O O O O O Y = ω 2 Y nowhere dense s ω> 2 t ω> 2 (s t Y [t] = ) Y X (meager set) X nowhere dense Y n X, n ω Y = n ω Y n 2 X = (X, O) (1) Y X nowhere dense Y cl(y ) nowhere dense (2) Y X Y Y X F σ (1): O O, O Y nowhere dense O O O Y = O cl(y ) = cl(y ) nowhere dense (2): Y = n ω Y n Y n nowhere dense Y = n ω cl(y n) Y Y Y F σ (1) cl(y n ) nowehre dense Y ( 2) ω 2 d f, g ω 2 d(f, g) = n ωf(n) g(n) 2 (n+1) ω 2 ω 2 + ω 2 ω 2 3 X X 4 ω 2 ω 2 ω X ω 2 ω 2 \ X X ω 2 ω 2 \ X 6

7 M = {X ω 2 : X } 4 ω 2 M! 5 (1) X ω 2 X ω 2. (2) X ω 2 Y X Y (3) X n ω 2, n ω ω 2 n ω X n ω 2 S I P(S) 12 S σ- (0) S I; (1) x S {x} I; (2) X I, Y X Y I; (3) X n I, n ω n ω X n I I S σ- (1) (3) S I (0) S σ- S S σ- I S σ- X I X I S M ω 2 σ- I P(S) σ- I I I I = {Y P(S) : Y I Y Y } X = (X, O) σ- I P(X) Borel supported X I I I F σ M Borel supported ω 2 σ- M I = {X I : X I } 1, Q ω 2 \ W 8 (1) X M I k X M. (2) X M k 1 X M I. 12 P(S) = {X : X S} I P(S) I S 7

8 1.4 B P(S) σ- µ : B R + B µ (0), (1), (2) (0) µ( ) = 0; (1) µ(s) = 1; (2) A n B, n ω m, n ω A m A n = µ( A n ) = ( k ) µ(a n ) = lim µ(a n ) k n ω n ω (2) m n ω A n A n, n ω (0) (2) (2 ) A n B, n < m µ( A n ) = µ(a n ) n<m n<m (2 ) (3) X Y µ(x) µ(y ) (4) A n B, n ω µ( A n ) µ(a n ) n ω n ω B n B, n ω n ω B n A n n ω A n = n ω B n (2) (3) µ( n ω A n) = n ω µ(b n) n ω µ(a n) (1) (2) 9 (1) O ω 2 B = Bor(O) µ : B R + s n 2 µ([s]) = 2 n (2) O I B = Bor(O) µ : B R + [a, b] I µ([a, b]) = b a µ σ- B P(S) X S µ (null-set) µ(x ) = 0, X X X B S = ω 2 S = I 9 (1) (2) µ N = {X ω 2 : X } (1) 9 (1) µ (2) (1) n=0 8

9 10 (1) X ω 2 ε > 0 ω 2 O X O, µ(o \ X) < ε (2) X ω 2 G δ X ω 2 X X 11 N ω 2 Borel-supported σ- ( 11) N I = {X I : X } 8 12 (1) X N I k X N. (2) X N k 1 X N I. M N σ- 13 X ω 2 X N ω 2 \ X M ω> 2 ω> 2 = {s n : n ω} 13 n, j ω t n,j ω> 2 (1) s n t n,j ; (2) j < j t n,j t n,j ; (3) dom(t n ) > n + j G j = n ω [t n,j] (3) 8 (4) µ(g j ) µ([t n,j ]) 2 (n+j) = 2 (n 1) n ω n ω (2) j < j G j G j G = G j j ω µ(g) lim j ω µ(g j ) = 0 G F j = ω 2 \ G j F j nowhere dense s ω> 2 s = s i [t i ] [s i ] [t i ] F j = ω 2 \ G = j ω F j ( 13)

10 1.5 ω ω = {f : f ω ω } ω ω 14 ω (Baire space) ω> ω = {t : t : n ω, n ω} t ω> ω [t] = {f ω ω : t f} O = {[t] : t ω> ω} ω ω ω ω ω 2 I ω 2 I Mω ω, Nω ω ω ω σ- Mω ω Nω ω M, N n, k ω a k n = n {}}{ 1,..., 1, 0 k n {}}{ 1,..., 1, 1 k W I 1 j : ω ω W j(f) = a 0 f(0) a 1 f(1) a 2 f(2) 15 ω ω µ s ω> ω n = dom(s) µ([s]) = 2 (s(i)+1) i<n W 4 ω 2 14 (a) j ω ω W (b) j ω ω W I j(f) a 0 f(0), a1 f(1), a2 f(2),... ω 10

11 X < X X, < (wellordered set well-ordering) 16 (1) X, < 17 (2) X a < min a X, < C X < `C = < (C C) = { x, y : x C, y C x < y} C < `C, < (C C) < C, < X, `X = { x, y X 2 : x y} X, < X, < 15 (2) a X X X, < = N, < X x X X X x y X, x < y z X x < z < y 18 y x X (successor) x X y x = min{z X : z < y}. X z X x X x X (limit) X X x X z X x X x < z x < z x < z x z, z = 16 < X (well-ordering) < X 17 X < (i), (ii), (iii) (i) x X x < x ; (ii) x, y, z X x < y y < z x < z; (iii) x, y X x < y y < x X < 18 {z X : x < z} 11

12 16 19 N R R {x R : 0 < x} {x R : 2 < x 2 } 17 X, < F : X X 20 x X x F (x) F 0 : X X F 0 F 0 (x) < x x X x 0 = min{x X : F 0 (x) < x} F 0 (x 0 ) < x 0 x 0 F 0 (x 0 ) F 0 (F 0 (x 0 )) F 0 F 0 (x 0 ) < x 0 F 0 F 0 (F 0 (x 0 )) < F 0 (x 0 ) ( 17) 18 X, < X id X X, < 21 id X X, < X, < F : X X F F 1 17 x X x F (x) x = F 1 (F (x)) F (x), x = F (x) F = id X ( 18) 19 X, < Y, < X, < Y, < F : X Y G : X Y X, < Y, < F 1 G X, < X, < 19 F 1 G = id X F G = F ( 19) ( 19) 20 X, < X (initial segment) X C c C, x X, x c x C. C C X (proper initial segment) C X x = min(x \ C). x X < x = {y X : y < x} C = X < x y X < x y < x x 19 N f X Y f : X Y f : X Y x, y X x < y F (x) < F (y) 21 f X, < Y, < f X Y x, x X x < x f(x) < f(y) 12

13 y C c C c < x < x c C x C x. c X < x 21 X, < X, < X, < F 22 F = F (= f F f) F (compatible ) 23 dom F = f F dom(f) 23 X, < Y, < (a) (b) (c) X, < Y, < X, < Y, < Y, < X, < X, <, Y, < (a), (b), (c) F = {f : X X Y Y f : X, < = Y, <} Claim 23.1 f, g F f g g f f, g F dom(f), dom(g) X dom(f) dom(g) dom(g) dom(f) dom(f) dom(g) 19 f = g ` dom(f) f g dom(g) dom(f) g f (Claim 23.1) Claim f = F dom(f ) = f F dom(f) Claim 23.2 f F 22 f f X Y = { x, y : x X, y Y } ( ) x X x, y f y X Y x X x, y f f(x) = y f f : X Y X ( ) dom(f) f f X Y f rng(f) 23 F f, g F f g dom(f) dom(g) x dom(f) dom(g) f(x) = g(x) 13

14 f 22 dom(f ) = {dom(f) : f F}, f dom(f ) = {f dom(f) : f F} f X Y X = dom(f ), Y = f dom(f ) f x, y X, x < y f, g F x dom(f), y dom(g) Claim 23.1 g f x, y dom(f) f F x < y f (x) = f(x) < f(y) = f (y) f F f f F f f f F (Claim 23.2) X X, Y Y x = min(x \ X ), y = min(y \ Y ) f = f { x, y } f F f = f f F ( 23) X, < E(x) X x x X ( ) y < x E x E x X E X, < X x E(x) E ( ) E(x) x X Y = {x X : E(x) } Y X Y x 0 x 0 y X, y < x 0 E(y) ( ) E(x 0 ) x 0 Y ( 24) < 11 x X X x x X 24 X, < E(x) X x (a), (b), (c) (a) X E 14

15 (b) (c) x X E x X x E x y < x E x E x X E E 24 ( ) x X E(y) y < x E(x) x X (a) E(x) ( ) x x X x (b) x (c) E(x) ( ) 24 x X E(x) ( 24 ) 25 X, < Y G dom(g) = {f : f X Y } 24 F : X Y x X ( ) F (x) = G(F `X < x ) 25 ( ) F X F F ( ) F F {x X : F (x) F (x)} x 0 y < x 0 x 0 F (y) = F (y) F `X < x0 = F `X < x0 F (x 0 ) = G(F `X < x0 ) = G(F `X < x0 ) = F (x 0 ) x 0 F = F ( ) F F = {f : f X I x I f(x) = G(f `X < x ) } F 22 F = F Claim 25.1 F. 24 G F X ( ) F 25 F `S F S f : X Y f `S = f (S Y ) 15

16 F 26 (Claim 25.1) Claim 25.2 f F, dom(f) = I x I f `X < x F. F X < x subseteqi (Claim 25.2) Claim 25.3 f, g F f g dom(f) dom(g) f = g ` dom(f) f g (Claim 25.3) Claim 25.4 X = {x X : f F x dom(f)}. {x X : f F x dom(f)} = x 0 f = F Claim f F x 0 dom(f ) = X < x0 f = f { x 0, G(f ) } f F x 0 dom(f ) x 0 (Claim 25.4) F = F F F Claim 25.4 F X F F ( ) ( 25) X F 25 X, < Y H, K dom(h) = rng(h) = rng(k) = Y, dom(k) = {f : f X Y } a Y F : X Y a x X ( ) F (x) = H(F (y)) y X x = y K(F `X < ) x X C y C x y x C x y C x C (transitive) 26 : x 0 X X < x0 = dom(e) 16

17 26 (a), { }, {, { }} {{ }} {, { }, {{ }}} (b) i I t i i I t i i I t i (c) t t {t} 27 T T (a) x T (b) x, y T, x y y x y = x {x} (c) U T U x T U U = x (a): z y x T z x (b): x y (a) x y x {x} y x {x} = y z y \ (x {x}) z x T z T z x {x} T x z x z y T z y. y x (c): x U U x U x z x \ U u U u z T u = z z u U z U z z U z x x U ( 27) 28 (Mostowski ) X, < T π : X, < = T, T π T T X, < π (Step I): T π : X, < = T, π : X, < = T, T {x X : π(x) π (x)} x 0 x 0 y X x 0 π(y) = π (y) π π(x 0 ) π(y) T 27 (b) π(x 0 ) = π(y) {π(y)} π (x 0 ) = π (y) {π (y)} π(x 0 ) = π (x 0 ) 17

18 x 0 x 0 π `X < x0 = π `X < x0 π(x 0 ) π X < x0 π X < x0 T 27 (c) π X < x0 = π(x 0 ). π X < x 0 = π (x 0 ) π(x 0 ) = π (x 0 ) (Step II): ( ) x X T x π x π x : X < x, < = T x, x X (IIa): x X X X < x = T x =, π = (IIb): x X T x π x π x : X < x, < = T x, x x 0 x < x 0 x X < x0 T x π x π x : X < x, < = T x, (IIa) x 0 X X < x0 (IIb1): x 0 x T π x0 = π x { x, T x } π x0 : X < x0 = T x {T x }, T x {T x } x 0 (IIb2): x 0 (Step I) x < x 0 T x, π x x < y < x 0 π y `X < x X < x, < π y X < x, π x π y, T x = {z T y π x0 = {π x : x < x 0 } : z π y (x)} π x0 : X < x0, < = {T x : x < x 0 } {T x : x < x 0 } x 0 (Step III): (Step II) (Step I) (Step I) (IIb2) x X T x π x π x : X < x, < = T x, x, y X, x < y π x π y, T x = {z T y : z π y (x)} (IIb1) (IIb2) T x, π x (x X) X, < ( 28) 29 X, < Y X Y, < π X : X, < T, π Y : Y, < (S, ) π Y = π X `Y S T S T π X `Y : Y, < = (π Y, ) 28 π Y = π X `Y S T π X S T ( 29) 18

19 2.3 On On (1) On (2) α (3) X, < α, α, α (ordinal number) On = {α : α }. 30 α, β On α < β α β. 30 α α, α, α α α, α, ( 30) 31 (a) (b) (c) (d) (e) (f) β α On β On On α On α = {β On : β < α} α, β On α = β α β β α α On α α α, β On β < α β α M M On < M = sup M (g) On (a): β α On β δ γ β α δ β β α β α β (b): α = {x : x α} (a) α On β α β On 29 On On 30 On Ord 19

20 (c): 23 α β α β β α α β α β α α = β α β γ α γ α α = γ α β β α β α (d): α α α x x x α (e): β < α β α α β α (d) β α\β β α β α ξ α \ β β ξ β ξ η ξ \ β β η < ξ ξ β = γ < α (f): M M M On β M β M (e) M M < M (e) (g): (a) On = On On (f) On On (d) ( 31) 32 (a) On On <On (b) < On C On C On C = min C (c) (d) 0 = < < α On α + 1 = α {α} On α + 1 On, < α (a): 31 (c), (e) (b): C On C On C 31 (e) C C (c): vacantly 31 (e) < On (d): α + 1 On α (e) α + 1 α ( 32) 32 0 =, 1 = 0 + 1, 2 = 1 + 1,... n + 1 = n On n = {0, 1,..., n 1} n + 1 = n + 1 n + 1 n (d) n 1 n 1! 20

21 α On α (limit ordinal) α, β On β < α β β α, < N n On n N = {n On : n }. N N On N = N 31 (f) N On N N ω 2.4 Card n n = {0, 1,..., n 1} E n E = n n E (AC Axiom of Choice) F f : F F a F f(a) a X X, < X < X X X = min{α On : X α } X, < X < X, < α α On X α {α On : X α } X well-defined On κ 33 f F 21

22 α < κ α κ κ (cardinal) 35 κ α < κ α κ 2 34 x Cantor x f : x P(x) g : P(x) x 2 34 h : x P(x) f : x P(x); a {a} g : P(x) x 2; y ch y!ch y : x 2 y a x 1 a y ch y (a) = 0 a y h : x P(x) y = {a x : a h(a)} y P(x) h a x h(a ) = y a y y a h(a ) = y a y y a h(a ) = y ( 34) 35 A C g : A C h : C A A C 35 C = g A R C R C \ C < = R R { c, c : c C, c C \ C } < C! C < C π : C, < = α, β = π C α β α π g : A β A β A C 36 h C A A = C j : A A k : C C f = k 1 j A C ( 35) 34 2 = {0, 1} x 2 = {f : f : x 2} Card 22

23 36 (a) (b) (c) ω M sup M (= M) (a) n m < n f : m n m < n n 0 n = n {n } n < n f : m n m 0 m = m {m } m < m f 2 f(m ) = n f : m n f (k) = { f(k) f(k) < m 0 f m n m < n < n n ω n f : n ω l < n f (l) = min{n, f(l)} f : n n + 1 f (b): α ω α α + 1 α f β + 1 f(β) = β α β < ω ω β < α β = α f α + 1 (c): M κ M = κ M M 31 (f) M κ < M f : κ M κ < λ λ M λ M f : κ λ f (α) = { f(α) f(α) < λ 0 f λ M λ 37 x, y x (a) (b) ( 36) x = y f : x y (i) x y (ii) (iii) f : x y g : y x 23

24 κ µ κ < µ x x = κ x = κ κ = x < P(x) κ + = min{µ Card : κ < µ} κ + κ ℵ : On On ℵ(0) = ω ℵ(α + 1) = (ℵ(α)) + ℵ(λ) = sup{ℵ(α) : α < λ}, λ. α On ℵ(α) ℵ α ℵ α ω α Card κ ℵ α α On µ = min(card \ ({ℵ α : α On}) ω). ℵ α, α On α ℵ α < µ {ξ On : ξ < µ} {ℵ α : α On} Card \ ω = {ℵ α : α On} X ℵ 0 (countable set) X = ℵ 0 X X > ℵ 0 X 39 α κ = ℵ α α = β +1 β κ = (ℵ β ) + κ (successor cardinal) α κ = ℵ α κ (limit cardinal) 2.5 κ λ κ + λ, κ λ, κ λ A, B A = κ, B = λ A B = 40 κ + λ = A B, κ λ = A B, κ λ = B A 37 ℵ 38 On ZFC A = κ {0}, B = λ {1} 24

25 A B A = A, B = B A B = A B A B = A B = A B = A B, B A = B A f λ 2 f 1 {1} P(λ) P(λ) = λ 2 = 2 λ 38 κ, λ, µ (a) κ + λ = λ + κ, κ λ = λ κ (b) (κ + λ) + µ = κ + (λ + µ), (κ λ) µ = κ (λ µ) (c) κ (λ + µ) = κ λ + κ µ (d) (κ λ) µ = κ µ λ µ (e) κ λ+µ = κ λ κ µ (f) (g) (κ λ ) µ = κ λ µ κ κ, λ λ ; (κ, λ ), κ + λ κ + λ, κ λ κ λ, κ λ κ λ α, β On max(α, β) α β On 2 = On On < (α, β) < (γ, δ) max(α, β) < max(γ, δ) ( ) max(α, β) = max(γ, δ) α < γ ( ) max(α, β) = max(γ, δ) α = γ β < δ. 39 < On 2 < X On 2 X < α 1 = min{max{α, β} : (α, β) X} X 1 = {(α, β) X : max{α, β} = α 1 } α 2 = min{α : β (α, β) X 1 } X 2 = {(α, β) X 1 : α = α 2 } α 3 = min{β : (α 2, β) X 2 } < (α 2, α 3 ) X ( 39) (On, ) (On 2, <) 23 K : (On 2, <) (On, ) 40 ν On ν ν On 2 < ν ν = {(α, β) : (α, β) < (0, ν)} 25

26 (α, β) ν ν (ξ, η) < (α, β) max{ξ, η} max{α, β} < ν (ξ, η) ν ν ν ν On 2 < < (0, ν) On 2 \ ν ν ( 40) K ν ν (On, ) On 41 (a) n, m ω K((m, n)) < ω (b) κ K((0, κ)) = κ (c) κ κ κ = κ (a): k = max{m, n}+1 (m, n) < (0, k) 40 {(α, β) : (α, β) < (0, k)} = k k k k < ω K((m, n)) < K((0, k)) < ω (b) (c): κ Card, κ ℵ 0 κ = ℵ 0 40 (a) K((0, ω)) = {K((m, n)) : m, n ω} = ω (b) K `ω ω ω ω ω ℵ 0 ℵ 0 = ℵ 0 λ < κ (b) (c) κ (b) (c) κ κ κ K((0, κ)) = K κ κ κ α < κ α α = α < κ K((0, α)) < κ (0, κ) (0, α), α < κ K((0, κ)) κ κ = ℵ 0 K `κ κ κ κ κ κ κ = κ ( 41) 42 (a) κ, λ κ ω λ ω κ + λ = max{κ, λ} κ, λ 0 κ λ = max{κ, λ} (b) κ, λ X κ x X x λ X max{κ, λ} (a): κ λ 0 κ 0, λ 0 (κ {0}) (λ {1}) κ λ κ + λ κ λ µ = max{κ, λ} 41 µ κ + λ κ λ µ µ = µ (b): X = X κ X = {x α : α < κ} 41 x α α < κ x α λ x α = {a α,β : β < λ} g : κ λ X g((α, β)) = a α,β g 37 (b) (a) X κ λ = max{κ, λ} ( 42) (b) κ X f x α = f(α) 26

27 43 κ, µ 2 µ 2 κ, ω κ µ κ = 2 κ κ κ = 2 κ 2 κ µ κ (2 κ ) κ = 2 κ κ = 2 κ κ = 2 κ 41 (c) ( 43) κ + λ, κ λ κ λ 3.2 Saharon Shelah Shelah [8] 2.6 α On X α α (cofinal) β < α γ X β γ α cf(α) cf(α) = min{ X : X α, X α } 44 κ Card cf(κ + ) = κ + X κ + κ + β X β κ X κ 42 (b) κ + = κ + = X κ κ = κ ( 44) κ cf(κ) = κ κ (regular) 44 ZFC cf(ℵ ω ) = ω {ℵ n : n ω} ℵ ω König κ κ cf(κ) > κ {f α : α < κ} cf(κ) κ f cf(κ) κ \ {f α : α < κ} {α ξ : ξ < cf(κ)} κ κ f : cf(κ) κ f(ξ) = min(κ \ {f α (ξ) : α < α ξ }) {f α (ξ) : α < α ξ } < κ κ \ {f α (ξ) : α < α ξ } = α < κ f f α α < α ξ ξ < cf(κ) f f(ξ) f α (ξ) ( 45) 46 (König) κ cf(2 κ ) > κ 27

28 κ (2 κ ) = 2 κ X α, α < κ α < κ X α < 2 κ κ (2 κ ) = α<κ X α f : κ 2 f(α) = min(2 κ \ {f(α) : f X α }) α < κ f X α f α<κ X α X α ( 46) 28

29 3 α < ( = ) ω 2 ω 1 B B(0) = {O : O ω 2 }; B(α + 1) = { Y : Y S Y }, S = B(α) { ω 2 \ x : x B(α)} ; γ < ω 1 B(γ) = α<γ B(α). B = α<ω 1 B(α) 47 (a) F P( ω 2) ω 2 σ- B F (b) α β < ω 1 B(α) B(β) (c) B = Bor( ω 2). (a): α < ω 1 B(α) F α = 0 F ω 2 B(α) F B(α + 1) F B(α + 1) F σ-γ < ω 1 β < γ B(β) F B(γ) = β<γ B(β) F (b): β < ω 1 α β B(α) B(β) β = 0 β = α + 1 B(α + 1) x B(α) x = {x} B(α + 1) B(α) B(α + 1) β < ω 1 B(β) = β <β B(β ) β < β β (c): (a) B ω 2 B B(0) B x B x B(α) α < ω 1 ω 2 \ x = { ω 2 \ x} B(α + 1) B X B x X r(x) = min{α < ω 1 : x B(α)} R = {r(x) : x X} R ω 1 R α α < ω 1 ω 1 = R 42 (b) ω

30 (b) r( ) X B(α ) X B(α + 1) B ( 47) 48 (a) O ω 2 O = 2 ℵ 0 (b) Bor( ω 2) = 2 ℵ 0 (a): 3 O {[s] : s ω> 2} ω> 2 = ℵ 0 43 ω> 2 = {s n : n ω} ϕ : P(ω) O; x n x [s n] ϕ O P(ω) = 2 ℵ 0 ψ : ω 2 O f ω 2 \ {f} ψ O ω 2 = 2 ℵ 0 (b): B : ω 1 P( ω 2) α < ω 1 B(α) = 2 ℵ 0 47 Bor( ω 2) = α<ω 1 B(α) 42 (b) Bor( ω 2) 2 ℵ 0 (a) 2 ℵ 0 O Bor( ω 2) α = 0 (a) B(0) = O = 2 ℵ 0 B(α) = 2 ℵ 0 B(α) B(α+1) B(α+1) 2 ℵ 0 B = B(α) { ω 2 \ x : x B(α)} η : ω B B(α + 1); f f ω B(α + 1) ω B (2 ℵ ℵ 0 ) ℵ 0 = 2 ℵ 0 α β < α B(β) = 2 ℵ 0 B(α) = β<α B(β) 42 (b) B(α) 2ℵ 0 B(α) 2 ℵ 0 O B(α) ( 48) 49 X ω 2 (1) X (2) O ω 2 M X = O M 44 (3) O ω 2 N X = O N (1) (2) (1) (3) (2) X = O M B = {O M : O ω 2 M ω 2 } B Bor( ω 2) B σ- X n B, n ω X n = (O n \ M 0 n) M 1 n, n ω M 0 n O n, M 1 n ω 2 \ O n 45 n ω X n B ( X n = O n \ ) ( M 0 ) n Mn 1 n ω n ω n ω n ω 43ω> 2 = { n 2 : n ω} 42 (b) ω> 2 ℵ 0 ω> 2 ℵ 0 44 A, B A B = (A \ B) (B \ A) 45 X n = O n (M 0 n M 1 n) 30

31 X B X = (O \ M 0 ) M 1 M 0 O, M 1 ω 2 \ O X = ( ( )) cl(o) \ M 0 (cl(o \ O)) M 1 ω 2 \ X = ( ( ω 2 \ cl(o)) \ M 1) ( ) M 0 (cl(o) \ O) ω 2 \ cl(o) M 1 M 0 (cl(o) \ O) ω 2 \ X B ( 49) 3.2 CH 34 κ < 2 κ ℵ 0 < 2 ℵ R ω 2 R = ω 2 = 2 ℵ 0 (Continuum Hypothesis CH) 2 ℵ 0 = ℵ 1 (ZFC) ZFC 46 R = 2 ℵ 0 R {x α : α < ω 1 } 50 (Sierpiński) (CH) R 2 R 2 = A B, A B = (i) x R A ({x} R) (ii) y R B (R {y}) CH R = {x α : α < ω 1 } A = {(x α, x β ) : α, β ω 1, α > β}, B = {(x α, x β ) : α, β ω 1, α β} R 2 = A B, A B = A, B (i), (ii) : x R x = x α α < ω 1 A ({x} R) = {(x α, x β ) : β < α } A ({x} R) α ℵ 0 B (R {y}) ℵ 0 CH R 2 = A B, A B = A (i) r α R, α < ω 1 C = {x R : α < ω 1 r α, x A} = ( ) A ({r α } R) ℵ 1 R \ C x R \ C {(x α, x ) : α < ω 1 } R 2 \ A = B (R {x }) B 46 [5] 31

32 ( 50) (Sierpiński [13]) (CH) f : [0, 1] 2 [0, 1] f(x, y) dx dy f(x, y) dy dx A, B R 2 50 f B y [0, 1] {x [0, 1] : f(x, y) 0} = B ([0, 1] {y}) f(x, y) dx dy = dy = 0. x [0, 1] {y [0, 1] : f(x, y) 1} = A ({x} [0, 1]) f(x, y) dy dx = 1 0 f(x, y) dy dx = 1 0 = dy = 1. f(x, y) dx dy ( 51) Tonelli f f dxdy f dydx CH Tonelli f 51 CH 52 (Laczkovich, Friedman, Freiling 47 ) ZFC M M f : [0, 1] 2 [0, 1] M f(x, y) dx dy f(x, y) dy dx M [3] 32

33 1. R R = A B (i) s R A ({x} R) < 2 ℵ 0 (ii) y R B (R {y}) < 2 ℵ ℵ 0 R 1. ZFC : R = {x α : α < 2 ω } non(n ) = 2 ℵ 0 (Martin s Axiom) 50 [1] 53 (Erdős [4]) (CH) analytic functions F z C {f(z) : f F} CH F analytic functions z C {f(z) : f F} f α, α < ω 1 F {α, β} [ω 1 ] 2 S α,β = {z C : f α (z) = f β (z)} S α,β [f, g analytic functions C C 0 {z C : f(z) = g(z)} ]. S = C \ {S α,β : {α, β} [ω 1 ] 2 } S z S f α (z ), α < ω 1 {f(z ) : f F} CH analytic functions F z C {f(z) : f F} C = {v α : α < ω 1 } analytic functions f α, α < ω 1 ( ) β < α f α f β f α (v β ) f β, β < α {v β : β < α} {w n : n ω} α < ω 1 ε n > 0, n ω 0 f α (z) = ε 0 (z w 0 ) + ε 1 (z w 0 )(z w 1 ) + ε 2 (z w 0 )(z w 1 )(z w 2 ) + ( ) f α F = {f α : α < ω 1 } F ( 53) 3.3 σ- σ- f 33

34 54 (Erdős-Sierpiński Duality Theorem) f : ω 2 ω 2 (1) f f = id ( ω 2) f (2) X P( ω 2) X M f X N. 13 X ω 2 X M ω 2 \ x N M Bor( ω 2) M 7 48 (b) Bor( ω 2) = 2 ℵ 0 2 ℵ 0 = ℵ 1 N {X α : α < ω 1 } X 0 = X ϕ : ω 1 ω 1 ϕ(α) = min{η < ω 1 : ( ξ<η ) ( ) X ξ \ {Xξ : ξ < sup ϕ(β)} 2 ℵ 0 } β<α : ϕ(β), β < α {X ξ : ξ < sup β<α ϕ(β)} {X ξ : ξ < sup β<α ϕ(β)} 4 ω 2 \ {X ξ : ξ < sup β<α ϕ(β)} 2 ℵ 0 2 ℵ 0 X X α, α < ω 1 M X X ξ ξ < ω 1 η = ξ + 1 ϕ(α) {η < ω 1 :...} min{η < ω 1 :...} α < ω 1 ( Y α = ξ<ϕ(α) ) ( ) X ξ \ {Xξ : ξ < sup ϕ(β)} β<α Y 0 = X 0 = X {Y α : α < ω 1 } 2 ℵ 0 ω 2 β < ω 1 α<β Y α = ξ<ϕ(β) X ξ Claim 54.1 X ω 2 β < ω 1 X α<β Y α X ξ < ω 1 X X ξ ξ < ϕ(β) β < ω 1 X X ξ X η = η<ϕ(β) α<β Y α ( 54) ω 2 {Z α : α < ω 1 } Z 0 = ω 2 \ X 0, Z α 2 ℵ 0 Claim 54.2 X ω 2 β < ω 1 X α<β Z α 34

35 Y 0 =X 0 Y 1 Y 2... {}}{{}}{{}}{{}}{ } {{ }} {{ }... Z 2 }{{} Z 1 } {{ } Z 0 = ω 2\X 0 α < ω 1 f α : Y α Z α f = {f α : α < ω 1 } {(f α ) 1 : α < ω 1 } Claim 54.1 Claim 54.2 f! ( 54) (1), (2) f add(n ), cof(n ) etc. 55 (Erdős-Sierpiński Duality Theorem Bartoszynski-Raisonnier-Stern ) add(n ) = cof(n ) f : ω 2 ω 2 (1) f f = id ( ω 2) f (2) X P( ω 2) X M f X N. add(n ) = cof(n ) add(m) = cof(m) = add(n ) = cof(n ) 54 ( 55) add(n ) = cof(n ) N M S. Shelah [16] 48 [9] 35

36 [1] Proofs from THE BOOK, M. Aigner, G.M. Ziegler, Springer-Verlag (1998). [2] T. Bartoszyński and H. Judah, Set Theory: on the structure of the real line, A K Peters, (1995), i ix, [3] Krzysztof Ciesielski, Set Theoretic Real Analysis, J. Appl. Anal. 3(2), (1997). [4] P. Erdős, An interpolation problem associated with the continuum hypothesis, Michigan Math. J., 11, 9 10 (1964). [5] 23 1, vol.37, no.5, (1998). 20 (2000), i iv, [6]!, Vol. 41 No. 2, (2002). [7] T. Jech, Set Theory, The Third Millennium Edition, revised and expanded 3rd rev. ed., Springer-Verlag (2003). [8] M. Holz, K. Steffens, E. Weitz, Introduction to Cardinal Arithmetic, Birkhäuser (1999). [9] A. Kanamori, The Higher Infinite, Springer Verlag (1994/1997), (1998). [10] S. Koppelberg, Einführung in die Logik und Mengenlehre, Vorlesungsskript an der Freien Universität Berlin, Sommersemester [11] K. Kunen, Set Theory, North-Holland, i xvi, (1980). [12] Azriel Levy, Basic Set Theory, Springer-Verlag (1979). [13] W. Sierpiński, Sur les rapports entre l existence des intégrales 1 0 f(x, y)dx, 1 0 f(x, y)dy et 1 0 dx 1 0 f(x, y)dy, Fund. Math. 1, (1920). Reprinted in Oeuvres Choisies, vol. II, [14] ;,, (1988). [15] J. C. Oxtoby, Measure and Category, Springer-Verlag, (1971/1980). [16] S. Shelah, Can you take Solovay s inaccessible away? Israel Journal of Mathematics 48, 1 47 (1984). 36

Lebesgue可測性に関するSoloayの定理と実数の集合の正則性=1This slide is available on ` `%%%`#`&12_`__~~~ౡ氀猀e

Lebesgue可測性に関するSoloayの定理と実数の集合の正則性=1This slide is available on ` `%%%`#`&12_`__~~~ౡ氀猀e Khomskii Lebesgue Soloay 1 Friday 27 th November 2015 1 This slide is available on http://slideshare.net/konn/lebesguesoloay 1 / 34 Khomskii 1 2 3 4 Khomskii 2 / 34 Khomskii Solovay 3 / 34 Khomskii Lebesgue

More information

Basic Math. 1 0 [ N Z Q Q c R C] 1, 2, 3,... natural numbers, N Def.(Definition) N (1) 1 N, (2) n N = n +1 N, (3) N (1), (2), n N n N (element). n/ N.

Basic Math. 1 0 [ N Z Q Q c R C] 1, 2, 3,... natural numbers, N Def.(Definition) N (1) 1 N, (2) n N = n +1 N, (3) N (1), (2), n N n N (element). n/ N. Basic Mathematics 16 4 16 3-4 (10:40-12:10) 0 1 1 2 2 2 3 (mapping) 5 4 ε-δ (ε-δ Logic) 6 5 (Potency) 9 6 (Equivalence Relation and Order) 13 7 Zorn (Axiom of Choice, Zorn s Lemma) 14 8 (Set and Topology)

More information

微分積分 サンプルページ この本の定価 判型などは, 以下の URL からご覧いただけます. このサンプルページの内容は, 初版 1 刷発行時のものです.

微分積分 サンプルページ この本の定価 判型などは, 以下の URL からご覧いただけます.   このサンプルページの内容は, 初版 1 刷発行時のものです. 微分積分 サンプルページ この本の定価 判型などは, 以下の URL からご覧いただけます. ttp://www.morikita.co.jp/books/mid/00571 このサンプルページの内容は, 初版 1 刷発行時のものです. i ii 014 10 iii [note] 1 3 iv 4 5 3 6 4 x 0 sin x x 1 5 6 z = f(x, y) 1 y = f(x)

More information

3 1 5 1.1........................... 5 1.1.1...................... 5 1.1.2........................ 6 1.1.3........................ 6 1.1.4....................... 6 1.1.5.......................... 7 1.1.6..........................

More information

2016 1. 2. 3. 4. 5. 6. 7. 8. 9. 10. 1 16 2 1 () X O 3 (O1) X O, O (O2) O O (O3) O O O X (X, O) O X X (O1), (O2), (O3) (O2) (O3) n (O2) U 1,..., U n O U k O k=1 (O3) U λ O( λ Λ) λ Λ U λ O 0 X 0 (O2) n =

More information

³ÎΨÏÀ

³ÎΨÏÀ 2017 12 12 Makoto Nakashima 2017 12 12 1 / 22 2.1. C, D π- C, D. A 1, A 2 C A 1 A 2 C A 3, A 4 D A 1 A 2 D Makoto Nakashima 2017 12 12 2 / 22 . (,, L p - ). Makoto Nakashima 2017 12 12 3 / 22 . (,, L p

More information

医系の統計入門第 2 版 サンプルページ この本の定価 判型などは, 以下の URL からご覧いただけます. このサンプルページの内容は, 第 2 版 1 刷発行時のものです.

医系の統計入門第 2 版 サンプルページ この本の定価 判型などは, 以下の URL からご覧いただけます.   このサンプルページの内容は, 第 2 版 1 刷発行時のものです. 医系の統計入門第 2 版 サンプルページ この本の定価 判型などは, 以下の URL からご覧いただけます. http://www.morikita.co.jp/books/mid/009192 このサンプルページの内容は, 第 2 版 1 刷発行時のものです. i 2 t 1. 2. 3 2 3. 6 4. 7 5. n 2 ν 6. 2 7. 2003 ii 2 2013 10 iii 1987

More information

2 1 κ c(t) = (x(t), y(t)) ( ) det(c (t), c x (t)) = det (t) x (t) y (t) y = x (t)y (t) x (t)y (t), (t) c (t) = (x (t)) 2 + (y (t)) 2. c (t) =

2 1 κ c(t) = (x(t), y(t)) ( ) det(c (t), c x (t)) = det (t) x (t) y (t) y = x (t)y (t) x (t)y (t), (t) c (t) = (x (t)) 2 + (y (t)) 2. c (t) = 1 1 1.1 I R 1.1.1 c : I R 2 (i) c C (ii) t I c (t) (0, 0) c (t) c(i) c c(t) 1.1.2 (1) (2) (3) (1) r > 0 c : R R 2 : t (r cos t, r sin t) (2) C f : I R c : I R 2 : t (t, f(t)) (3) y = x c : R R 2 : t (t,

More information

(iii) 0 V, x V, x + 0 = x. 0. (iv) x V, y V, x + y = 0., y x, y = x. (v) 1x = x. (vii) (α + β)x = αx + βx. (viii) (αβ)x = α(βx)., V, C.,,., (1)

(iii) 0 V, x V, x + 0 = x. 0. (iv) x V, y V, x + y = 0., y x, y = x. (v) 1x = x. (vii) (α + β)x = αx + βx. (viii) (αβ)x = α(βx)., V, C.,,., (1) 1. 1.1...,. 1.1.1 V, V x, y, x y x + y x + y V,, V x α, αx αx V,, (i) (viii) : x, y, z V, α, β C, (i) x + y = y + x. (ii) (x + y) + z = x + (y + z). 1 (iii) 0 V, x V, x + 0 = x. 0. (iv) x V, y V, x + y

More information

n 2 + π2 6 x [10 n x] x = lim n 10 n n 10 k x 1.1. a 1, a 2,, a n, (a n ) n=1 {a n } n=1 1.2 ( ). {a n } n=1 Q ε > 0 N N m, n N a m

n 2 + π2 6 x [10 n x] x = lim n 10 n n 10 k x 1.1. a 1, a 2,, a n, (a n ) n=1 {a n } n=1 1.2 ( ). {a n } n=1 Q ε > 0 N N m, n N a m 1 1 1 + 1 4 + + 1 n 2 + π2 6 x [10 n x] x = lim n 10 n n 10 k x 1.1. a 1, a 2,, a n, (a n ) n=1 {a n } n=1 1.2 ( ). {a n } n=1 Q ε > 0 N N m, n N a m a n < ε 1 1. ε = 10 1 N m, n N a m a n < ε = 10 1 N

More information

X G P G (X) G BG [X, BG] S 2 2 2 S 2 2 S 2 = { (x 1, x 2, x 3 ) R 3 x 2 1 + x 2 2 + x 2 3 = 1 } R 3 S 2 S 2 v x S 2 x x v(x) T x S 2 T x S 2 S 2 x T x S 2 = { ξ R 3 x ξ } R 3 T x S 2 S 2 x x T x S 2

More information

A, B, C. (1) A = A. (2) A = B B = A. (3) A = B, B = C A = C. A = B. (3)., f : A B g : B C. g f : A C, A = C. 7.1, A, B,. A = B, A, A A., A, A

A, B, C. (1) A = A. (2) A = B B = A. (3) A = B, B = C A = C. A = B. (3)., f : A B g : B C. g f : A C, A = C. 7.1, A, B,. A = B, A, A A., A, A 91 7,.,, ( ).,,.,.,. 7.1 A B, A B, A = B. 1), 1,.,. 7.1 A, B, 3. (i) A B. (ii) f : A B. (iii) A B. (i) (ii)., 6.9, (ii) (iii).,,,. 1), Ā = B.. A, Ā, Ā,. 92 7 7.2 A, B, C. (1) A = A. (2) A = B B = A. (3)

More information

8.1 Fubini 8.2 Fubini 9 (0%) 10 (50%) Carathéodory 10.3 Fubini 1 Introduction 1 (1) (2) {f n (x)} n=1 [a, b] K > 0 n, x f n (x) K < ( ) x [a

8.1 Fubini 8.2 Fubini 9 (0%) 10 (50%) Carathéodory 10.3 Fubini 1 Introduction 1 (1) (2) {f n (x)} n=1 [a, b] K > 0 n, x f n (x) K < ( ) x [a % 100% 1 Introduction 2 (100%) 2.1 2.2 2.3 3 (100%) 3.1 3.2 σ- 4 (100%) 4.1 4.2 5 (100%) 5.1 5.2 5.3 6 (100%) 7 (40%) 8 Fubini (90%) 2007.11.5 1 8.1 Fubini 8.2 Fubini 9 (0%) 10 (50%) 10.1 10.2 Carathéodory

More information

(2 X Poisso P (λ ϕ X (t = E[e itx ] = k= itk λk e k! e λ = (e it λ k e λ = e eitλ e λ = e λ(eit 1. k! k= 6.7 X N(, 1 ϕ X (t = e 1 2 t2 : Cauchy ϕ X (t

(2 X Poisso P (λ ϕ X (t = E[e itx ] = k= itk λk e k! e λ = (e it λ k e λ = e eitλ e λ = e λ(eit 1. k! k= 6.7 X N(, 1 ϕ X (t = e 1 2 t2 : Cauchy ϕ X (t 6 6.1 6.1 (1 Z ( X = e Z, Y = Im Z ( Z = X + iy, i = 1 (2 Z E[ e Z ] < E[ Im Z ] < Z E[Z] = E[e Z] + ie[im Z] 6.2 Z E[Z] E[ Z ] : E[ Z ] < e Z Z, Im Z Z E[Z] α = E[Z], Z = Z Z 1 {Z } E[Z] = α = α [ α ]

More information

: , 2.0, 3.0, 2.0, (%) ( 2.

: , 2.0, 3.0, 2.0, (%) ( 2. 2017 1 2 1.1...................................... 2 1.2......................................... 4 1.3........................................... 10 1.4................................. 14 1.5..........................................

More information

,,,,., = (),, (1) (4) :,,,, (1),. (2),, =. (3),,. (4),,,,.. (1) (3), (4).,,., () : = , ( ) : = F 1 + F 2 + F 3 + ( ) : = i Fj j=1 2

,,,,., = (),, (1) (4) :,,,, (1),. (2),, =. (3),,. (4),,,,.. (1) (3), (4).,,., () : = , ( ) : = F 1 + F 2 + F 3 + ( ) : = i Fj j=1 2 6 2 6.1 2 2, 2 5.2 R 2, 2 (R 2, B, µ)., R 2,,., 1, 2, 3,., 1, 2, 3,,. () : = 1 + 2 + 3 + (6.1.1).,,, 1 ,,,,., = (),, (1) (4) :,,,, (1),. (2),, =. (3),,. (4),,,,.. (1) (3), (4).,,., () : = 1 + 2 + 3 +,

More information

u = u(t, x 1,..., x d ) : R R d C λ i = 1 := x 2 1 x 2 d d Euclid Laplace Schrödinger N := {1, 2, 3,... } Z := {..., 3, 2, 1,, 1, 2, 3

u = u(t, x 1,..., x d ) : R R d C λ i = 1 := x 2 1 x 2 d d Euclid Laplace Schrödinger N := {1, 2, 3,... } Z := {..., 3, 2, 1,, 1, 2, 3 2 2 1 5 5 Schrödinger i u t + u = λ u 2 u. u = u(t, x 1,..., x d ) : R R d C λ i = 1 := 2 + + 2 x 2 1 x 2 d d Euclid Laplace Schrödinger 3 1 1.1 N := {1, 2, 3,... } Z := {..., 3, 2, 1,, 1, 2, 3,... } Q

More information

n ξ n,i, i = 1,, n S n ξ n,i n 0 R 1,.. σ 1 σ i .10.14.15 0 1 0 1 1 3.14 3.18 3.19 3.14 3.14,. ii 1 1 1.1..................................... 1 1............................... 3 1.3.........................

More information

III 1 (X, d) d U d X (X, d). 1. (X, d).. (i) d(x, y) d(z, y) d(x, z) (ii) d(x, y) d(z, w) d(x, z) + d(y, w) 2. (X, d). F X.. (1), X F, (2) F 1, F 2 F

III 1 (X, d) d U d X (X, d). 1. (X, d).. (i) d(x, y) d(z, y) d(x, z) (ii) d(x, y) d(z, w) d(x, z) + d(y, w) 2. (X, d). F X.. (1), X F, (2) F 1, F 2 F III 1 (X, d) d U d X (X, d). 1. (X, d).. (i) d(x, y) d(z, y) d(x, z) (ii) d(x, y) d(z, w) d(x, z) + d(y, w) 2. (X, d). F X.. (1), X F, (2) F 1, F 2 F F 1 F 2 F, (3) F λ F λ F λ F. 3., A λ λ A λ. B λ λ

More information

untitled

untitled 1 kaiseki1.lec(tex) 19951228 19960131;0204 14;16 26;0329; 0410;0506;22;0603-05;08;20;0707;09;11-22;24-28;30;0807;12-24;27;28; 19970104(σ,F = µ);0212( ); 0429(σ- A n ); 1221( ); 20000529;30(L p ); 20050323(

More information

Mathematical Logic I 12 Contents I Zorn

Mathematical Logic I 12 Contents I Zorn Mathematical Logic I 12 Contents I 2 1 3 1.1............................. 3 1.2.......................... 5 1.3 Zorn.................. 5 2 6 2.1.............................. 6 2.2..............................

More information

ohpmain.dvi

ohpmain.dvi fujisawa@ism.ac.jp 1 Contents 1. 2. 3. 4. γ- 2 1. 3 10 5.6, 5.7, 5.4, 5.5, 5.8, 5.5, 5.3, 5.6, 5.4, 5.2. 5.5 5.6 +5.7 +5.4 +5.5 +5.8 +5.5 +5.3 +5.6 +5.4 +5.2 =5.5. 10 outlier 5 5.6, 5.7, 5.4, 5.5, 5.8,

More information

°ÌÁê¿ô³ØII

°ÌÁê¿ô³ØII July 14, 2007 Brouwer f f(x) = x x f(z) = 0 2 f : S 2 R 2 f(x) = f( x) x S 2 3 3 2 - - - 1. X x X U(x) U(x) x U = {U(x) x X} X 1. U(x) A U(x) x 2. A U(x), A B B U(x) 3. A, B U(x) A B U(x) 4. A U(x),

More information

第10章 アイソパラメトリック要素

第10章 アイソパラメトリック要素 June 5, 2019 1 / 26 10.1 ( ) 2 / 26 10.2 8 2 3 4 3 4 6 10.1 4 2 3 4 3 (a) 4 (b) 2 3 (c) 2 4 10.1: 3 / 26 8.3 3 5.1 4 10.4 Gauss 10.1 Ω i 2 3 4 Ξ 3 4 6 Ξ ( ) Ξ 5.1 Gauss ˆx : Ξ Ω i ˆx h u 4 / 26 10.2.1

More information

Riemann-Stieltjes Poland S. Lojasiewicz [1] An introduction to the theory of real functions, John Wiley & Sons, Ltd., Chichester, 1988.,,,,. Riemann-S

Riemann-Stieltjes Poland S. Lojasiewicz [1] An introduction to the theory of real functions, John Wiley & Sons, Ltd., Chichester, 1988.,,,,. Riemann-S Riemnn-Stieltjes Polnd S. Lojsiewicz [1] An introduction to the theory of rel functions, John Wiley & Sons, Ltd., Chichester, 1988.,,,, Riemnn-Stieltjes 1 2 2 5 3 6 4 Jordn 13 5 Riemnn-Stieltjes 15 6 Riemnn-Stieltjes

More information

1 Introduction 1 (1) (2) (3) () {f n (x)} n=1 [a, b] K > 0 n, x f n (x) K < ( ) x [a, b] lim f n (x) f(x) (1) f(x)? (2) () f(x)? b lim a f n (x)dx = b

1 Introduction 1 (1) (2) (3) () {f n (x)} n=1 [a, b] K > 0 n, x f n (x) K < ( ) x [a, b] lim f n (x) f(x) (1) f(x)? (2) () f(x)? b lim a f n (x)dx = b 1 Introduction 2 2.1 2.2 2.3 3 3.1 3.2 σ- 4 4.1 4.2 5 5.1 5.2 5.3 6 7 8. Fubini,,. 1 1 Introduction 1 (1) (2) (3) () {f n (x)} n=1 [a, b] K > 0 n, x f n (x) K < ( ) x [a, b] lim f n (x) f(x) (1) f(x)?

More information

..3. Ω, Ω F, P Ω, F, P ). ) F a) A, A,..., A i,... F A i F. b) A F A c F c) Ω F. ) A F A P A),. a) 0 P A) b) P Ω) c) [ ] A, A,..., A i,... F i j A i A

..3. Ω, Ω F, P Ω, F, P ). ) F a) A, A,..., A i,... F A i F. b) A F A c F c) Ω F. ) A F A P A),. a) 0 P A) b) P Ω) c) [ ] A, A,..., A i,... F i j A i A .. Laplace ). A... i),. ω i i ). {ω,..., ω } Ω,. ii) Ω. Ω. A ) r, A P A) P A) r... ).. Ω {,, 3, 4, 5, 6}. i i 6). A {, 4, 6} P A) P A) 3 6. ).. i, j i, j) ) Ω {i, j) i 6, j 6}., 36. A. A {i, j) i j }.

More information

page: 1 1 Club guessing sequence , 1). M. Foreman ([ 7 ], [ 8 ] ). 1960,,,, ZFC,,.,,., ZFC,, 20.. G. Cantor.., Zermelo ZFC 2).,., ZFC,., ZFC

page: 1 1 Club guessing sequence , 1). M. Foreman ([ 7 ], [ 8 ] ). 1960,,,, ZFC,,.,,., ZFC,, 20.. G. Cantor.., Zermelo ZFC 2).,., ZFC,., ZFC page: 1 1 Club guessing sequence 1 1.1 1980, 1). M. Foreman ([ 7 ], [ 8 ] ). 1960,,,, ZFC,,.,,., ZFC,, 20.. G. Cantor.., Zermelo ZFC 2).,., ZFC,., ZFC ZFC, ZFC., K. Gödel [19] L P. Cohen [ 4 ], [ 5 ].,

More information

四変数基本対称式の解放

四変数基本対称式の解放 The second-thought of the Galois-style way to solve a quartic equation Oomori, Yasuhiro in Himeji City, Japan Jan.6, 013 Abstract v ρ (v) Step1.5 l 3 1 6. l 3 7. Step - V v - 3 8. Step1.3 - - groupe groupe

More information

v er.1/ c /(21)

v er.1/ c /(21) 12 -- 1 1 2009 1 17 1-1 1-2 1-3 1-4 2 2 2 1-5 1 1-6 1 1-7 1-1 1-2 1-3 1-4 1-5 1-6 1-7 c 2011 1/(21) 12 -- 1 -- 1 1--1 1--1--1 1 2009 1 n n α { n } α α { n } lim n = α, n α n n ε n > N n α < ε N {1, 1,

More information

201711grade1ouyou.pdf

201711grade1ouyou.pdf 2017 11 26 1 2 52 3 12 13 22 23 32 33 42 3 5 3 4 90 5 6 A 1 2 Web Web 3 4 1 2... 5 6 7 7 44 8 9 1 2 3 1 p p >2 2 A 1 2 0.6 0.4 0.52... (a) 0.6 0.4...... B 1 2 0.8-0.2 0.52..... (b) 0.6 0.52.... 1 A B 2

More information

B [ 0.1 ] x > 0 x 6= 1 f(x) µ 1 1 xn 1 + sin sin x 1 x 1 f(x) := lim. n x n (1) lim inf f(x) (2) lim sup f(x) x 1 0 x 1 0 (

B [ 0.1 ] x > 0 x 6= 1 f(x) µ 1 1 xn 1 + sin sin x 1 x 1 f(x) := lim. n x n (1) lim inf f(x) (2) lim sup f(x) x 1 0 x 1 0 ( . 28 4 14 [.1 ] x > x 6= 1 f(x) µ 1 1 xn 1 + sin + 2 + sin x 1 x 1 f(x) := lim. 1 + x n (1) lim inf f(x) (2) lim sup f(x) x 1 x 1 (3) lim inf x 1+ f(x) (4) lim sup f(x) x 1+ [.2 ] [, 1] Ω æ x (1) (2) nx(1

More information

x () g(x) = f(t) dt f(x), F (x) 3x () g(x) g (x) f(x), F (x) (3) h(x) = x 3x tf(t) dt.9 = {(x, y) ; x, y, x + y } f(x, y) = xy( x y). h (x) f(x), F (x

x () g(x) = f(t) dt f(x), F (x) 3x () g(x) g (x) f(x), F (x) (3) h(x) = x 3x tf(t) dt.9 = {(x, y) ; x, y, x + y } f(x, y) = xy( x y). h (x) f(x), F (x [ ] IC. f(x) = e x () f(x) f (x) () lim f(x) lim f(x) x + x (3) lim f(x) lim f(x) x + x (4) y = f(x) ( ) ( s46). < a < () a () lim a log xdx a log xdx ( ) n (3) lim log k log n n n k=.3 z = log(x + y ),

More information

I A A441 : April 15, 2013 Version : 1.1 I Kawahira, Tomoki TA (Shigehiro, Yoshida )

I A A441 : April 15, 2013 Version : 1.1 I   Kawahira, Tomoki TA (Shigehiro, Yoshida ) I013 00-1 : April 15, 013 Version : 1.1 I Kawahira, Tomoki TA (Shigehiro, Yoshida) http://www.math.nagoya-u.ac.jp/~kawahira/courses/13s-tenbou.html pdf * 4 15 4 5 13 e πi = 1 5 0 5 7 3 4 6 3 6 10 6 17

More information

2012 IA 8 I p.3, 2 p.19, 3 p.19, 4 p.22, 5 p.27, 6 p.27, 7 p

2012 IA 8 I p.3, 2 p.19, 3 p.19, 4 p.22, 5 p.27, 6 p.27, 7 p 2012 IA 8 I 1 10 10 29 1. [0, 1] n x = 1 (n = 1, 2, 3,...) 2 f(x) = n 0 [0, 1] 2. 1 x = 1 (n = 1, 2, 3,...) 2 f(x) = n 0 [0, 1] 1 0 f(x)dx 3. < b < c [, c] b [, c] 4. [, b] f(x) 1 f(x) 1 f(x) [, b] 5.

More information

i 18 2H 2 + O 2 2H 2 + ( ) 3K

i 18 2H 2 + O 2 2H 2 + ( ) 3K i 18 2H 2 + O 2 2H 2 + ( ) 3K ii 1 1 1.1.................................. 1 1.2........................................ 3 1.3......................................... 3 1.4....................................

More information

1. R n Ω ε G ε 0 Ω ε B n 2 Ωε = with Bu = 0 on Ω ε i=1 x 2 i ε +0 B Bu = u (Dirichlet, D Ω ε ), Bu = u ν (Neumann, N Ω ε ), Ω ε G ( ) / 25

1. R n Ω ε G ε 0 Ω ε B n 2 Ωε = with Bu = 0 on Ω ε i=1 x 2 i ε +0 B Bu = u (Dirichlet, D Ω ε ), Bu = u ν (Neumann, N Ω ε ), Ω ε G ( ) / 25 .. IV 2012 10 4 ( ) 2012 10 4 1 / 25 1. R n Ω ε G ε 0 Ω ε B n 2 Ωε = with Bu = 0 on Ω ε i=1 x 2 i ε +0 B Bu = u (Dirichlet, D Ω ε ), Bu = u ν (Neumann, N Ω ε ), Ω ε G ( ) 2012 10 4 2 / 25 1. Ω ε B ε t

More information

,. Black-Scholes u t t, x c u 0 t, x x u t t, x c u t, x x u t t, x + σ x u t, x + rx ut, x rux, t 0 x x,,.,. Step 3, 7,,, Step 6., Step 4,. Step 5,,.

,. Black-Scholes u t t, x c u 0 t, x x u t t, x c u t, x x u t t, x + σ x u t, x + rx ut, x rux, t 0 x x,,.,. Step 3, 7,,, Step 6., Step 4,. Step 5,,. 9 α ν β Ξ ξ Γ γ o δ Π π ε ρ ζ Σ σ η τ Θ θ Υ υ ι Φ φ κ χ Λ λ Ψ ψ µ Ω ω Def, Prop, Th, Lem, Note, Remark, Ex,, Proof, R, N, Q, C [a, b {x R : a x b} : a, b {x R : a < x < b} : [a, b {x R : a x < b} : a,

More information

B2 ( 19 ) Lebesgue ( ) ( ) 0 This note is c 2007 by Setsuo Taniguchi. It may be used for personal or classroom purposes, but not for commercia

B2 ( 19 ) Lebesgue ( ) ( ) 0 This note is c 2007 by Setsuo Taniguchi. It may be used for personal or classroom purposes, but not for commercia B2 ( 19) Lebesgue ( ) ( 19 7 12 ) 0 This note is c 2007 by Setsuo Taniguchi. It may be used for personal or classroom purposes, but not for commercial purposes. i Riemann f n : [0, 1] R 1, x = k (1 m

More information

2 (March 13, 2010) N Λ a = i,j=1 x i ( d (a) i,j x j ), Λ h = N i,j=1 x i ( d (h) i,j x j ) B a B h B a = N i,j=1 ν i d (a) i,j, B h = x j N i,j=1 ν i

2 (March 13, 2010) N Λ a = i,j=1 x i ( d (a) i,j x j ), Λ h = N i,j=1 x i ( d (h) i,j x j ) B a B h B a = N i,j=1 ν i d (a) i,j, B h = x j N i,j=1 ν i 1. A. M. Turing [18] 60 Turing A. Gierer H. Meinhardt [1] : (GM) ) a t = D a a xx µa + ρ (c a2 h + ρ 0 (0 < x < l, t > 0) h t = D h h xx νh + c ρ a 2 (0 < x < l, t > 0) a x = h x = 0 (x = 0, l) a = a(x,

More information

Lebesgue Fubini L p Banach, Hilbert Höld

Lebesgue Fubini L p Banach, Hilbert Höld II (Analysis II) Lebesgue (Applications of Lebesgue Integral Theory) 1 (Seiji HIABA) 1 ( ),,, ( ) 1 1 1.1 1 Lebesgue........................ 1 1.2 2 Fubini...................... 2 2 L p 5 2.1 Banach, Hilbert..............................

More information

Z: Q: R: C: sin 6 5 ζ a, b

Z: Q: R: C: sin 6 5 ζ a, b Z: Q: R: C: 3 3 7 4 sin 6 5 ζ 9 6 6............................... 6............................... 6.3......................... 4 7 6 8 8 9 3 33 a, b a bc c b a a b 5 3 5 3 5 5 3 a a a a p > p p p, 3,

More information

τ τ

τ τ 1 1 1.1 1.1.1 τ τ 2 1 1.1.2 1.1 1.1 µ ν M φ ν end ξ µ ν end ψ ψ = µ + ν end φ ν = 1 2 (µφ + ν end) ξ = ν (µ + ν end ) + 1 1.1 3 6.18 a b 1.2 a b 1.1.3 1.1.3.1 f R{A f } A f 1 B R{AB f 1 } COOH A OH B 1.3

More information

II

II II 2009 1 II Euclid Euclid i 1 1 2 7 3 11 4 18 5 20 6 22 7 26 8 Hausdorff 29 36 1 1 1.1 E n n Euclid E n n R n = {(x 1,..., x n ) x i R} x, y = x 1 y 1 + + x n y n (x, y E n ), x = x, x 1/2 = { (x 1 )

More information

II A A441 : October 02, 2014 Version : Kawahira, Tomoki TA (Kondo, Hirotaka )

II A A441 : October 02, 2014 Version : Kawahira, Tomoki TA (Kondo, Hirotaka ) II 214-1 : October 2, 214 Version : 1.1 Kawahira, Tomoki TA (Kondo, Hirotaka ) http://www.math.nagoya-u.ac.jp/~kawahira/courses/14w-biseki.html pdf 1 2 1 9 1 16 1 23 1 3 11 6 11 13 11 2 11 27 12 4 12 11

More information

D 24 D D D

D 24 D D D 5 Paper I.R. 2001 5 Paper HP Paper 5 3 5.1................................................... 3 5.2.................................................... 4 5.3.......................................... 6

More information

1 1.1 ( ). z = a + bi, a, b R 0 a, b 0 a 2 + b 2 0 z = a + bi = ( ) a 2 + b 2 a a 2 + b + b 2 a 2 + b i 2 r = a 2 + b 2 θ cos θ = a a 2 + b 2, sin θ =

1 1.1 ( ). z = a + bi, a, b R 0 a, b 0 a 2 + b 2 0 z = a + bi = ( ) a 2 + b 2 a a 2 + b + b 2 a 2 + b i 2 r = a 2 + b 2 θ cos θ = a a 2 + b 2, sin θ = 1 1.1 ( ). z = + bi,, b R 0, b 0 2 + b 2 0 z = + bi = ( ) 2 + b 2 2 + b + b 2 2 + b i 2 r = 2 + b 2 θ cos θ = 2 + b 2, sin θ = b 2 + b 2 2π z = r(cos θ + i sin θ) 1.2 (, ). 1. < 2. > 3. ±,, 1.3 ( ). A

More information

i Version 1.1, (2012/02/22 24),.,..,.,,. R-space,, ( R- space),, Kahler (Kähler C-space)., R-space,., R-space, Hermite,.

i Version 1.1, (2012/02/22 24),.,..,.,,. R-space,, ( R- space),, Kahler (Kähler C-space)., R-space,., R-space, Hermite,. R-space ( ) Version 1.1 (2012/02/29) i Version 1.1, (2012/02/22 24),.,..,.,,. R-space,, ( R- space),, Kahler (Kähler C-space)., R-space,., R-space, Hermite,. ii 1 Lie 1 1.1 Killing................................

More information

Z: Q: R: C:

Z: Q: R: C: 0 Z: Q: R: C: 3 4 4 4................................ 4 4.................................. 7 5 3 5...................... 3 5......................... 40 5.3 snz) z)........................... 4 6 46 x

More information

i iii 1 ZFC Skolem

i iii 1 ZFC Skolem i iii 1 ZFC 1 1.1................... 2 1.2........................... 4 1.3 Skolem..................... 6 1.4...................... 8 11 2 13 2.1..................... 13 2.2........ 15 2.3.........................

More information

Exercise in Mathematics IIB IIB (Seiji HIRABA) 0.1, =,,,. n R n, B(a; δ) = B δ (a) or U δ (a) = U(a;, δ) δ-. R n,,,, ;,,, ;,,. (S, O),,,,,,,, 1 C I 2

Exercise in Mathematics IIB IIB (Seiji HIRABA) 0.1, =,,,. n R n, B(a; δ) = B δ (a) or U δ (a) = U(a;, δ) δ-. R n,,,, ;,,, ;,,. (S, O),,,,,,,, 1 C I 2 Exercise in Mathematics IIB IIB (Seiji HIRABA) 0.1, =,,,. n R n, B(a; δ) = B δ (a) or U δ (a) = U(a;, δ) δ-. R n,,,, ;,,, ;,,. (S, O),,,,,,,, 1 C I 2 C II,,,,,,,,,,, 0.2. 1 (Connectivity) 3 2 (Compactness)

More information

I, II 1, A = A 4 : 6 = max{ A, } A A 10 10%

I, II 1, A = A 4 : 6 = max{ A, } A A 10 10% 1 2006.4.17. A 3-312 tel: 092-726-4774, e-mail: hara@math.kyushu-u.ac.jp, http://www.math.kyushu-u.ac.jp/ hara/lectures/lectures-j.html Office hours: B A I ɛ-δ ɛ-δ 1. 2. A 1. 1. 2. 3. 4. 5. 2. ɛ-δ 1. ɛ-n

More information

untitled

untitled 2 : n =1, 2,, 10000 0.5125 0.51 0.5075 0.505 0.5025 0.5 0.4975 0.495 0 2000 4000 6000 8000 10000 2 weak law of large numbers 1. X 1,X 2,,X n 2. µ = E(X i ),i=1, 2,,n 3. σi 2 = V (X i ) σ 2,i=1, 2,,n ɛ>0

More information

Akito Tsuboi June 22, T ϕ T M M ϕ M M ϕ T ϕ 2 Definition 1 X, Y, Z,... 1

Akito Tsuboi June 22, T ϕ T M M ϕ M M ϕ T ϕ 2 Definition 1 X, Y, Z,... 1 Akito Tsuboi June 22, 2006 1 T ϕ T M M ϕ M M ϕ T ϕ 2 Definition 1 X, Y, Z,... 1 1. X, Y, Z,... 2. A, B (A), (A) (B), (A) (B), (A) (B) Exercise 2 1. (X) (Y ) 2. ((X) (Y )) (Z) 3. (((X) (Y )) (Z)) Exercise

More information

I A A441 : April 21, 2014 Version : Kawahira, Tomoki TA (Kondo, Hirotaka ) Google

I A A441 : April 21, 2014 Version : Kawahira, Tomoki TA (Kondo, Hirotaka ) Google I4 - : April, 4 Version :. Kwhir, Tomoki TA (Kondo, Hirotk) Google http://www.mth.ngoy-u.c.jp/~kwhir/courses/4s-biseki.html pdf 4 4 4 4 8 e 5 5 9 etc. 5 6 6 6 9 n etc. 6 6 6 3 6 3 7 7 etc 7 4 7 7 8 5 59

More information

211 kotaro@math.titech.ac.jp 1 R *1 n n R n *2 R n = {(x 1,..., x n ) x 1,..., x n R}. R R 2 R 3 R n R n R n D D R n *3 ) (x 1,..., x n ) f(x 1,..., x n ) f D *4 n 2 n = 1 ( ) 1 f D R n f : D R 1.1. (x,

More information

newmain.dvi

newmain.dvi 数論 サンプルページ この本の定価 判型などは, 以下の URL からご覧いただけます. http://www.morikita.co.jp/books/mid/008142 このサンプルページの内容は, 第 2 版 1 刷発行当時のものです. Daniel DUVERNEY: THÉORIE DES NOMBRES c Dunod, Paris, 1998, This book is published

More information

2 G(k) e ikx = (ik) n x n n! n=0 (k ) ( ) X n = ( i) n n k n G(k) k=0 F (k) ln G(k) = ln e ikx n κ n F (k) = F (k) (ik) n n= n! κ n κ n = ( i) n n k n

2 G(k) e ikx = (ik) n x n n! n=0 (k ) ( ) X n = ( i) n n k n G(k) k=0 F (k) ln G(k) = ln e ikx n κ n F (k) = F (k) (ik) n n= n! κ n κ n = ( i) n n k n . X {x, x 2, x 3,... x n } X X {, 2, 3, 4, 5, 6} X x i P i. 0 P i 2. n P i = 3. P (i ω) = i ω P i P 3 {x, x 2, x 3,... x n } ω P i = 6 X f(x) f(x) X n n f(x i )P i n x n i P i X n 2 G(k) e ikx = (ik) n

More information

4................................. 4................................. 4 6................................. 6................................. 9.................................................... 3..3..........................

More information

d ϕ i) t d )t0 d ϕi) ϕ i) t x j t d ) ϕ t0 t α dx j d ) ϕ i) t dx t0 j x j d ϕ i) ) t x j dx t0 j f i x j ξ j dx i + ξ i x j dx j f i ξ i x j dx j d )

d ϕ i) t d )t0 d ϕi) ϕ i) t x j t d ) ϕ t0 t α dx j d ) ϕ i) t dx t0 j x j d ϕ i) ) t x j dx t0 j f i x j ξ j dx i + ξ i x j dx j f i ξ i x j dx j d ) 23 M R M ϕ : R M M ϕt, x) ϕ t x) ϕ s ϕ t ϕ s+t, ϕ 0 id M M ϕ t M ξ ξ ϕ t d ϕ tx) ξϕ t x)) U, x 1,...,x n )) ϕ t x) ϕ 1) t x),...,ϕ n) t x)), ξx) ξ i x) d ϕi) t x) ξ i ϕ t x)) M f ϕ t f)x) f ϕ t )x) fϕ

More information

2000年度『数学展望 I』講義録

2000年度『数学展望 I』講義録 2000 I I IV I II 2000 I I IV I-IV. i ii 3.10 (http://www.math.nagoya-u.ac.jp/ kanai/) 2000 A....1 B....4 C....10 D....13 E....17 Brouwer A....21 B....26 C....33 D....39 E. Sperner...45 F....48 A....53

More information

I, II 1, 2 ɛ-δ 100 A = A 4 : 6 = max{ A, } A A 10

I, II 1, 2 ɛ-δ 100 A = A 4 : 6 = max{ A, } A A 10 1 2007.4.13. A 3-312 tel: 092-726-4774, e-mail: hara@math.kyushu-u.ac.jp, http://www.math.kyushu-u.ac.jp/ hara/lectures/lectures-j.html Office hours: B A I ɛ-δ ɛ-δ 1. 2. A 0. 1. 1. 2. 3. 2. ɛ-δ 1. ɛ-n

More information

第86回日本感染症学会総会学術集会後抄録(I)

第86回日本感染症学会総会学術集会後抄録(I) κ κ κ κ κ κ μ μ β β β γ α α β β γ α β α α α γ α β β γ μ β β μ μ α ββ β β β β β β β β β β β β β β β β β β γ β μ μ μ μμ μ μ μ μ β β μ μ μ μ μ μ μ μ μ μ μ μ μ μ β

More information

Dynkin Serre Weyl

Dynkin Serre Weyl Dynkin Naoya Enomoto 2003.3. paper Dynkin Introduction Dynkin Lie Lie paper 1 0 Introduction 3 I ( ) Lie Dynkin 4 1 ( ) Lie 4 1.1 Lie ( )................................ 4 1.2 Killing form...........................................

More information

A S hara/lectures/lectures-j.html ϵ-n 1 ϵ-n lim n a n = α n a n α 2 lim a n = 0 1 n a k n n k= ϵ

A S hara/lectures/lectures-j.html ϵ-n 1 ϵ-n lim n a n = α n a n α 2 lim a n = 0 1 n a k n n k= ϵ A S1-20 http://www2.mth.kyushu-u.c.jp/ hr/lectures/lectures-j.html 1 1 1.1 ϵ-n 1 ϵ-n lim n n = α n n α 2 lim n = 0 1 n k n n k=1 0 1.1.7 ϵ-n 1.1.1 n α n n α lim n n = α ϵ N(ϵ) n > N(ϵ) n α < ϵ (1.1.1)

More information

量子力学 問題

量子力学 問題 3 : 203 : 0. H = 0 0 2 6 0 () = 6, 2 = 2, 3 = 3 3 H 6 2 3 ϵ,2,3 (2) ψ = (, 2, 3 ) ψ Hψ H (3) P i = i i P P 2 = P 2 P 3 = P 3 P = O, P 2 i = P i (4) P + P 2 + P 3 = E 3 (5) i ϵ ip i H 0 0 (6) R = 0 0 [H,

More information

1 I

1 I 1 I 3 1 1.1 R x, y R x + y R x y R x, y, z, a, b R (1.1) (x + y) + z = x + (y + z) (1.2) x + y = y + x (1.3) 0 R : 0 + x = x x R (1.4) x R, 1 ( x) R : x + ( x) = 0 (1.5) (x y) z = x (y z) (1.6) x y =

More information

1 (Berry,1975) 2-6 p (S πr 2 )p πr 2 p 2πRγ p p = 2γ R (2.5).1-1 : : : : ( ).2 α, β α, β () X S = X X α X β (.1) 1 2

1 (Berry,1975) 2-6 p (S πr 2 )p πr 2 p 2πRγ p p = 2γ R (2.5).1-1 : : : : ( ).2 α, β α, β () X S = X X α X β (.1) 1 2 2005 9/8-11 2 2.2 ( 2-5) γ ( ) γ cos θ 2πr πρhr 2 g h = 2γ cos θ ρgr (2.1) γ = ρgrh (2.2) 2 cos θ θ cos θ = 1 (2.2) γ = 1 ρgrh (2.) 2 2. p p ρgh p ( ) p p = p ρgh (2.) h p p = 2γ r 1 1 (Berry,1975) 2-6

More information

1 a b = max{a, b}, a b = mi{a, b} a 1 a 2 a a 1 a = max{a 1,... a }, a 1 a = mi{a 1,... a }. A sup A, if A A A A A sup A sup A = + A if A = ± y = arct

1 a b = max{a, b}, a b = mi{a, b} a 1 a 2 a a 1 a = max{a 1,... a }, a 1 a = mi{a 1,... a }. A sup A, if A A A A A sup A sup A = + A if A = ± y = arct 27 6 2 1 2 2 5 3 8 4 13 5 16 6 19 7 23 8 27 N Z = {, ±1, ±2,... }, R =, R + = [, + ), R = [, ], C =. a b = max{a, b}, a b = mi{a, b}, a a, a a. f : X R [a < f < b] = {x X; a < f(x) < b}. X [f] = [f ],

More information

1 1 sin cos P (primary) S (secondly) 2 P S A sin(ω2πt + α) A ω 1 ω α V T m T m 1 100Hz m 2 36km 500Hz. 36km 1

1 1 sin cos P (primary) S (secondly) 2 P S A sin(ω2πt + α) A ω 1 ω α V T m T m 1 100Hz m 2 36km 500Hz. 36km 1 sin cos P (primary) S (secondly) 2 P S A sin(ω2πt + α) A ω ω α 3 3 2 2V 3 33+.6T m T 5 34m Hz. 34 3.4m 2 36km 5Hz. 36km m 34 m 5 34 + m 5 33 5 =.66m 34m 34 x =.66 55Hz, 35 5 =.7 485.7Hz 2 V 5Hz.5V.5V V

More information

1 X X A, B X = A B A B A B X 1.1 R R I I a, b(a < b) I a x b = x I 1.2 R A 1.3 X : (1)X (2)X X (3)X A, B X = A B A B = 1.4 f : X Y X Y ( ) A Y A Y A f

1 X X A, B X = A B A B A B X 1.1 R R I I a, b(a < b) I a x b = x I 1.2 R A 1.3 X : (1)X (2)X X (3)X A, B X = A B A B = 1.4 f : X Y X Y ( ) A Y A Y A f 1 X X A, B X = A B A B A B X 1.1 R R I I a, b(a < b) I a x b = x I 1. R A 1.3 X : (1)X ()X X (3)X A, B X = A B A B = 1.4 f : X Y X Y ( ) A Y A Y A f 1 (A) f X X f 1 (A) = X f 1 (A) = A a A f f(x) = a x

More information

1 Abstract 2 3 n a ax 2 + bx + c = 0 (a 0) (1) ( x + b ) 2 = b2 4ac 2a 4a 2 D = b 2 4ac > 0 (1) 2 D = 0 D < 0 x + b 2a = ± b2 4ac 2a b ± b 2

1 Abstract 2 3 n a ax 2 + bx + c = 0 (a 0) (1) ( x + b ) 2 = b2 4ac 2a 4a 2 D = b 2 4ac > 0 (1) 2 D = 0 D < 0 x + b 2a = ± b2 4ac 2a b ± b 2 1 Abstract n 1 1.1 a ax + bx + c = 0 (a 0) (1) ( x + b ) = b 4ac a 4a D = b 4ac > 0 (1) D = 0 D < 0 x + b a = ± b 4ac a b ± b 4ac a b a b ± 4ac b i a D (1) ax + bx + c D 0 () () (015 8 1 ) 1. D = b 4ac

More information

() Remrk I = [0, ] [x i, x i ]. (x : ) f(x) = 0 (x : ) ξ i, (f) = f(ξ i )(x i x i ) = (x i x i ) = ξ i, (f) = f(ξ i )(x i x i ) = 0 (f) 0.

() Remrk I = [0, ] [x i, x i ]. (x : ) f(x) = 0 (x : ) ξ i, (f) = f(ξ i )(x i x i ) = (x i x i ) = ξ i, (f) = f(ξ i )(x i x i ) = 0 (f) 0. () 6 f(x) [, b] 6. Riemnn [, b] f(x) S f(x) [, b] (Riemnn) = x 0 < x < x < < x n = b. I = [, b] = {x,, x n } mx(x i x i ) =. i [x i, x i ] ξ i n (f) = f(ξ i )(x i x i ) i=. (ξ i ) (f) 0( ), ξ i, S, ε >

More information

平成 28 年度 ( 第 38 回 ) 数学入門公開講座テキスト ( 京都大学数理解析研究所, 平成 ~8 28 月年 48 日開催月 1 日 semantics FB 1 x, y, z,... FB 1. FB (Boolean) Functional

平成 28 年度 ( 第 38 回 ) 数学入門公開講座テキスト ( 京都大学数理解析研究所, 平成 ~8 28 月年 48 日開催月 1 日 semantics FB 1 x, y, z,... FB 1. FB (Boolean) Functional 1 1.1 semantics F 1 x, y, z,... F 1. F 38 2016 9 1 (oolean) Functional 2. T F F 3. P F (not P ) F 4. P 1 P 2 F (P 1 and P 2 ) F 5. x P 1 P 2 F (let x be P 1 in P 2 ) F 6. F syntax F (let x be (T and y)

More information

A

A A 2563 15 4 21 1 3 1.1................................................ 3 1.2............................................. 3 2 3 2.1......................................... 3 2.2............................................

More information

II R n k +1 v 0,, v k k v 1 v 0,, v k v v 0,, v k R n 1 a 0,, a k a 0 v 0 + a k v k v 0 v k k k v 0,, v k σ k σ dimσ = k 1.3. k

II R n k +1 v 0,, v k k v 1 v 0,, v k v v 0,, v k R n 1 a 0,, a k a 0 v 0 + a k v k v 0 v k k k v 0,, v k σ k σ dimσ = k 1.3. k II 231017 1 1.1. R n k +1 v 0,, v k k v 1 v 0,, v k v 0 1.2. v 0,, v k R n 1 a 0,, a k a 0 v 0 + a k v k v 0 v k k k v 0,, v k σ kσ dimσ = k 1.3. k σ {v 0,...,v k } {v i0,...,v il } l σ τ < τ τ σ 1.4.

More information

x (x, ) x y (, y) iy x y z = x + iy (x, y) (r, θ) r = x + y, θ = tan ( y ), π < θ π x r = z, θ = arg z z = x + iy = r cos θ + ir sin θ = r(cos θ + i s

x (x, ) x y (, y) iy x y z = x + iy (x, y) (r, θ) r = x + y, θ = tan ( y ), π < θ π x r = z, θ = arg z z = x + iy = r cos θ + ir sin θ = r(cos θ + i s ... x, y z = x + iy x z y z x = Rez, y = Imz z = x + iy x iy z z () z + z = (z + z )() z z = (z z )(3) z z = ( z z )(4)z z = z z = x + y z = x + iy ()Rez = (z + z), Imz = (z z) i () z z z + z z + z.. z

More information

1 (Contents) (1) Beginning of the Universe, Dark Energy and Dark Matter Noboru NAKANISHI 2 2. Problem of Heat Exchanger (1) Kenji

1 (Contents) (1) Beginning of the Universe, Dark Energy and Dark Matter Noboru NAKANISHI 2 2. Problem of Heat Exchanger (1) Kenji 8 4 2018 6 2018 6 7 1 (Contents) 1. 2 2. (1) 22 3. 31 1. Beginning of the Universe, Dark Energy and Dark Matter Noboru NAKANISHI 2 2. Problem of Heat Exchanger (1) Kenji SETO 22 3. Editorial Comments Tadashi

More information

2010 II / y = e x y = log x = log e x 2. ( e x ) = e x 3. ( ) log x = 1 x 1.2 Warming Up 1 u = log a M a u = M a 0

2010 II / y = e x y = log x = log e x 2. ( e x ) = e x 3. ( ) log x = 1 x 1.2 Warming Up 1 u = log a M a u = M a 0 2010 II 6 10.11.15/ 10.11.11 1 1 5.6 1.1 1. y = e x y = log x = log e x 2. e x ) = e x 3. ) log x = 1 x 1.2 Warming Up 1 u = log a M a u = M a 0 log a 1 a 1 log a a a r+s log a M + log a N 1 0 a 1 a r

More information

1 X X T T X (topology) T X (open set) (X, T ) (topological space) ( ) T1 T, X T T2 T T T3 T T ( ) ( ) T1 X T2 T3 1 X T = {, X} X (X, T ) indiscrete sp

1 X X T T X (topology) T X (open set) (X, T ) (topological space) ( ) T1 T, X T T2 T T T3 T T ( ) ( ) T1 X T2 T3 1 X T = {, X} X (X, T ) indiscrete sp 1 X X T T X (topology) T X (open set) (X, T ) (topological space) ( ) T1 T, X T T2 T T T3 T T ( ) ( ) T1 X T2 T3 1 X T = {, X} X (X, T ) indiscrete space T1 T2 =, X = X, X X = X T3 =, X =, X X = X 2 X

More information

9 2 1 f(x, y) = xy sin x cos y x y cos y y x sin x d (x, y) = y cos y (x sin x) = y cos y(sin x + x cos x) x dx d (x, y) = x sin x (y cos y) = x sin x

9 2 1 f(x, y) = xy sin x cos y x y cos y y x sin x d (x, y) = y cos y (x sin x) = y cos y(sin x + x cos x) x dx d (x, y) = x sin x (y cos y) = x sin x 2009 9 6 16 7 1 7.1 1 1 1 9 2 1 f(x, y) = xy sin x cos y x y cos y y x sin x d (x, y) = y cos y (x sin x) = y cos y(sin x + x cos x) x dx d (x, y) = x sin x (y cos y) = x sin x(cos y y sin y) y dy 1 sin

More information

IA 2013 : :10722 : 2 : :2 :761 :1 (23-27) : : ( / ) (1 /, ) / e.g. (Taylar ) e x = 1 + x + x xn n! +... sin x = x x3 6 + x5 x2n+1 + (

IA 2013 : :10722 : 2 : :2 :761 :1 (23-27) : : ( / ) (1 /, ) / e.g. (Taylar ) e x = 1 + x + x xn n! +... sin x = x x3 6 + x5 x2n+1 + ( IA 2013 : :10722 : 2 : :2 :761 :1 23-27) : : 1 1.1 / ) 1 /, ) / e.g. Taylar ) e x = 1 + x + x2 2 +... + xn n! +... sin x = x x3 6 + x5 x2n+1 + 1)n 5! 2n + 1)! 2 2.1 = 1 e.g. 0 = 0.00..., π = 3.14..., 1

More information

III ϵ-n ϵ-n lim n a n = α n a n α 1 lim a n = 0 1 n a k n n k= ϵ-n 1.1

III ϵ-n ϵ-n lim n a n = α n a n α 1 lim a n = 0 1 n a k n n k= ϵ-n 1.1 III http://www2.mth.kyushu-u.c.jp/~hr/lectures/lectures-j.html 1 1 1.1 ϵ-n ϵ-n lim n = α n n α 1 lim n = 0 1 n k n k=1 0 1.1.7 ϵ-n 1.1.1 n α n n α lim n = α ϵ Nϵ n > Nϵ n α < ϵ 1.1.1 ϵ n > Nϵ n α < ϵ 1.1.2

More information

1 (1) () (3) I 0 3 I I d θ = L () dt θ L L θ I d θ = L = κθ (3) dt κ T I T = π κ (4) T I κ κ κ L l a θ L r δr δl L θ ϕ ϕ = rθ (5) l

1 (1) () (3) I 0 3 I I d θ = L () dt θ L L θ I d θ = L = κθ (3) dt κ T I T = π κ (4) T I κ κ κ L l a θ L r δr δl L θ ϕ ϕ = rθ (5) l 1 1 ϕ ϕ ϕ S F F = ϕ (1) S 1: F 1 1 (1) () (3) I 0 3 I I d θ = L () dt θ L L θ I d θ = L = κθ (3) dt κ T I T = π κ (4) T I κ κ κ L l a θ L r δr δl L θ ϕ ϕ = rθ (5) l : l r δr θ πrδr δf (1) (5) δf = ϕ πrδr

More information

III III 2010 PART I 1 Definition 1.1 (, σ-),,,, Borel( ),, (σ-) (M, F, µ), (R, B(R)), (C, B(C)) Borel Definition 1.2 (µ-a.e.), (in µ), (in L 1 (µ)). T

III III 2010 PART I 1 Definition 1.1 (, σ-),,,, Borel( ),, (σ-) (M, F, µ), (R, B(R)), (C, B(C)) Borel Definition 1.2 (µ-a.e.), (in µ), (in L 1 (µ)). T III III 2010 PART I 1 Definition 1.1 (, σ-),,,, Borel( ),, (σ-) (M, F, µ), (R, B(R)), (C, B(C)) Borel Definition 1.2 (µ-a.e.), (in µ), (in L 1 (µ)). Theorem 1.3 (Lebesgue ) lim n f n = f µ-a.e. g L 1 (µ)

More information

ルベーグ積分 サンプルページ この本の定価 判型などは, 以下の URL からご覧いただけます. このサンプルページの内容は, 初版 1 刷発行時のものです.

ルベーグ積分 サンプルページ この本の定価 判型などは, 以下の URL からご覧いただけます.   このサンプルページの内容は, 初版 1 刷発行時のものです. ルベーグ積分 サンプルページ この本の定価 判型などは, 以下の URL からご覧いただけます. http://www.morikita.co.jp/books/mid/005431 このサンプルページの内容は, 初版 1 刷発行時のものです. Lebesgue 1 2 4 4 1 2 5 6 λ a

More information

2

2 p1 i 2 = 1 i 2 x, y x + iy 2 (x + iy) + (γ + iδ) = (x + γ) + i(y + δ) (x + iy)(γ + iδ) = (xγ yδ) + i(xδ + yγ) i 2 = 1 γ + iδ 0 x + iy γ + iδ xγ + yδ xδ = γ 2 + iyγ + δ2 γ 2 + δ 2 p7 = x 2 +y 2 z z p13

More information

.2 ρ dv dt = ρk grad p + 3 η grad (divv) + η 2 v.3 divh = 0, rote + c H t = 0 dive = ρ, H = 0, E = ρ, roth c E t = c ρv E + H c t = 0 H c E t = c ρv T

.2 ρ dv dt = ρk grad p + 3 η grad (divv) + η 2 v.3 divh = 0, rote + c H t = 0 dive = ρ, H = 0, E = ρ, roth c E t = c ρv E + H c t = 0 H c E t = c ρv T NHK 204 2 0 203 2 24 ( ) 7 00 7 50 203 2 25 ( ) 7 00 7 50 203 2 26 ( ) 7 00 7 50 203 2 27 ( ) 7 00 7 50 I. ( ν R n 2 ) m 2 n m, R = e 2 8πε 0 hca B =.09737 0 7 m ( ν = ) λ a B = 4πε 0ħ 2 m e e 2 = 5.2977

More information

Design of highly accurate formulas for numerical integration in weighted Hardy spaces with the aid of potential theory 1 Ken ichiro Tanaka 1 Ω R m F I = F (t) dt (1.1) Ω m m 1 m = 1 1 Newton-Cotes Gauss

More information

I (Analysis I) Lebesgue (Lebesgue Integral Theory) 1 (Seiji HIRABA) 1 ( ),,, ( )

I (Analysis I) Lebesgue (Lebesgue Integral Theory) 1 (Seiji HIRABA) 1 ( ),,, ( ) I (Analysis I) Lebesgue (Lebesgue Integral Theory) 1 (Seiji HIRABA) 1 ( ),,, ( ) 1 (Introduction) 1 1.1... 1 1.2 Riemann Lebesgue... 2 2 (Measurable sets and Measures) 4 2.1 σ-... 4 2.2 Borel... 5 2.3...

More information

tomocci ,. :,,,, Lie,,,, Einstein, Newton. 1 M n C. s, M p. M f, p d ds f = dxµ p ds µ f p, X p = X µ µ p = dxµ ds µ p. µ, X µ.,. p,. T M p.

tomocci ,. :,,,, Lie,,,, Einstein, Newton. 1 M n C. s, M p. M f, p d ds f = dxµ p ds µ f p, X p = X µ µ p = dxµ ds µ p. µ, X µ.,. p,. T M p. tomocci 18 7 5...,. :,,,, Lie,,,, Einstein, Newton. 1 M n C. s, M p. M f, p d ds f = dxµ p ds µ f p, X p = X µ µ p = dxµ ds µ p. µ, X µ.,. p,. T M p. M F (M), X(F (M)).. T M p e i = e µ i µ. a a = a i

More information

1 α X (path) α I = [0, 1] X α(0) = α(1) = p α p (base point) loop α(1) = β(0) X α, β α β : I X (α β)(s) = ( )α β { α(2s) (0 s 1 2 ) β(2s 1) ( 1 2 s 1)

1 α X (path) α I = [0, 1] X α(0) = α(1) = p α p (base point) loop α(1) = β(0) X α, β α β : I X (α β)(s) = ( )α β { α(2s) (0 s 1 2 ) β(2s 1) ( 1 2 s 1) 1 α X (path) α I = [0, 1] X α(0) = α(1) = p α p (base point) loop α(1) = β(0) X α, β α β : I X (α β)(s) = ( )α β { α(2s) (0 s 1 2 ) β(2s 1) ( 1 2 s 1) X α α 1 : I X α 1 (s) = α(1 s) ( )α 1 1.1 X p X Ω(p)

More information

V 0 = + r pv (H) + qv (T ) = + r ps (H) + qs (T ) = S 0 X n+ (T ) = n S n+ (T ) + ( + r)(x n n S n ) = ( + r)x n + n (d r)s n = ( + r)v n + V n+(h) V

V 0 = + r pv (H) + qv (T ) = + r ps (H) + qs (T ) = S 0 X n+ (T ) = n S n+ (T ) + ( + r)(x n n S n ) = ( + r)x n + n (d r)s n = ( + r)v n + V n+(h) V I (..2) (0 < d < + r < u) X 0, X X = 0 S + ( + r)(x 0 0 S 0 ) () X 0 = 0, P (X 0) =, P (X > 0) > 0 0 H, T () X 0 = 0, X (H) = 0 us 0 ( + r) 0 S 0 = 0 S 0 (u r) X (T ) = 0 ds 0 ( + r) 0 S 0 = 0 S 0 (d r)

More information

Part () () Γ Part ,

Part () () Γ Part , Contents a 6 6 6 6 6 6 6 7 7. 8.. 8.. 8.3. 8 Part. 9. 9.. 9.. 3. 3.. 3.. 3 4. 5 4.. 5 4.. 9 4.3. 3 Part. 6 5. () 6 5.. () 7 5.. 9 5.3. Γ 3 6. 3 6.. 3 6.. 3 6.3. 33 Part 3. 34 7. 34 7.. 34 7.. 34 8. 35

More information

18 I ( ) (1) I-1,I-2,I-3 (2) (3) I-1 ( ) (100 ) θ ϕ θ ϕ m m l l θ ϕ θ ϕ 2 g (1) (2) 0 (3) θ ϕ (4) (3) θ(t) = A 1 cos(ω 1 t + α 1 ) + A 2 cos(ω 2 t + α

18 I ( ) (1) I-1,I-2,I-3 (2) (3) I-1 ( ) (100 ) θ ϕ θ ϕ m m l l θ ϕ θ ϕ 2 g (1) (2) 0 (3) θ ϕ (4) (3) θ(t) = A 1 cos(ω 1 t + α 1 ) + A 2 cos(ω 2 t + α 18 I ( ) (1) I-1,I-2,I-3 (2) (3) I-1 ( ) (100 ) θ ϕ θ ϕ m m l l θ ϕ θ ϕ 2 g (1) (2) 0 (3) θ ϕ (4) (3) θ(t) = A 1 cos(ω 1 t + α 1 ) + A 2 cos(ω 2 t + α 2 ), ϕ(t) = B 1 cos(ω 1 t + α 1 ) + B 2 cos(ω 2 t

More information

O x y z O ( O ) O (O ) 3 x y z O O x v t = t = 0 ( 1 ) O t = 0 c t r = ct P (x, y, z) r 2 = x 2 + y 2 + z 2 (t, x, y, z) (ct) 2 x 2 y 2 z 2 = 0

O x y z O ( O ) O (O ) 3 x y z O O x v t = t = 0 ( 1 ) O t = 0 c t r = ct P (x, y, z) r 2 = x 2 + y 2 + z 2 (t, x, y, z) (ct) 2 x 2 y 2 z 2 = 0 9 O y O ( O ) O (O ) 3 y O O v t = t = 0 ( ) O t = 0 t r = t P (, y, ) r = + y + (t,, y, ) (t) y = 0 () ( )O O t (t ) y = 0 () (t) y = (t ) y = 0 (3) O O v O O v O O O y y O O v P(, y,, t) t (, y,, t )

More information

Note.tex 2008/09/19( )

Note.tex 2008/09/19( ) 1 20 9 19 2 1 5 1.1........................ 5 1.2............................. 8 2 9 2.1............................. 9 2.2.............................. 10 3 13 3.1.............................. 13 3.2..................................

More information

I z n+1 = zn 2 + c (c ) c pd L.V. K. 2

I z n+1 = zn 2 + c (c ) c   pd L.V. K. 2 I 2012 00-1 I : October 1, 2012 Version : 1.1 3. 10 1 10 15 10 22 1: 10 29 11 5 11 12 11 19 2: 11 26 12 3 12 10 12 17 3: 12 25 1 9 1 21 3 1 I 2012 00-2 z n+1 = zn 2 + c (c ) c http://www.math.nagoya-u.ac.jp/~kawahira/courses/12w-tenbou.html

More information