( ) Lemma 2.2. X ultra filter (1) X = X 1 X 2 X 1 X 2 (2) X = X 1 X 2 X 3... X N X 1, X 2,..., X N (3) disjoint union X j Definition 2.3. X ultra filt

Size: px
Start display at page:

Download "( ) Lemma 2.2. X ultra filter (1) X = X 1 X 2 X 1 X 2 (2) X = X 1 X 2 X 3... X N X 1, X 2,..., X N (3) disjoint union X j Definition 2.3. X ultra filt"

Transcription

1 NON COMMTATIVE ALGEBRAIC SPACE OF FINITE ARITHMETIC TYPE ( ) 1. Introduction (1) (2) universality C ( ) R (1) (2) ultra filter 0 (1) (1) ( ) (2) (2) (3) 2. ultra filter Definition 2.1. X F filter (1) F A, B = A B F. (2) F A, A A 1 X = A 1 F. filter ultra filter ltra filter

2 ( ) Lemma 2.2. X ultra filter (1) X = X 1 X 2 X 1 X 2 (2) X = X 1 X 2 X 3... X N X 1, X 2,..., X N (3) disjoint union X j Definition 2.3. X ultra filter principal ultra filter x X = { X; x } principal filter ultra filter X x (Bourbaki principal filter trivial filter ) Lemma (3) Lemma 2.4. X ultra filter E principal filter non-principal ultra filter 2.1. :ltra filter. ultra filter Lemma 2.5. X C b (X) C b (X) (C - ) C b (X) Y = Spm(C b (X)) C b (X) 5 (1) Y ( C b (X) ) (2) C b (X) C C- ϕ (3) C b (X) C - (4) X (Stone-Čech ) (5) X ultra filter ultra filter X principal ultra filter X non-principal ultra filter X ( wikipedia ( web RL

3 NON COMMTATIVE ALGEBRAIC SPACE OF FINITE ARITHMETIC TYPE ) ) Proof. (2) ϕ (1) ϕ ( ) C b (X) C - ( Banach ) M (M C b (X) ) C b (X)/M Banach C (Gelfand-Mazur C - ( ) ) (3) (1)-(3) (4) (1) X K φ K C(K) f f ( ) φ φ (f) φ : C(K) C b (X) - C - C(K) K (Stone-Weierstass : C - ) Y = Spm(C b (X)) K Y Y (5) X ultra filter (3) C b (X) f f ( ) f K > 0 f(x) D K = {z C; z K} D K K ɛ > 0 D K ɛ B 1,..., B N X = D K = B 1 B 2... B N N f 1 (B j ) j=1 ultra filter j f 1 (B j ) disjoint union j f 1 (B j ) f() ɛ f() C

4 ( ) f() ( ) c f C f c f p Z/pZ F p p r F p r F p inj lim r F p r F p Definition 2.6. P = Spm(Z) (Z ) non-principal ltra filter Q = p F p /( 0) Q ( ) = p F p /( 0) p F p (a p ) p P (a p F p ) p F p ( 0) p F p I Q I = {(a p ) p P p F p ; such that a p = 0 for all p } Q ( ) Proposition 2.7. (1) Q ( ), Q 0 (2) Q ( ) Proof. (1) Q, Q ( ) Q f = (f p ) Q 0 ( ) E 1 = {p Spec 1 (O); f p 0} E E E 1 ( f = 0 ) ( ) E 1 f

5 NON COMMTATIVE ALGEBRAIC SPACE OF FINITE ARITHMETIC TYPE g = (g p ) f 1 if p E 1 g p = 0 otherwise Q 0 n n = 0 Q E 0 n p E 0 pz E 0 principal ultra filter Q ( ) F p Q ( ) F (X) = X n + a (n 1) X n 1 + a (n 2) X n a (1) X + a (0) (a (j) Q ( ) ) Q( ) p F p a (j) = (a p (j) ) p a p (j) F p F p (X) = X n + a (n 1) p X n 1 + a (n 2) p X n a (1) p X + a(0) p F p F p x (1) p, x (2) p,..., x (n) p ( ) x (j) = (x (j) ) p Q ( ) (j = 1,..., n) x F Q ( ) {x (i) p } n i=1 n! p F (X) p σ p S n x (σ) = (x (σp(1)) ) p Q ( ) F S n τ τ = {p Spm(Z); σ p = τ}

6 ( ) Spm(Z) = τ Sn τ disjoint union ultra filter τ p σ p τ x (σ) ( ) x (τ(1)) ultra filter (S n ) Proposition 2.8. ultra filter Q Q Q ( ) Lemma Lemma 2.9. f Z[X] \ Z f modulo p F p p Proof. f Z[X] \ Z f modulo p F p p p 1, p 2,..., p N f(x) f(x + c) f f x > 0 f(x) > 0 {f(j); j = 1, 2, 3,..., } {p e 1 1 p e p e N N ; e 1, e 2,..., e N N} #({p e 1 1 pe pe N N ; e 1, e 2,..., e N N} N 2 m) #{e 1, e 2,..., e N N m } = m N #({f(j); j = 1, 2, 3,..., } N 2 m) 2 m/d (d f ) Lemma f 1, f 2,..., f n Z[X] \ Z F p p Proof. Q f 1, f 2,..., f n α 1, α 2,..., α N K K L L Q ( 0 ) L Q β β Q Lemma

7 NON COMMTATIVE ALGEBRAIC SPACE OF FINITE ARITHMETIC TYPE (Proposition 2.8 ) Z monic S S = {f 1, f 2,..., f n } S S = {p Spm(Z); f 1, f 2,..., f n F p } S S, T S S T = S T 0 = { Spm(Z); S S such that S } 0 filter ( 0 filter base { S ; S S} ) 0 ultra filter ( ) non principal Z Q Lemma Q ( ) Q R. Proof. Q ( ) F q #Q ( ) #R Q ( ) Q Q Q S 1 = R/Z ι p : F p S 1 ι p : F p = Z/pZ (n mod Z) (n/p mod Z) R/Z. well-defined π π(π ((a p ))) = lim p ι p(a p ) limit filter limit ultra filter (Lemma 2.2 ) S 1 α a p F p ι p (a p ) α π((a p )) = α π Q ( ) Corollary Q ( ) = C. Proof. 0 (transcendense base ) (ultra filter ) F p p C

8 ( ) p f p p ( ) 2.8 F p limit ultra filter 3. non commutative algebraic space of finite arithmetic type abel A. Rosenberg [4] Grothendieck abel C abel abel Rosenberg abel 3.1. R-abel. Definition 3.1. R abel C R-abel C (1) M 1, M 2 Ob(C) Hom C (M 1, M 2 ) R- (2) R- (a.f) g = a.(f g) = f (a.g) a R C ( ) f, g R-abel R-abel R- (additive ) R- R- (R module) R-abel R-abel C augmented (R module) C R- Definition 3.2. C R R-abel R I R/I-abel C/I C Ob(C/I) = {M Ob(C); IM = 0}. ( IM = 0 a I 0 ) M a M

9 NON COMMTATIVE ALGEBRAIC SPACE OF FINITE ARITHMETIC TYPE Definition 3.3. k p 0 little non commutative algebraic space of finite type over k (1) X k finite type (2) X A A O X - O X - (X, A) C qcoh (X, A) A- Ø X - augmented k-abel Definition 3.4. R K O non commutative algebraic space of finite arithmetic type X (over R) (1) R- ( ) C qcoh (X) (2) p Spm(O) little non commutative algebraic space of finite type (X (p), A X(p) ) over R/p (3) p Spm(O) C coh /p = C qcoh (X (p), A X(p) ) non commutative algebraic space of finite arithmetic type NC ( finite arithmetic type ) R NC morphism (little NC ( ) ) Definition 3.5. R K O X, Y R NC X Y morphism (1) C qcoh (Y ) C qcoh (X) ( ). (2) p Spm(O) (X (p), A X(p) ) (Y (p),ay (p) ) little NC f (p). modulo p p NC localization, étale, smooth X smooth p Spm(O) X (p) smooth A X(p) X (p) O X(p) - ( X (p) p O/p ) NC affine O- A C qcoh (X) (A-modules)

10 ( ) A (A modules) NC- (4.2 ) Weyl (4.1 ) Lie (4.3 ) X (p) A/pA Spec Weyl Lie NC 4.1. Weyl algebra. 4. Definition 4.1. k Weyl A n (k) k ( ) A n (k) = k ξ 1, ξ 2,..., ξ n, η 1, η 2,..., η n /(η j ξ i ξ i η j δ ij ; 1 i, j n), (where δ ij is the Kronecker s delta.) (A n (k) (k) ind-scheme k- k k k ξ, η k k ) A n (k) Z n (k) 2n ξ p 1, ξp 2,..., ξp n, ηp 1, ηp 2,..., ηp n k A n (k) Z n (k) matrix bundle section Weyl. k p > 0 Weyl k- Z n (k) k- ( [5] ) Z n (k) p- S n (k) = k[t 1, T 2,..., T n, 1, 2,..., n ] T i = (ξ p i )1/p, j = (η p j )1/p S n (k) n- ( ) A n (k) Proposition 4.2. k p > 0 φ : A n A n k- f : Spec S n Spec S n φ morphism G (4.1) G(f )G 1 = + ω

11 NON COMMTATIVE ALGEBRAIC SPACE OF FINITE ARITHMETIC TYPE (4.2) ω = n i=1 (ω T i dt i + ω i d i ) n ω p T i + ( / T i ) p 1 j (ω Ti T j ) = 0 T j=1 i (i = 1, 2,..., n) n ω p i + ( / i ) p 1 j (ω i T j ) = 0 i j=1 where T i = ˆψ(T i ) = f (T i ), i = ˆψ( i ) = f ( i ) ω Ti ω i ω T i i 1- ω suffix ( ) p = 3, n = 1 ξ 1 ξ 1 η 1 ξ 1, η 1 η 1 ξ 1 η 1 φ φ f étale φ ( ) p f étale Weyl p >> 0 dt 1 d 1 + dt 2 d dt n d n ultra filter 0. ultra filter Q Weyl A n (Q ) symplectic dt 1 d 1 + dt 2 d dt n d n A n (Q ) h 0 symplectic Weyl A n Q - Weyl Weyl localization ultra filter. A n k ξ, η, ξ 1 ξ ξ 2, η 1 2 ξ 1 η

12 ( ) Lemma 4.3. f A n (Z) f p Z n (F p ) ( p ) A n (Z) f modulo p ((A n ) f )(F p ) = A n (F p ) Zn(F p) Z n (F p )[(f p ) 1 ] Z n (F p )[(f p ) 1 ] finitely generated f localize Lemma 4.4. Let p be a prime. Then in k ξ, η /(ηξ ξη 1), we have the following identity. (1) ξ t η t = (ξη)(ξη 1)(ξη 1)... (ξη (t 1)) (2) η t ξ t = (ξη + 1)(ξη + 2)... (ξη + t) (3) (ξη) p ξη = ξ p η p. (4) Let f(w) = (w a 1 )... (w a l ) k[w], a i k. Then we have ( ) (f(ξη)η s ) p = (ξ p η p a p i + a i) η sp. for any positive integer s which is relatively prime with p. (5) For any polynomial f, g k[w], we have i [f(ξη)η t, g(ξη)ξ t ] = F (ξη) F (ξη t) where F (w) = w(w + 1)(w + 2)... (w t + 1)f(w)g(w + t). f, s > 0 f(ξη)η s localization f(ξη) η f(ξη) inverse η Lemma 4.5. (θ 2 2)η (θ = ξη) ((θ 2 2)η) p = ξ 2p η 3p 4(1 ( 2 ξ 2p η 3p (2: ) p ))ηp = ξ 2p η 3p 8η p (2: ). (( 2 ) is the Legendre s symbol). p ultra filter 2 B = A n [ξ 1, η 1 ] (θ 2 2) (mod p ) ultra filter 2 B (θ 2 2) mod p ultra filter inverse algebra algebra mod p limit

13 NON COMMTATIVE ALGEBRAIC SPACE OF FINITE ARITHMETIC TYPE 4.2. Cuntz O 2. Cunts O 2 ( ) O 2 = e 1, e 2, e 1, e 2 ; e 1 e 1 = 1, e 2 e 2 = 1, e 1 e 1 + e 2e 2 = 1, e 2 e 1 = 0, e 1 e 2 = 0, ( O 2 C - C -completion Cuntz C ( ) O 2 O 2 ) O 2 ( ) e 1, e 2 1 = e 1 e 1e 2 e 2 = 2 O 2 ( ) O 2 O 3, O 4,..., O n,... O (O ) Cunts K- [1] Weyl Cuntz C Lie g (g) g Theorem 4.6. (Serre) C Lie g {x i, y i, h i 1 i l} ( Lie [2] 18.1 ) (1) [h i h j ] = 0 (2) [x i y i ] = h i, [x i y j ] = 0 if i j. (3) [h k x j ] = α j, α i x j, [h i y j ] = α j, α i y j, (4) (ad x i ) α j,α i +1 (x j ) = 0 (5) (ad y i ) α j,α i +1 (x j ) = 0 g {x i, y i, h i } g Q = Q {x i, y i, h i } Q p F p ( V Q F p suffix V Q, V Fp ) g h = C {h i }, n + = C {x i }, n = C {y i }

14 ( ) g = h n + n ( ) h {h i } n + ( n ) {x i } ( {y i } ) g Q = h Q n +Q n Q Q- n + n {n 1, n 2..., n s } n i ad-nilpotent p > 0 Q F p p k g k p restricted Lie [3] Lie restricted Lie Lie Theorem 4.7. k Lie g k Killing form A g k ad(a) p (B) = [A [p], B] ( B g k ) A [p] g k [A p, B] = [A [p], B] ( B g k ) p g ( ) h [p] i = h i (i = 1,..., l), n [p] j = 0 (j = 1,..., s) ( ) h p i h i (i = 1,..., l), n p j (j = 1,..., s) casimir 0 g (Cartan sub algebra ) r g Z r ( Z [2] 23.3 Coxeter Z ) Z modulo p g k

15 NON COMMTATIVE ALGEBRAIC SPACE OF FINITE ARITHMETIC TYPE Poincaré-Birkoff-Witt ( ) k ( ) R k = k[{h p i h i (i = 1,..., l), n p j (j = 1,..., s)}] (g k ) R k g k (g k ) ϕ ϕ(x) = x p x [p] restricted Lie ϕ p-semilinear ϕ(c 1 x 1 + c 2 x 2 ) = c p 1ϕ(x 1 ) + c p 2ϕ(x 2 ) c 1, c 2 k, x 1, x 2 g k R k ϕ Poincaré- Birkoff-Witt ϕ Spec(R k ) g g ( Frobenius ) (g Fp ) O-coherent algebra sheaf O- locally free [3] g u-algebra (g) g algebra sheaf : math.rt/ ( ) [email protected] References [1] J. Cuntz, A new look at kk-theory, K-Theory 1 (1987), [2] J. E. Humphreys, Introduction to lie algebras and representation theory, Springer-Verlag, [3] N. Jacobson, Lie algebras, Interscience publishers, [4] A. L. Rosenberg, Noncommutative schemes, Compositio Math. 112, no. 1 (1998), [5] Y. Tsuchimoto, Preliminaries on Dixmier conjecture, Mem. Fac. Sci. Kochi niv. Ser.A Math.. 24 (2003),

Tabulation of the clasp number of prime knots with up to 10 crossings

Tabulation of the clasp number of prime knots  with up to 10 crossings . Tabulation of the clasp number of prime knots with up to 10 crossings... Kengo Kawamura (Osaka City University) joint work with Teruhisa Kadokami (East China Normal University).. VI December 20, 2013

More information

0.,,., m Euclid m m. 2.., M., M R 2 ψ. ψ,, R 2 M.,, (x 1 (),, x m ()) R m. 2 M, R f. M (x 1,, x m ), f (x 1,, x m ) f(x 1,, x m ). f ( ). x i : M R.,,

0.,,., m Euclid m m. 2.., M., M R 2 ψ. ψ,, R 2 M.,, (x 1 (),, x m ()) R m. 2 M, R f. M (x 1,, x m ), f (x 1,, x m ) f(x 1,, x m ). f ( ). x i : M R.,, 2012 10 13 1,,,.,,.,.,,. 2?.,,. 1,, 1. (θ, φ), θ, φ (0, π),, (0, 2π). 1 0.,,., m Euclid m m. 2.., M., M R 2 ψ. ψ,, R 2 M.,, (x 1 (),, x m ()) R m. 2 M, R f. M (x 1,, x m ), f (x 1,, x m ) f(x 1,, x m ).

More information

Test IV, March 22, 2016 6. Suppose that 2 n a n converges. Prove or disprove that a n converges. Proof. Method I: Let a n x n be a power series, which converges at x = 2 by the assumption. Applying Theorem

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

R R P N (C) 7 C Riemann R K ( ) C R C K 8 (R ) R C K 9 Riemann /C /C Riemann 10 C k 11 k C/k 12 Riemann k Riemann C/k k(c)/k R k F q Riemann 15

R R P N (C) 7 C Riemann R K ( ) C R C K 8 (R ) R C K 9 Riemann /C /C Riemann 10 C k 11 k C/k 12 Riemann k Riemann C/k k(c)/k R k F q Riemann 15 (Gen KUROKI) 1 1 : Riemann Spec Z 2? 3 : 4 2 Riemann Riemann Riemann 1 C 5 Riemann Riemann R compact R K C ( C(x) ) K C(R) Riemann R 6 (E-mail address: [email protected]) 1 1 ( 5 ) 2 ( Q ) Spec

More information

inkiso.dvi

inkiso.dvi Ken Urai May 19, 2004 5 27 date-event uncertainty risk 51 ordering preordering X X X (preordering) reflexivity x X x x transitivity x, y, z X x y y z x z asymmetric x y y x x = y X (ordering) completeness

More information

36

36 36 37 38 P r R P 39 (1+r ) P =R+P g P r g P = R r g r g == == 40 41 42 τ R P = r g+τ 43 τ (1+r ) P τ ( P P ) = R+P τ ( P P ) n P P r P P g P 44 R τ P P = (1 τ )(r g) (1 τ )P R τ 45 R R σ u R= R +u u~ (0,σ

More information

2014 (2014/04/01)

2014 (2014/04/01) 2014 (2014/04/01) 1 5 1.1...................................... 5 1.2...................................... 7 1.3...................................... 8 1.4............................... 10 1.5 Zorn...........................

More information

main.dvi

main.dvi Nim [email protected],.,.,,,.,,,,,,, Nim,.,,,,. Nim Nim,.,.,.,,.,.,. [1, 3],,, Nim,,., Nim. Date:. August 10-11, 1999 2 1 Nim.. Pile., Pile.,. normal case.,. reverse case.,.. Pile. N 1, N 2, N

More information

T rank A max{rank Q[R Q, J] t-rank T [R T, C \ J] J C} 2 ([1, p.138, Theorem 4.2.5]) A = ( ) Q rank A = min{ρ(j) γ(j) J J C} C, (5) ρ(j) = rank Q[R Q,

T rank A max{rank Q[R Q, J] t-rank T [R T, C \ J] J C} 2 ([1, p.138, Theorem 4.2.5]) A = ( ) Q rank A = min{ρ(j) γ(j) J J C} C, (5) ρ(j) = rank Q[R Q, (ver. 4:. 2005-07-27) 1 1.1 (mixed matrix) (layered mixed matrix, LM-matrix) m n A = Q T (2m) (m n) ( ) ( ) Q I m Q à = = (1) T diag [t 1,, t m ] T rank à = m rank A (2) 1.2 [ ] B rank [B C] rank B rank

More information

24.15章.微分方程式

24.15章.微分方程式 m d y dt = F m d y = mg dt V y = dy dt d y dt = d dy dt dt = dv y dt dv y dt = g dv y dt = g dt dt dv y = g dt V y ( t) = gt + C V y ( ) = V y ( ) = C = V y t ( ) = gt V y ( t) = dy dt = gt dy = g t dt

More information

2.1 H f 3, SL(2, Z) Γ k (1) f H (2) γ Γ f k γ = f (3) f Γ \H cusp γ SL(2, Z) f k γ Fourier f k γ = a γ (n)e 2πinz/N n=0 (3) γ SL(2, Z) a γ (0) = 0 f c

2.1 H f 3, SL(2, Z) Γ k (1) f H (2) γ Γ f k γ = f (3) f Γ \H cusp γ SL(2, Z) f k γ Fourier f k γ = a γ (n)e 2πinz/N n=0 (3) γ SL(2, Z) a γ (0) = 0 f c GL 2 1 Lie SL(2, R) GL(2, A) Gelbart [Ge] 1 3 [Ge] Jacquet-Langlands [JL] Bump [Bu] Borel([Bo]) ([Ko]) ([Mo]) [Mo] 2 2.1 H = {z C Im(z) > 0} Γ SL(2, Z) Γ N N Γ (N) = {γ SL(2, Z) γ = 1 2 mod N} g SL(2,

More information

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

第86回日本感染症学会総会学術集会後抄録(II) χ μ μ μ μ β β μ μ μ μ β μ μ μ β β β α β β β λ Ι β μ μ β Δ Δ Δ Δ Δ μ μ α φ φ φ α γ φ φ γ φ φ γ γδ φ γδ γ φ φ φ φ φ φ φ φ φ φ φ φ φ α γ γ γ α α α α α γ γ γ γ γ γ γ α γ α γ γ μ μ κ κ α α α β α

More information

Armstrong culture Web

Armstrong culture Web 2004 5 10 M.A. Armstrong, Groups and Symmetry, Springer-Verlag, NewYork, 1988 (2000) (1989) (2001) (2002) 1 Armstrong culture Web 1 3 1.1................................. 3 1.2.................................

More information

¿ô³Ø³Ø½øÏÀ¥Î¡¼¥È

¿ô³Ø³Ø½øÏÀ¥Î¡¼¥È 2011 i N Z Q R C A def B, A B. ii..,.,.. (, ), ( ),.?????????,. iii 04-13 04-20 04-27 05-04 [ ] 05-11 05-18 05-25 06-01 06-08 06-15 06-22 06-29 07-06 07-13 07-20 07-27 08-03 10-05 10-12 10-19 [ ] 10-26

More information

1 = = = (set) (element) a A a A a A a A a A {2, 5, (0, 1)}, [ 1, 1] = {x; 1 x 1}. (proposition) A = {x; P (x)} P (x) x x a A a A Remark. (i) {2, 0, 0,

1 = = = (set) (element) a A a A a A a A a A {2, 5, (0, 1)}, [ 1, 1] = {x; 1 x 1}. (proposition) A = {x; P (x)} P (x) x x a A a A Remark. (i) {2, 0, 0, 2005 4 1 1 2 2 6 3 8 4 11 5 14 6 18 7 20 8 22 9 24 10 26 11 27 http://matcmadison.edu/alehnen/weblogic/logset.htm 1 1 = = = (set) (element) a A a A a A a A a A {2, 5, (0, 1)}, [ 1, 1] = {x; 1 x 1}. (proposition)

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

untitled

untitled Global Quantitative Research / -2- -3- -4- -5- 35 35 SPC SPC REIT REIT -6- -7- -8- -9- -10- -11- -12- -13- -14- -15- -16- -17- 100m$110-18- Global Quantitative Research -19- -20- -21- -22- -23- -24- -25-

More information

compact compact Hermann compact Hermite ( - ) Hermann Hermann ( ) compact Hermite Lagrange compact Hermite ( ) a, Σ a {0} a 3 1

compact compact Hermann compact Hermite ( - ) Hermann Hermann ( ) compact Hermite Lagrange compact Hermite ( ) a, Σ a {0} a 3 1 014 5 4 compact compact Hermann compact Hermite ( - ) Hermann Hermann ( ) compact Hermite Lagrange compact Hermite ( ) 1 1.1. a, Σ a {0} a 3 1 (1) a = span(σ). () α, β Σ s α β := β α,β α α Σ. (3) α, β

More information

日本糖尿病学会誌第58巻第1号

日本糖尿病学会誌第58巻第1号 α β β β β β β α α β α β α l l α l μ l β l α β β Wfs1 β β l l l l μ l l μ μ l μ l Δ l μ μ l μ l l ll l l l l l l l l μ l l l l μ μ l l l l μ l l l l l l l l l l μ l l l μ l μ l l l l l l l l l μ l l l l

More information

1 1.1 R (ring) R1 R4 R1 R (commutative [abelian] group) R2 a, b, c R (ab)c = a(bc) (associative law) R3 a, b, c R a(b + c) = ab + ac, (a + b)c = ac +

1 1.1 R (ring) R1 R4 R1 R (commutative [abelian] group) R2 a, b, c R (ab)c = a(bc) (associative law) R3 a, b, c R a(b + c) = ab + ac, (a + b)c = ac + ALGEBRA II Hiroshi SUZUKI Department of Mathematics International Christian University 2004 1 1 1 2 2 1 3 3 1 4 4 1 5 5 1 6 6 1 7 7 1 7.1....................... 7 1 7.2........................... 7 4 8

More information

平成 15 年度 ( 第 25 回 ) 数学入門公開講座テキスト ( 京都大学数理解析研究所, 平成 ~8 15 月年 78 日開催月 4 日 ) X 2 = 1 ( ) f 1 (X 1,..., X n ) = 0,..., f r (X 1,..., X n ) = 0 X = (

平成 15 年度 ( 第 25 回 ) 数学入門公開講座テキスト ( 京都大学数理解析研究所, 平成 ~8 15 月年 78 日開催月 4 日 ) X 2 = 1 ( ) f 1 (X 1,..., X n ) = 0,..., f r (X 1,..., X n ) = 0 X = ( 1 1.1 X 2 = 1 ( ) f 1 (X 1,..., X n ) = 0,..., f r (X 1,..., X n ) = 0 X = (X 1,..., X n ) ( ) X 1,..., X n f 1,..., f r A T X + XA XBR 1 B T X + C T QC = O X 1.2 X 1,..., X n X i X j X j X i = 0, P i

More information

Îã³°·¿¤Î¥·¥å¡¼¥Ù¥ë¥È¥«¥êto=1=¡á=1=¥ë¥�¥å¥é¥¹

Îã³°·¿¤Î¥·¥å¡¼¥Ù¥ë¥È¥«¥êto=1=¡á=1=¥ë¥�¥å¥é¥¹ ([email protected]) 2009 8 10 R 3 R 3 ( wikipedia ) (Schubert, 19 ) (= )(Ehresmann, 20 ) (Chevalley, 20 ) G/P: ( : ) W : ( : ) X w : W X w W G: B G: Borel P B: G/P: 1 C n ( ) Fl n := {0 V

More information

Macdonald, ,,, Macdonald. Macdonald,,,,,.,, Gauss,,.,, Lauricella A, B, C, D, Gelfand, A,., Heckman Opdam.,,,.,,., intersection,. Macdona

Macdonald, ,,, Macdonald. Macdonald,,,,,.,, Gauss,,.,, Lauricella A, B, C, D, Gelfand, A,., Heckman Opdam.,,,.,,., intersection,. Macdona Macdonald, 2015.9.1 9.2.,,, Macdonald. Macdonald,,,,,.,, Gauss,,.,, Lauricella A, B, C, D, Gelfand, A,., Heckman Opdam.,,,.,,., intersection,. Macdonald,, q., Heckman Opdam q,, Macdonald., 1 ,,. Macdonald,

More information

1 1.1 [ ]., D R m, f : D R n C -. f p D (df) p : (df) p : R m R n f(p + vt) f(p) : v lim. t 0 t, (df) p., R m {x 1,..., x m }, (df) p (x i ) =

1 1.1 [ ]., D R m, f : D R n C -. f p D (df) p : (df) p : R m R n f(p + vt) f(p) : v lim. t 0 t, (df) p., R m {x 1,..., x m }, (df) p (x i ) = 2004 / D : 0,.,., :,.,.,,.,,,.,.,,.. :,,,,,,,., web page.,,. C-613 e-mail tamaru math.sci.hiroshima-u.ac.jp url http://www.math.sci.hiroshima-u.ac.jp/ tamaru/index-j.html 2004 D - 1 - 1 1.1 [ ].,. 1.1.1

More information

診療ガイドライン外来編2014(A4)/FUJGG2014‐01(大扉)

診療ガイドライン外来編2014(A4)/FUJGG2014‐01(大扉) !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!! !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!! !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!! !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!

More information

0. I II I II (1) linear type: GL( ), Sp( ), O( ), (2) loop type: loop current Kac-Moody affine, hyperbolic (3) diffeo t

0. I II I II (1) linear type: GL( ), Sp( ), O( ), (2) loop type: loop current Kac-Moody affine, hyperbolic (3) diffeo t e-mail: [email protected] 0. I II I II (1) linear type: GL( ), Sp( ), O( ), (2) loop type: loop current Kac-Moody affine, hyperbolic (3) diffeo type: diffeo universal Teichmuller modular I. I-. Weyl

More information

日本糖尿病学会誌第58巻第2号

日本糖尿病学会誌第58巻第2号 β γ Δ Δ β β β l l l l μ l l μ l l l l α l l l ω l Δ l l Δ Δ l l l l l l l l l l l l l l α α α α l l l l l l l l l l l μ l l μ l μ l l μ l l μ l l l μ l l l l l l l μ l β l l μ l l l l α l l μ l l

More information

A Brief Introduction to Modular Forms Computation

A Brief Introduction to Modular Forms Computation A Brief Introduction to Modular Forms Computation Magma Supported by GCOE Program Math-For-Industry Education & Research Hub What s this? Definitions and Properties Demonstration H := H P 1 (Q) some conditions

More information

受賞講演要旨2012cs3

受賞講演要旨2012cs3 アハ ート アハ ート アハ ート アハ ート アハ ート アハ ート アハ ート アハ ート アハ ート アハ ート アハ ート アハ ート アハ ート アハ ート アハ ート アハ ート アハ ート アハ ート アハ ート アハ ート アハ ート アハ ート アハ ート アハ ート アハ ート アハ ート アハ ート アハ ート アハ ート アハ ート アハ ート α β α α α α α

More information

2014 x n 1 : : :

2014 x n 1 : : : 2014 x n 1 : : 2015 1 30 : 5510113 1 x n 1 n x 2 1 = (x 1)(x+1) x 3 1 = (x 1)(x 2 +x+1) x 4 1 = (x 1)(x + 1)(x 2 + 1) x 5 1 = (x 1)(x 4 + x 3 + x 2 + x + 1) 1, 1,0 n = 105 2 1 n x n 1 Maple 1, 1,0 n 2

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

5 36 5................................................... 36 5................................................... 36 5.3..............................

5 36 5................................................... 36 5................................................... 36 5.3.............................. 9 8 3............................................. 3.......................................... 4.3............................................ 4 5 3 6 3..................................................

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

330

330 330 331 332 333 334 t t P 335 t R t t i R +(P P ) P =i t P = R + P 1+i t 336 uc R=uc P 337 338 339 340 341 342 343 π π β τ τ (1+π ) (1 βτ )(1 τ ) (1+π ) (1 βτ ) (1 τ ) (1+π ) (1 τ ) (1 τ ) 344 (1 βτ )(1

More information

http://www2.math.kyushu-u.ac.jp/~hara/lectures/lectures-j.html 2 N(ε 1 ) N(ε 2 ) ε 1 ε 2 α ε ε 2 1 n N(ɛ) N ɛ ɛ- (1.1.3) n > N(ɛ) a n α < ɛ n N(ɛ) a n

http://www2.math.kyushu-u.ac.jp/~hara/lectures/lectures-j.html 2 N(ε 1 ) N(ε 2 ) ε 1 ε 2 α ε ε 2 1 n N(ɛ) N ɛ ɛ- (1.1.3) n > N(ɛ) a n α < ɛ n N(ɛ) a n http://www2.math.kyushu-u.ac.jp/~hara/lectures/lectures-j.html 1 1 1.1 ɛ-n 1 ɛ-n lim n a n = α n a n α 2 lim a n = 1 n a k n n k=1 1.1.7 ɛ-n 1.1.1 a n α a n n α lim n a n = α ɛ N(ɛ) n > N(ɛ) a n α < ɛ

More information

数学Ⅱ演習(足助・09夏)

数学Ⅱ演習(足助・09夏) II I 9/4/4 9/4/2 z C z z z z, z 2 z, w C zw z w 3 z, w C z + w z + w 4 t R t C t t t t t z z z 2 z C re z z + z z z, im z 2 2 3 z C e z + z + 2 z2 + 3! z3 + z!, I 4 x R e x cos x + sin x 2 z, w C e z+w

More information

No.004 [1] J. ( ) ( ) (1968) [2] Morse (1997) [3] (1988) 1

No.004 [1] J. ( ) ( ) (1968) [2] Morse (1997) [3] (1988) 1 No.004 [1] J. ( ) ( ) (1968) [2] Morse (1997) [3] (1988) 1 1 (1) 1.1 X Y f, g : X Y { F (x, 0) = f(x) F (x, 1) = g(x) F : X I Y f g f g F f g 1.2 X Y X Y gf id X, fg id Y f : X Y, g : Y X X Y X Y (2) 1.3

More information

ISTC 3

ISTC 3 B- I n t e r n a t i o n a l S t a n d a r s f o r Tu b e r c u l o s i s C a r (ÏS r c ) E d is i k e - 3 ) a =1 / < ' 3 I n t e r n a t i o n a l s t a n d a r d s f o r T B C a r e e «l i s i k e 3

More information

( )/2 hara/lectures/lectures-j.html 2, {H} {T } S = {H, T } {(H, H), (H, T )} {(H, T ), (T, T )} {(H, H), (T, T )} {1

( )/2   hara/lectures/lectures-j.html 2, {H} {T } S = {H, T } {(H, H), (H, T )} {(H, T ), (T, T )} {(H, H), (T, T )} {1 ( )/2 http://www2.math.kyushu-u.ac.jp/ hara/lectures/lectures-j.html 1 2011 ( )/2 2 2011 4 1 2 1.1 1 2 1 2 3 4 5 1.1.1 sample space S S = {H, T } H T T H S = {(H, H), (H, T ), (T, H), (T, T )} (T, H) S

More information

確率論と統計学の資料

確率論と統計学の資料 5 June 015 ii........................ 1 1 1.1...................... 1 1........................... 3 1.3... 4 6.1........................... 6................... 7 ii ii.3.................. 8.4..........................

More information

ボールねじ

ボールねじ A A 506J A15-6 A15-8 A15-8 A15-11 A15-11 A15-14 A15-19 A15-20 A15-24 A15-24 A15-26 A15-27 A15-28 A15-30 A15-32 A15-35 A15-35 A15-38 A15-38 A15-39 A15-40 A15-43 A15-43 A15-47 A15-47 A15-47 A15-47 A15-49

More information