in quantum computation
|
|
- Stephanie Glenn
- 7 years ago
- Views:
Transcription
1 in computation Kestrel Institute and Oxford University - Oxford, August 2008
2 Outline Quantum programming λ- Abstraction with pictures Consequences - Abstraction in Category of measurements -
3 Outline Quantum programming λ- Abstraction with pictures Consequences - Abstraction in Category of measurements Quantum programming λ- -
4 What do programmers do? Quantum programming λ- f x Z m 2 f(x) Z n 2 -
5 What do programmers do? x f x Z m 2 f(x) Z n 2 x Quantum programming λ- - y f(x) y
6 What do programmers do? Quantum programming λ- x x B m = C Zm 2 U f f - y f(x) y B n = C Zn 2
7 What do programmers do? Quantum programming λ- z H m x z = P x ( 1)z x x f x H m z x = P z ( 1)x z z - U f y f(x) y
8 What do programmers do? Simon s algorithm f : Z m 2 Zn 2 : x f(x) f : Z m+n 2 Z m+n 2 : x, y x, f(x) y U f : C Zm+n 2 C Zm+n 2 : x, y x, f(x) y Simon = (H m id)u f (H m id) 0, 0 = ( 1) x z z, f(x) Quantum programming λ- - x,z Z m 2
9 What do programmers do? Simon s algorithm f : Z m 2 Zn 2 : x f(x) f : Z m+n 2 Z m+n 2 : x, y x, f(x) y U f : C Zm+n 2 C Zm+n 2 : x, y x, f(x) y Simon = (H m id)u f (H m id) 0, 0 = ( 1) x z z, f(x) Quantum programming λ- - x,z Z m 2... to find a hidden subgroup measurement find c such that f(x + c) = f(x)
10 What do programmers do? Shor s algorithm f : Z m+n q U f : C Zm+n q f : Z m q Z n q : x a x mod q Z m+n q : x, y x, a x + y mod q C Zm+n q : x, y x, a x + y mod q Quantum programming λ- - Shor = (FT m id)u f (FT m id) 0, 0 = ( 1) x z z, f(x) x,z Z m q... to find a hidden subgroup measurement find c such that a x+c = a x mod q
11 What do programmers do? Hallgren s algorithm h : Z m Z n : x I x (fraction ideal) h : Z m+n Z m+n : x, y x, y h(x) U h : C Zm+n C Zm+n : x, y x, y h(x) Hallgren = (FT m id)u h (FT m id) d, d = x,z Z m ( 1) x z z, h(x) Quantum programming λ to find a hidden subgroup measurement find R such that h(x + R) = h(x)
12 General design pattern of software engineering ;) CLASS QUAN T Quantum programming λ- - MEAS T CLASS
13 Quantum prog. = functional prog. + superposition + entanglement CLASS QUAN T superposition entanglement MEAS T Quantum programming λ- - CLASS
14 Standard type universes where programmers work CLASS FSet, FSet op, FFMod R... Quantum programming λ- QUAN T FHilb, CPM(FHilb)... - MEAS T FHilb, CPM(FHilb)... CLASS
15 Function in programming CLASS[x] QUAN T [x] FSet[x],FSet op [x], FFMod R[x]... FHilb[x], CPM(FHilb)[x]... Quantum programming λ- - MEAS T {x} FHilb{x}, CPM(FHilb){x}... CLASS
16 Function in programming CLASS[x] QUAN T [x] = KL (X ) = KL (X ) Quantum programming λ- - MEAS T {x} EM(X ) CLASS
17 λ- 2x 3 + 3x + 1 in Z[x] λx. 2x 3 + 3x + 1 in Z Z Z[x] x ad x Quantum programming λ- - Z f a f S a
18 λ- in cartesian closed categories S p(x) : B in S[x : X] λx. p(x) : B X in S S[x] 1 x X ad x F a Quantum programming λ- - F C 1 a FX
19 λ- in cartesian closed categories S A q(x) B in S[x : X] A λx.q(x) B X in S S[x] 1 x X ad x F a Quantum programming λ- - F C 1 a FX
20 λ- in cartesian closed categories A ϕ,x B X X ǫ B A ϕ B X S[x](A, B) S(A, B X ) A q(x) B A λx.q(x) B X S[x] 1 x X ad x Quantum programming λ- - S F a F C 1 a FX
21 λ- in cartesian closed categories Theorem (Lambek, Adv. in Math. 79) Let S be a cartesian closed category, and S[x] the free cartesian closed category generated by S and x : 1 X. Quantum programming λ- -
22 λ- in cartesian closed categories Theorem (Lambek, Adv. in Math. 79) Let S be a cartesian closed category, and S[x] the free cartesian closed category generated by S and x : 1 X. Then the inclusion ad x : S S[x] has a right adjoint ab x : S[x] S : A A X and the transpositions A ϕ,x B X X ǫ B A ϕ B X S[x](ad x A, B) S(A, ab x B) A q(x) B A λx.q(x) B X Quantum programming λ- - model λ- and application.
23 λ- in cartesian closed categories Theorem (Lambek, Adv. in Math. 79) Let S be a cartesian closed category, and S[x] the free cartesian closed category generated by S and x : 1 X. Then the inclusion ad x : S S[x] has a right adjoint ab x : S[x] S : A A X and the transpositions A ϕ,x B X X ǫ B A ϕ B X S[x](ad x A, B) S(A, ab x B) A q(x) B A λx.q(x) B X Quantum programming λ- - model λ- and application. S[x] is isomorphic with the Kleisli category for the power monad ( ) X.
24 κ- in cartesian Theorem (Lambek, Adv. in Math. 79) categories Let S be a cartesian category, and S[x] the free cartesian category generated by S and x : 1 X. Then the inclusion ad x : S S[x] has a left adjoint ab x : S[x] S : A X A and the transpositions A x,id X A ϕ B X A ϕ B S[x](A, ad x B) S(ab x A, B) A f x B X A κ x.fx B Quantum programming λ- - model first order and application. S[x] is isomorphic with the Kleisli category for the product comonad X ( ).
25 κ- in monoidal Theorem (DP, MSCS 95) categories Let C be a monoidal category, and C[x] the free monoidal category generated by C and x : 1 X. Then the strong adjunctions ab x ad x : C C[x] are in one-to-one correspondence with the internal comonoid structures on X. The transpositions A X A x A B ϕ C[x](A, ad x B) A f x B Quantum programming λ- - X A ϕ B C(ab x A, B) X A κ x.fx B model action and application. C[x] is isomorphic with the Kleisli category for the comonad X ( ), induced by any of the comonoid structures.
26 κ- in monoidal categories Task Extend this to. Quantum programming λ- -
27 κ- in monoidal categories Task Extend this to. Problem Lots of complicated diagram chasing. Quantum programming λ- -
28 κ- in monoidal categories Task Extend this to. Problem Lots of complicated diagram chasing. Solution? What does mean graphically? Quantum programming λ- -
29 Outline Quantum programming λ- Abstraction with pictures Consequences - Abstraction in Category of measurements -
30 Objects X A B D X A B D -
31 Identities X A B D X A B D X A B D X A B D id -
32 Morphisms B X B X h h - X A B D X A B D
33 Tensor (parallel composition) B X C B X C h f h f - X A B D X X A B D X
34 Sequential composition B X C B X C h f h f - X A B D X X A B D X g X A B g D D X X A B D D X
35 Elements (vectors) and coelements (functionals) b B X C h f B X B X b B X C h f - X A B D X X A B D X g X A B g a D D X X A B D D X X a D D X X I D D X
36 Symmetry b B X C h f B X c D g B X B X b B X C h f X A D B X X A c X X A B D X X A B g - X A a B D D X X A B D D X X a D D X X I D D X
37 Polynomials X b B X C h f B X c D g A B D D X a B X B X b B X C h f X A D B X id x X A D B I X A c r X A B D X A B g X A B D D X x a D D x I I D D I -
38 Outline Quantum programming λ- Abstraction with pictures Consequences - Abstraction in Category of measurements Abstraction with pictures Consequences -
39 Abstraction with pictures Theorem (again) Let C be a symmetric monoidal category, and C[x] the free symmetric monoidal category generated by C and x : 1 X. Then there is a one-to-one correspondence between adjunctions ab x ad x : C C[x] satisfying 1. ab x (A B) = ab x (A) B 2. η(a B) = η(a) B 3. η I = x and commutative comonoids on X. Abstraction with pictures Consequences -
40 Abstraction with pictures Theorem (again) Let C be a symmetric monoidal category, and C[x] the free symmetric monoidal category generated by C and x : 1 X. Then there is a one-to-one correspondence between adjunctions ab x ad x : C C[x] satisfying 1. ab x (A B) = ab x (A) B 2. η(a B) = η(a) B 3. η I = x and commutative comonoids on X. Abstraction with pictures Consequences - C[x] is isomorphic with the Kleisli category for the commutative comonad X ( ), induced by any of the comonoid structures.
41 Proof ( ) Given ab x ad x : C C[x], conditions imply ab x (A) = X A η(a) = x A Abstraction with pictures Consequences -
42 Proof ( ) Therefore the correspondence C ( ab x (A), B ) C[x] ( A, ad x (B) ) Abstraction with pictures Consequences -
43 Proof ( )... is actually C(X A, B) C[x](A, B) Abstraction with pictures Consequences -
44 Proof ( )... with C(X A, B) C[x](A, B) B f X A ( ) (x A) B f A Abstraction with pictures Consequences -
45 Proof ( )... and C(X A, B) C[x](A, B) h f κx. h f Abstraction with pictures Consequences - g g X
46 Proof ( ) The bijection corresponds to the conversion: ( ) (x A) C(X A, B) = C[x](A, B) κx. ( ) ( κx. ϕ(x) x A) = ϕ(x) (β-rule Abstraction with pictures Consequences - κx. ( f (x A) ) = f (η-rule
47 Proof ( ) The comonoid structure (X,, ) is = κx. = κx. X X id I Abstraction with pictures Consequences -
48 Proof ( ) The conversion rules imply the comonoid laws = = Abstraction with pictures Consequences - = =
49 Proof ( ) Given (X,, ), use its copying and deleting power, and the symmetries, to normalize every C[x]-arrow: ϕ(x) = ϕ (x A) h f h f Abstraction with pictures Consequences - g g
50 Proof ( ) Then set κx. ϕ(x) = ϕ to get ( ) (x A) C(X A, B) = C[x](A, B) κx. ( ) ( κx. ϕ(x) x A) = ϕ(x) (β-rule Abstraction with pictures Consequences - κx. ( f (x A) ) = f (η-rule
51 Remark C[x] = C X and C[x, y] = C X Y = KL(X Y ), reduce the finite polynomials to the Kleisli morphisms. Abstraction with pictures Consequences -
52 Remark C[x] = C X and C[x, y] = C X Y = KL(X Y ), reduce the finite polynomials to the Kleisli morphisms. But the extensions C[X], where X is large are also of interest. Abstraction with pictures Consequences -
53 Remark C[x] = C X and C[x, y] = C X Y = KL(X Y ), reduce the finite polynomials to the Kleisli morphisms. But the extensions C[X], where X is large are also of interest. Abstraction with pictures Consequences - Cf. N[N], Set[Set], and CPM(C).
54 Interpretation Abstraction with pictures Consequences -
55 Interpretation Upshot In symmetric monoidal categories, applies just to copiable and deletable data. Abstraction with pictures Consequences -
56 Interpretation Upshot In symmetric monoidal categories, applies just to copiable and deletable data. Definition A vector ϕ C(I, X) is a base vector (or a set-like element) with respect to the operation κx if it can be copied and deleted in C[x] (κx.x x) ϕ = ϕ ϕ Abstraction with pictures Consequences - (κx.id I ) ϕ = id I
57 Interpretation Upshot In symmetric monoidal categories, applies just to copiable and deletable data. Definition A vector ϕ C(I, X) is a base vector (or a set-like element) with respect to the operation κx if it can be copied and deleted in C[x] (κx.x x) ϕ = ϕ ϕ Abstraction with pictures Consequences - (κx.id I ) ϕ = id I Proposition ϕ C(I, X) is a base vector with respect to κx if and only if it is a homomorphism for the comonoid structure X X X I corresponding to κx.
58 Interpretation Upshot In other words, only the base vectors can be substituted for variables. Abstraction with pictures Consequences -
59 Interpretation Upshot In other words, only the base vectors can be substituted for variables. Definition Substitution is a structure preserving ioof C[x] C. Abstraction with pictures Consequences -
60 Interpretation Upshot In other words, only the base vectors can be substituted for variables. Definition Substitution is a structure preserving ioof C[x] C. Corollary The substitution functors C[x] C are in one-to-one correspondence with the base vectors of type X. Abstraction with pictures Consequences -
61 Outline Quantum programming λ- Abstraction with pictures Consequences - Abstraction in - Abstraction in Category of measurements
62 Definitions A -category C is given with an involutive ioof : C op C. - Abstraction in
63 Definitions A -category C is given with an involutive ioof : C op C. A morphism f in a -category C is called unitary if f = f 1. - Abstraction in
64 Definitions A -category C is given with an involutive ioof : C op C. A morphism f in a -category C is called unitary if f = f 1. A (symmetric) monoidal category C is -monoidal if its monoidal isomorphisms are unitary. - Abstraction in
65 Using the monoidal s for: vectors: C(A) = C(I, A) scalars: I = C(I, I) - Abstraction in
66 Using the monoidal s for: vectors: C(A) = C(I, A) scalars: I = C(I, I) in every -monoidal category we can define abstract inner product A : C(A) C(A) I ( ) ϕ (ϕ, ψ : I A) I A ψ I - Abstraction in
67 Using the monoidal s for: vectors: C(A) = C(I, A) scalars: I = C(I, I) in every -monoidal category we can define abstract inner product A : C(A) C(A) I ( ) ϕ (ϕ, ψ : I A) I A ψ I partial inner product AB : C(A B) C(A) C(B) ( ) (ϕ : I A B, ψ : I A) ϕ I A B ψ B B - Abstraction in
68 Using the monoidal s for: vectors: C(A) = C(I, A) scalars: I = C(I, I) in every -monoidal category we can define abstract inner product A : C(A) C(A) I ( ) ϕ (ϕ, ψ : I A) I A ψ I partial inner product AB : C(A B) C(A) C(B) ( ) (ϕ : I A B, ψ : I A) ϕ I A B ψ B B - Abstraction in entangled vectors η C(A A), such that ϕ C(A) η ϕ AA = ϕ
69 Using entangled vectors ηa : I A A and, ηb : I B Band their adjoints εa = η A : A A I and εb = η B : B B I - Abstraction in
70 Using entangled vectors ηa : I A A and, ηb : I B Band their adjoints εa = η A : A A I and εb = η B : B B I we can define for every f : A B the dual f : B A - Abstraction in f = B Bη BAA BfA BBA εa A
71 Using entangled vectors ηa : I A A and, ηb : I B Band their adjoints εa = η A : A A I and εb = η B : B B I we can define for every f : A B the dual f : B A - Abstraction in f = B Bη BAA BfA BBA εa A the conjugate f : A B f = f = f
72 Proposition For every object A in a -monoidal category C holds (a) (b) = (c), - Abstraction in
73 Proposition For every object A in a -monoidal category C holds (a) (b) = (c), where (a) η C(A A) is entangled - Abstraction in
74 Proposition For every object A in a -monoidal category C holds (a) (b) = (c), where (a) η C(A A) is entangled (b) ε = η C(A A, I) internalizes the inner product ε (ψ ϕ) = ϕ ψ - Abstraction in
75 Proposition For every object A in a -monoidal category C holds (a) (b) = (c), where (a) η C(A A) is entangled (b) ε = η C(A A, I) internalizes the inner product ε (ψ ϕ) = ϕ ψ (c) (η,ε) realize the self-adjunction A A, in the sense - Abstraction in A η A A A A A ε A = id A A A η A A A ε A A = id A The three conditions are equivalent if I generates C.
76 Proposition in pictures For every object A in a -monoidal category C holds (a) (b) = (c), where (a) (b) ψ η η ψ ϕ = = ψ ψ ϕ - Abstraction in (c) η η = = X η η
77 Definition A object in a -monoidal category is an object equipped with the structure from the preceding proposition. - Abstraction in
78 Definition A object in a -monoidal category is an object equipped with the structure from the preceding proposition. - Remark The subcategory of objects in any -monoidal category is -compact (strongly compact) with all objects self-adjoint. Abstraction in
79 Abstraction in Theorem Let C be a -monoidal category, and X X X I a comonoid that induces ab x ad x : C C[x]. - Abstraction in
80 Abstraction in Theorem Let C be a -monoidal category, and X X X I a comonoid that induces ab x ad x : C C[x]. Then the following conditions are equivalent: - Abstraction in
81 Abstraction in Theorem Let C be a -monoidal category, and X X X I a comonoid that induces ab x ad x : C C[x]. Then the following conditions are equivalent: (a) ad x : C C[x] creates : C[x] op C[x] such that x x = x x = id I. - Abstraction in
82 Abstraction in Theorem Let C be a -monoidal category, and X X X I a comonoid that induces ab x ad x : C C[x]. Then the following conditions are equivalent: (a) ad x : C C[x] creates : C[x] op C[x] such that x x = x x = id I. (b) η = and ε = η = realize X X. - Abstraction in
83 Abstraction in Theorem Let C be a -monoidal category, and X X X I a comonoid that induces ab x ad x : C C[x]. Then the following conditions are equivalent: (a) ad x : C C[x] creates : C[x] op C[x] such that x x = x x = id I. (b) η = and ε = η = realize X X. (c) (X ) ( X) = = ( X) (X ) - Abstraction in
84 Abstraction in Theorem Let C be a -monoidal category, and X X X I a comonoid that induces ab x ad x : C C[x]. Then the following conditions are equivalent: (a) ad x : C C[x] creates : C[x] op C[x] such that x x = x x = id I. (b) η = and ε = η = realize X X. (c) (X ) ( X) = = ( X) (X ) - Abstraction in where X X X I is the induced monoid = =
85 Abstraction in Theorem in pictures (b) = = X - Abstraction in
86 Abstraction in Theorem in pictures (c) = = - Abstraction in
87 Proof of (b)= (c) Lemma 1 If (b) holds then - = = Abstraction in
88 Proof of (b)= (c) Then (c) also holds because = = = - Abstraction in =
89 Proof of Lemma 1 Lemma 2 If η ε = = X ε η - Abstraction in then η ε ε = = X X ε ε η η η
90 Proof of Lemma 1 Using Lemma 2, and the fact that (b) implies = =, we get ε ε = η = η = - Abstraction in η η = η
91 The message of the proof - Abstraction in
92 The message of the proof There is more to categories than just diagram chasing. - Abstraction in
93 The message of the proof There is more to categories than just diagram chasing. - There is also picture chasing. Abstraction in
94 Definition A classical object in a -monoidal category C is a comonoid X X X I satisfying the equivalent conditions from the preceding theorem. - Abstraction in
95 Definition A classical object in a -monoidal category C is a comonoid X X X I satisfying the equivalent conditions from the preceding theorem. Let C be the category of classical objects and comonoid homomorphisms in C. - Abstraction in
96 Definition A classical object in a -monoidal category C is a comonoid X X X I satisfying the equivalent conditions from the preceding theorem. Let C be the category of classical objects and comonoid homomorphisms in C. Question: What is classical about classical objects? - Abstraction in
97 Definition A classical object in a -monoidal category C is a comonoid X X X I satisfying the equivalent conditions from the preceding theorem. Let C be the category of classical objects and comonoid homomorphisms in C. Question: What is classical about classical objects? classical structure structure - Abstraction in
98 Definition A classical object in a -monoidal category C is a comonoid X X X I satisfying the equivalent conditions from the preceding theorem. Let C be the category of classical objects and comonoid homomorphisms in C. Question: What is classical about classical objects? classical structure structure Answer: classical elements = base vectors - Abstraction in
99 Definition A classical object in a -monoidal category C is a comonoid X X X I satisfying the equivalent conditions from the preceding theorem. Let C be the category of classical objects and comonoid homomorphisms in C. Question: What is classical about classical objects? classical structure structure Answer: classical elements = base vectors is neither injective or surjective - Abstraction in
100 Consequences Upshot The Frobenius condition (c) assures the preservation of the operation under. - Abstraction in
101 Consequences Upshot The Frobenius condition (c) assures the preservation of the operation under. This leads to entanglement. - Abstraction in
102 Consequences Proposition The vectors C(X) of any classical object X form a -algebra. - Abstraction in
103 Consequences Proposition The vectors C(X) of any classical object X form a -algebra. - Abstraction in ϕ ψ = (ϕ ψ) ǫ = ϕ = ϕ = ϕ
104 Definition Two vectors ϕ, ψ C(A) in a -monoidal category are orthonormal if their inner product is idempotent: ϕ ψ = ϕ ψ 2 - Abstraction in
105 Definition Two vectors ϕ, ψ C(A) in a -monoidal category are orthonormal if their inner product is idempotent: ϕ ψ = ϕ ψ 2 - Proposition Any two base vectors are orthonormal. In particular, any two variables in a polynomial category are orthonormal. Abstraction in
106 Definition A classical object X is standard if it is (regularly) generated by its base vectors B(X) = {ϕ C(X) (κx. x x)ϕ = ϕ ϕ (κx. id I )ϕ = id I } - Abstraction in
107 Definition A classical object X is standard if it is (regularly) generated by its base vectors in the sense B(X) = {ϕ C(X) (κx. x x)ϕ = ϕ ϕ (κx. id I )ϕ = id I } f, g C(X, Y). ( ϕ B(X). fϕ = gϕ) = f = g - Abstraction in A base is regular if C(X, Y) C(Y) B(X) splits.
108 Proposition 1. All standard classical structures, that an object X C may carry, induce the bases with the same number of elements. - Abstraction in
109 Proposition 1. All standard classical structures, that an object X C may carry, induce the bases with the same number of elements. - Abstraction in Proposition 2. Let X C be a classical object with a regular base. Then the equipotent regular bases on any Y C are in one-to-one correspondence with the unitaries X Y.
110 Definition A qubit type in an arbitrary -monoidal category C is a classical object B with a unitary H of order 2. The induced bases are usually denoted by 0, 1, and +,. - Abstraction in
111 Definition A qubit type in an arbitrary -monoidal category C is a classical object B with a unitary H of order 2. The induced bases are usually denoted by 0, 1, and +,. - Computing with qubits A -monoidal category with B suffices for the basic algorithms. Abstraction in
112 Definition A qubit type in an arbitrary -monoidal category C is a classical object B with a unitary H of order 2. The induced bases are usually denoted by 0, 1, and +,. - Computing with qubits A -monoidal category with B suffices for the basic algorithms. A Klein group of unitaries on B suffices for all teleportation and dense coding schemes. Abstraction in
113 Proposition (Coecke, Vicary, P) Every classical object X in FHilb is regular, and X = C n. The classical structure is induced by a base B(X) = { i i n }, with i = ii = 1 n n i i=1 - Abstraction in
114 Proposition (Coecke, Vicary, P) Every classical object X in FHilb is regular, and X = C n. The classical structure is induced by a base B(X) = { i i n }, with i = ii = 1 n n i i=1 - Abstraction in Moreover, FHilb FSet
115 Proof A -algebra in FHilb is a C -algebra. - Abstraction in
116 Proof A -algebra in FHilb is a C -algebra. Thus for a classical X FHilb, : FHilb(X) FHilb(X, X) ( ) ϕ I X ( X ϕ X X X X ) is a representation of a commutative C -algebra. - Abstraction in
117 Proof Working through the Gelfand-Naimark duality, we get X = C n - Abstraction in
118 Proof Working through the Gelfand-Naimark duality, we get X = C n - Abstraction in because the spectrum of a commutative finitely dimensional C -algebra is a discrete set n of minimal central projections, while the representing spaces are the full matrix algebras C(1)
119 Outline Quantum programming λ- Abstraction with pictures Consequences - Abstraction in Category of measurements -
120 Category of measurements ((this was not presented)) -
121 Outline Quantum programming λ- Abstraction with pictures Consequences - Abstraction in Category of measurements -
122 Claim: Task: Simple algorithms have simple categorical semantics. Implement and analyze algorithms in nonstandard models: network computation, data mining. -
it is easy to see that α = a
21. Polynomial rings Let us now turn out attention to determining the prime elements of a polynomial ring, where the coefficient ring is a field. We already know that such a polynomial ring is a UF. Therefore
More informationFinite dimensional C -algebras
Finite dimensional C -algebras S. Sundar September 14, 2012 Throughout H, K stand for finite dimensional Hilbert spaces. 1 Spectral theorem for self-adjoint opertors Let A B(H) and let {ξ 1, ξ 2,, ξ n
More informationNOTES ON CATEGORIES AND FUNCTORS
NOTES ON CATEGORIES AND FUNCTORS These notes collect basic definitions and facts about categories and functors that have been mentioned in the Homological Algebra course. For further reading about category
More informationChapter 13: Basic ring theory
Chapter 3: Basic ring theory Matthew Macauley Department of Mathematical Sciences Clemson University http://www.math.clemson.edu/~macaule/ Math 42, Spring 24 M. Macauley (Clemson) Chapter 3: Basic ring
More informationSOME PROPERTIES OF FIBER PRODUCT PRESERVING BUNDLE FUNCTORS
SOME PROPERTIES OF FIBER PRODUCT PRESERVING BUNDLE FUNCTORS Ivan Kolář Abstract. Let F be a fiber product preserving bundle functor on the category FM m of the proper base order r. We deduce that the r-th
More informationSection 6.1 - Inner Products and Norms
Section 6.1 - Inner Products and Norms Definition. Let V be a vector space over F {R, C}. An inner product on V is a function that assigns, to every ordered pair of vectors x and y in V, a scalar in F,
More informationMathematics Course 111: Algebra I Part IV: Vector Spaces
Mathematics Course 111: Algebra I Part IV: Vector Spaces D. R. Wilkins Academic Year 1996-7 9 Vector Spaces A vector space over some field K is an algebraic structure consisting of a set V on which are
More informationON GALOIS REALIZATIONS OF THE 2-COVERABLE SYMMETRIC AND ALTERNATING GROUPS
ON GALOIS REALIZATIONS OF THE 2-COVERABLE SYMMETRIC AND ALTERNATING GROUPS DANIEL RABAYEV AND JACK SONN Abstract. Let f(x) be a monic polynomial in Z[x] with no rational roots but with roots in Q p for
More information3. Prime and maximal ideals. 3.1. Definitions and Examples.
COMMUTATIVE ALGEBRA 5 3.1. Definitions and Examples. 3. Prime and maximal ideals Definition. An ideal P in a ring A is called prime if P A and if for every pair x, y of elements in A\P we have xy P. Equivalently,
More informationFIBER PRODUCTS AND ZARISKI SHEAVES
FIBER PRODUCTS AND ZARISKI SHEAVES BRIAN OSSERMAN 1. Fiber products and Zariski sheaves We recall the definition of a fiber product: Definition 1.1. Let C be a category, and X, Y, Z objects of C. Fix also
More informationHow To Prove The Dirichlet Unit Theorem
Chapter 6 The Dirichlet Unit Theorem As usual, we will be working in the ring B of algebraic integers of a number field L. Two factorizations of an element of B are regarded as essentially the same if
More information(a) Write each of p and q as a polynomial in x with coefficients in Z[y, z]. deg(p) = 7 deg(q) = 9
Homework #01, due 1/20/10 = 9.1.2, 9.1.4, 9.1.6, 9.1.8, 9.2.3 Additional problems for study: 9.1.1, 9.1.3, 9.1.5, 9.1.13, 9.2.1, 9.2.2, 9.2.4, 9.2.5, 9.2.6, 9.3.2, 9.3.3 9.1.1 (This problem was not assigned
More informationGROUPS ACTING ON A SET
GROUPS ACTING ON A SET MATH 435 SPRING 2012 NOTES FROM FEBRUARY 27TH, 2012 1. Left group actions Definition 1.1. Suppose that G is a group and S is a set. A left (group) action of G on S is a rule for
More information1 = (a 0 + b 0 α) 2 + + (a m 1 + b m 1 α) 2. for certain elements a 0,..., a m 1, b 0,..., b m 1 of F. Multiplying out, we obtain
Notes on real-closed fields These notes develop the algebraic background needed to understand the model theory of real-closed fields. To understand these notes, a standard graduate course in algebra is
More informationFinite Projective demorgan Algebras. honoring Jorge Martínez
Finite Projective demorgan Algebras Simone Bova Vanderbilt University (Nashville TN, USA) joint work with Leonardo Cabrer March 11-13, 2011 Vanderbilt University (Nashville TN, USA) honoring Jorge Martínez
More information1 Sets and Set Notation.
LINEAR ALGEBRA MATH 27.6 SPRING 23 (COHEN) LECTURE NOTES Sets and Set Notation. Definition (Naive Definition of a Set). A set is any collection of objects, called the elements of that set. We will most
More informationThe Division Algorithm for Polynomials Handout Monday March 5, 2012
The Division Algorithm for Polynomials Handout Monday March 5, 0 Let F be a field (such as R, Q, C, or F p for some prime p. This will allow us to divide by any nonzero scalar. (For some of the following,
More informationISOMETRIES OF R n KEITH CONRAD
ISOMETRIES OF R n KEITH CONRAD 1. Introduction An isometry of R n is a function h: R n R n that preserves the distance between vectors: h(v) h(w) = v w for all v and w in R n, where (x 1,..., x n ) = x
More informationOnline publication date: 11 March 2010 PLEASE SCROLL DOWN FOR ARTICLE
This article was downloaded by: [Modoi, George Ciprian] On: 12 March 2010 Access details: Access Details: [subscription number 919828804] Publisher Taylor & Francis Informa Ltd Registered in England and
More informationcalculating the result modulo 3, as follows: p(0) = 0 3 + 0 + 1 = 1 0,
Homework #02, due 1/27/10 = 9.4.1, 9.4.2, 9.4.5, 9.4.6, 9.4.7. Additional problems recommended for study: (9.4.3), 9.4.4, 9.4.9, 9.4.11, 9.4.13, (9.4.14), 9.4.17 9.4.1 Determine whether the following polynomials
More informationParametric Domain-theoretic models of Linear Abadi & Plotkin Logic
Parametric Domain-theoretic models of Linear Abadi & Plotkin Logic Lars Birkedal Rasmus Ejlers Møgelberg Rasmus Lerchedahl Petersen IT University Technical Report Series TR-00-7 ISSN 600 600 February 00
More informationLet H and J be as in the above lemma. The result of the lemma shows that the integral
Let and be as in the above lemma. The result of the lemma shows that the integral ( f(x, y)dy) dx is well defined; we denote it by f(x, y)dydx. By symmetry, also the integral ( f(x, y)dx) dy is well defined;
More informationPolynomial Invariants
Polynomial Invariants Dylan Wilson October 9, 2014 (1) Today we will be interested in the following Question 1.1. What are all the possible polynomials in two variables f(x, y) such that f(x, y) = f(y,
More informationEXERCISES FOR THE COURSE MATH 570, FALL 2010
EXERCISES FOR THE COURSE MATH 570, FALL 2010 EYAL Z. GOREN (1) Let G be a group and H Z(G) a subgroup such that G/H is cyclic. Prove that G is abelian. Conclude that every group of order p 2 (p a prime
More informationFinite dimensional topological vector spaces
Chapter 3 Finite dimensional topological vector spaces 3.1 Finite dimensional Hausdorff t.v.s. Let X be a vector space over the field K of real or complex numbers. We know from linear algebra that the
More informationACTA UNIVERSITATIS APULENSIS No 15/2008 PRODUCTS OF MULTIALGEBRAS AND THEIR FUNDAMENTAL ALGEBRAS. Cosmin Pelea
ACTA UNIVERSITATIS APULENSIS No 15/2008 PRODUCTS OF MULTIALGEBRAS AND THEIR FUNDAMENTAL ALGEBRAS Cosmin Pelea Abstract. An important tool in the hyperstructure theory is the fundamental relation. The factorization
More informationLecture 18 - Clifford Algebras and Spin groups
Lecture 18 - Clifford Algebras and Spin groups April 5, 2013 Reference: Lawson and Michelsohn, Spin Geometry. 1 Universal Property If V is a vector space over R or C, let q be any quadratic form, meaning
More informationIntroduction to Modern Algebra
Introduction to Modern Algebra David Joyce Clark University Version 0.0.6, 3 Oct 2008 1 1 Copyright (C) 2008. ii I dedicate this book to my friend and colleague Arthur Chou. Arthur encouraged me to write
More information= 2 + 1 2 2 = 3 4, Now assume that P (k) is true for some fixed k 2. This means that
Instructions. Answer each of the questions on your own paper, and be sure to show your work so that partial credit can be adequately assessed. Credit will not be given for answers (even correct ones) without
More informationALGEBRA HW 5 CLAY SHONKWILER
ALGEBRA HW 5 CLAY SHONKWILER 510.5 Let F = Q(i). Prove that x 3 and x 3 3 are irreducible over F. Proof. If x 3 is reducible over F then, since it is a polynomial of degree 3, it must reduce into a product
More informationFUNCTIONAL ANALYSIS LECTURE NOTES: QUOTIENT SPACES
FUNCTIONAL ANALYSIS LECTURE NOTES: QUOTIENT SPACES CHRISTOPHER HEIL 1. Cosets and the Quotient Space Any vector space is an abelian group under the operation of vector addition. So, if you are have studied
More informationMath 312 Homework 1 Solutions
Math 31 Homework 1 Solutions Last modified: July 15, 01 This homework is due on Thursday, July 1th, 01 at 1:10pm Please turn it in during class, or in my mailbox in the main math office (next to 4W1) Please
More informationOn the structure of C -algebra generated by a family of partial isometries and multipliers
Armenian Journal of Mathematics Volume 7, Number 1, 2015, 50 58 On the structure of C -algebra generated by a family of partial isometries and multipliers A. Yu. Kuznetsova and Ye. V. Patrin Kazan Federal
More informationChapter 4, Arithmetic in F [x] Polynomial arithmetic and the division algorithm.
Chapter 4, Arithmetic in F [x] Polynomial arithmetic and the division algorithm. We begin by defining the ring of polynomials with coefficients in a ring R. After some preliminary results, we specialize
More informationRESULTANT AND DISCRIMINANT OF POLYNOMIALS
RESULTANT AND DISCRIMINANT OF POLYNOMIALS SVANTE JANSON Abstract. This is a collection of classical results about resultants and discriminants for polynomials, compiled mainly for my own use. All results
More informationINTRODUCTORY SET THEORY
M.Sc. program in mathematics INTRODUCTORY SET THEORY Katalin Károlyi Department of Applied Analysis, Eötvös Loránd University H-1088 Budapest, Múzeum krt. 6-8. CONTENTS 1. SETS Set, equal sets, subset,
More informationLinear Maps. Isaiah Lankham, Bruno Nachtergaele, Anne Schilling (February 5, 2007)
MAT067 University of California, Davis Winter 2007 Linear Maps Isaiah Lankham, Bruno Nachtergaele, Anne Schilling (February 5, 2007) As we have discussed in the lecture on What is Linear Algebra? one of
More informationSimilarity and Diagonalization. Similar Matrices
MATH022 Linear Algebra Brief lecture notes 48 Similarity and Diagonalization Similar Matrices Let A and B be n n matrices. We say that A is similar to B if there is an invertible n n matrix P such that
More informationBANACH AND HILBERT SPACE REVIEW
BANACH AND HILBET SPACE EVIEW CHISTOPHE HEIL These notes will briefly review some basic concepts related to the theory of Banach and Hilbert spaces. We are not trying to give a complete development, but
More informationDomino Tableaux, Schützenberger Involution, and the Symmetric Group Action
Domino Tableaux, Schützenberger Involution, and the Symmetric Group Action Arkady Berenstein and Anatol N. Kirillov CRM-2510 September 1997 Department of Mathematics, Cornell University, Ithaca, NY 14853,
More informationGroup Theory. Contents
Group Theory Contents Chapter 1: Review... 2 Chapter 2: Permutation Groups and Group Actions... 3 Orbits and Transitivity... 6 Specific Actions The Right regular and coset actions... 8 The Conjugation
More informationPROBLEM SET 6: POLYNOMIALS
PROBLEM SET 6: POLYNOMIALS 1. introduction In this problem set we will consider polynomials with coefficients in K, where K is the real numbers R, the complex numbers C, the rational numbers Q or any other
More informationQuotient Rings and Field Extensions
Chapter 5 Quotient Rings and Field Extensions In this chapter we describe a method for producing field extension of a given field. If F is a field, then a field extension is a field K that contains F.
More informationFactorization in Polynomial Rings
Factorization in Polynomial Rings These notes are a summary of some of the important points on divisibility in polynomial rings from 17 and 18 of Gallian s Contemporary Abstract Algebra. Most of the important
More informationLINEAR ALGEBRA W W L CHEN
LINEAR ALGEBRA W W L CHEN c W W L Chen, 1997, 2008 This chapter is available free to all individuals, on understanding that it is not to be used for financial gain, and may be downloaded and/or photocopied,
More informationNon-unique factorization of polynomials over residue class rings of the integers
Comm. Algebra 39(4) 2011, pp 1482 1490 Non-unique factorization of polynomials over residue class rings of the integers Christopher Frei and Sophie Frisch Abstract. We investigate non-unique factorization
More informationGENERATING SETS KEITH CONRAD
GENERATING SETS KEITH CONRAD 1 Introduction In R n, every vector can be written as a unique linear combination of the standard basis e 1,, e n A notion weaker than a basis is a spanning set: a set of vectors
More informationT ( a i x i ) = a i T (x i ).
Chapter 2 Defn 1. (p. 65) Let V and W be vector spaces (over F ). We call a function T : V W a linear transformation form V to W if, for all x, y V and c F, we have (a) T (x + y) = T (x) + T (y) and (b)
More informationPOLYNOMIAL RINGS AND UNIQUE FACTORIZATION DOMAINS
POLYNOMIAL RINGS AND UNIQUE FACTORIZATION DOMAINS RUSS WOODROOFE 1. Unique Factorization Domains Throughout the following, we think of R as sitting inside R[x] as the constant polynomials (of degree 0).
More informationMATH PROBLEMS, WITH SOLUTIONS
MATH PROBLEMS, WITH SOLUTIONS OVIDIU MUNTEANU These are free online notes that I wrote to assist students that wish to test their math skills with some problems that go beyond the usual curriculum. These
More informationI. GROUPS: BASIC DEFINITIONS AND EXAMPLES
I GROUPS: BASIC DEFINITIONS AND EXAMPLES Definition 1: An operation on a set G is a function : G G G Definition 2: A group is a set G which is equipped with an operation and a special element e G, called
More information4: EIGENVALUES, EIGENVECTORS, DIAGONALIZATION
4: EIGENVALUES, EIGENVECTORS, DIAGONALIZATION STEVEN HEILMAN Contents 1. Review 1 2. Diagonal Matrices 1 3. Eigenvectors and Eigenvalues 2 4. Characteristic Polynomial 4 5. Diagonalizability 6 6. Appendix:
More informationTHE FUNDAMENTAL THEOREM OF ALGEBRA VIA PROPER MAPS
THE FUNDAMENTAL THEOREM OF ALGEBRA VIA PROPER MAPS KEITH CONRAD 1. Introduction The Fundamental Theorem of Algebra says every nonconstant polynomial with complex coefficients can be factored into linear
More information4.1 Modules, Homomorphisms, and Exact Sequences
Chapter 4 Modules We always assume that R is a ring with unity 1 R. 4.1 Modules, Homomorphisms, and Exact Sequences A fundamental example of groups is the symmetric group S Ω on a set Ω. By Cayley s Theorem,
More informationCODING TRUE ARITHMETIC IN THE MEDVEDEV AND MUCHNIK DEGREES
CODING TRUE ARITHMETIC IN THE MEDVEDEV AND MUCHNIK DEGREES PAUL SHAFER Abstract. We prove that the first-order theory of the Medvedev degrees, the first-order theory of the Muchnik degrees, and the third-order
More informationThe Convolution Operation
The Convolution Operation Convolution is a very natural mathematical operation which occurs in both discrete and continuous modes of various kinds. We often encounter it in the course of doing other operations
More informationChapter 7. Homotopy. 7.1 Basic concepts of homotopy. Example: z dz. z dz = but
Chapter 7 Homotopy 7. Basic concepts of homotopy Example: but γ z dz = γ z dz γ 2 z dz γ 3 z dz. Why? The domain of /z is C 0}. We can deform γ continuously into γ 2 without leaving C 0}. Intuitively,
More informationGROUP ALGEBRAS. ANDREI YAFAEV
GROUP ALGEBRAS. ANDREI YAFAEV We will associate a certain algebra to a finite group and prove that it is semisimple. Then we will apply Wedderburn s theory to its study. Definition 0.1. Let G be a finite
More informationLinear Types for Continuations
1/28 Linear Types for Continuations Alex Simpson LFCS, School of Informatics University of Edinburgh, UK Joint work with: Jeff Egger (LFCS, Edinburgh) Rasmus Møgelberg (ITU, Copenhagen) Linear Types for
More informationLinear Algebra. A vector space (over R) is an ordered quadruple. such that V is a set; 0 V ; and the following eight axioms hold:
Linear Algebra A vector space (over R) is an ordered quadruple (V, 0, α, µ) such that V is a set; 0 V ; and the following eight axioms hold: α : V V V and µ : R V V ; (i) α(α(u, v), w) = α(u, α(v, w)),
More informationDirect models of the computational lambda-calculus
Electronic Notes in Theoretical Computer Science 20 (1999) URL: http://www.elsevier.nl/locate/entcs/volume20.html 49 pages Direct models of the computational lambda-calculus Carsten Führmann 1 Division
More informationMathematics for Computer Science/Software Engineering. Notes for the course MSM1F3 Dr. R. A. Wilson
Mathematics for Computer Science/Software Engineering Notes for the course MSM1F3 Dr. R. A. Wilson October 1996 Chapter 1 Logic Lecture no. 1. We introduce the concept of a proposition, which is a statement
More informationFoundational Methods in Computer Science 2013 Abstracts
Foundational Methods in Computer Science 2013 Abstracts Mount Allison University, May 31st-June 3rd, 2013 Tutorials and invited lectures Joachim Kock (Barcelona): Polynomial functors over groupoids: from
More informationFactorization Algorithms for Polynomials over Finite Fields
Degree Project Factorization Algorithms for Polynomials over Finite Fields Sajid Hanif, Muhammad Imran 2011-05-03 Subject: Mathematics Level: Master Course code: 4MA11E Abstract Integer factorization is
More informationBABY VERMA MODULES FOR RATIONAL CHEREDNIK ALGEBRAS
BABY VERMA MODULES FOR RATIONAL CHEREDNIK ALGEBRAS SETH SHELLEY-ABRAHAMSON Abstract. These are notes for a talk in the MIT-Northeastern Spring 2015 Geometric Representation Theory Seminar. The main source
More informationTechniques algébriques en calcul quantique
Techniques algébriques en calcul quantique E. Jeandel Laboratoire de l Informatique du Parallélisme LIP, ENS Lyon, CNRS, INRIA, UCB Lyon 8 Avril 25 E. Jeandel, LIP, ENS Lyon Techniques algébriques en calcul
More informationJET-LIKE APPROACH TO WEIL BUNDLES
Masaryk University, Brno, 2001 Seminar Lecture Notes JET-LIKE APPROACH TO WEIL BUNDLES Ivan Kolář This is a survey of basic concepts and results from the theory of Weil bundles that is based on the idea
More informationRINGS WITH A POLYNOMIAL IDENTITY
RINGS WITH A POLYNOMIAL IDENTITY IRVING KAPLANSKY 1. Introduction. In connection with his investigation of projective planes, M. Hall [2, Theorem 6.2]* proved the following theorem: a division ring D in
More information1 Homework 1. [p 0 q i+j +... + p i 1 q j+1 ] + [p i q j ] + [p i+1 q j 1 +... + p i+j q 0 ]
1 Homework 1 (1) Prove the ideal (3,x) is a maximal ideal in Z[x]. SOLUTION: Suppose we expand this ideal by including another generator polynomial, P / (3, x). Write P = n + x Q with n an integer not
More informationSMALL SKEW FIELDS CÉDRIC MILLIET
SMALL SKEW FIELDS CÉDRIC MILLIET Abstract A division ring of positive characteristic with countably many pure types is a field Wedderburn showed in 1905 that finite fields are commutative As for infinite
More informationMATH 304 Linear Algebra Lecture 9: Subspaces of vector spaces (continued). Span. Spanning set.
MATH 304 Linear Algebra Lecture 9: Subspaces of vector spaces (continued). Span. Spanning set. Vector space A vector space is a set V equipped with two operations, addition V V (x,y) x + y V and scalar
More informationON SOME CLASSES OF REGULAR ORDER SEMIGROUPS
Commun. Korean Math. Soc. 23 (2008), No. 1, pp. 29 40 ON SOME CLASSES OF REGULAR ORDER SEMIGROUPS Zhenlin Gao and Guijie Zhang Reprinted from the Communications of the Korean Mathematical Society Vol.
More informationMATH 304 Linear Algebra Lecture 20: Inner product spaces. Orthogonal sets.
MATH 304 Linear Algebra Lecture 20: Inner product spaces. Orthogonal sets. Norm The notion of norm generalizes the notion of length of a vector in R n. Definition. Let V be a vector space. A function α
More information9. Quotient Groups Given a group G and a subgroup H, under what circumstances can we find a homomorphism φ: G G ', such that H is the kernel of φ?
9. Quotient Groups Given a group G and a subgroup H, under what circumstances can we find a homomorphism φ: G G ', such that H is the kernel of φ? Clearly a necessary condition is that H is normal in G.
More informationPoint Set Topology. A. Topological Spaces and Continuous Maps
Point Set Topology A. Topological Spaces and Continuous Maps Definition 1.1 A topology on a set X is a collection T of subsets of X satisfying the following axioms: T 1.,X T. T2. {O α α I} T = α IO α T.
More informationRow Ideals and Fibers of Morphisms
Michigan Math. J. 57 (2008) Row Ideals and Fibers of Morphisms David Eisenbud & Bernd Ulrich Affectionately dedicated to Mel Hochster, who has been an inspiration to us for many years, on the occasion
More informationChapter 7. Permutation Groups
Chapter 7 Permutation Groups () We started the study of groups by considering planar isometries In the previous chapter, we learnt that finite groups of planar isometries can only be cyclic or dihedral
More informationHow To Find Out How To Build An Elliptic Curve Over A Number Field
Numbers Volume 2015, Article ID 501629, 4 pages http://dx.doi.org/10.1155/2015/501629 Research Article On the Rank of Elliptic Curves in Elementary Cubic Extensions Rintaro Kozuma College of International
More informationMatrix Representations of Linear Transformations and Changes of Coordinates
Matrix Representations of Linear Transformations and Changes of Coordinates 01 Subspaces and Bases 011 Definitions A subspace V of R n is a subset of R n that contains the zero element and is closed under
More informationMATRIX ALGEBRA AND SYSTEMS OF EQUATIONS
MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS Systems of Equations and Matrices Representation of a linear system The general system of m equations in n unknowns can be written a x + a 2 x 2 + + a n x n b a
More informationIRREDUCIBLE OPERATOR SEMIGROUPS SUCH THAT AB AND BA ARE PROPORTIONAL. 1. Introduction
IRREDUCIBLE OPERATOR SEMIGROUPS SUCH THAT AB AND BA ARE PROPORTIONAL R. DRNOVŠEK, T. KOŠIR Dedicated to Prof. Heydar Radjavi on the occasion of his seventieth birthday. Abstract. Let S be an irreducible
More informationABSTRACT ALGEBRA: A STUDY GUIDE FOR BEGINNERS
ABSTRACT ALGEBRA: A STUDY GUIDE FOR BEGINNERS John A. Beachy Northern Illinois University 2014 ii J.A.Beachy This is a supplement to Abstract Algebra, Third Edition by John A. Beachy and William D. Blair
More informationMATH 101A: ALGEBRA I PART B: RINGS AND MODULES
MATH 101A: ALGEBRA I PART B: RINGS AND MODULES In the unit on rings, I explained category theory and general rings at the same time. Then I talked mostly about commutative rings. In the unit on modules,
More information16.3 Fredholm Operators
Lectures 16 and 17 16.3 Fredholm Operators A nice way to think about compact operators is to show that set of compact operators is the closure of the set of finite rank operator in operator norm. In this
More informationIntroduction to Finite Fields (cont.)
Chapter 6 Introduction to Finite Fields (cont.) 6.1 Recall Theorem. Z m is a field m is a prime number. Theorem (Subfield Isomorphic to Z p ). Every finite field has the order of a power of a prime number
More informationInner Product Spaces and Orthogonality
Inner Product Spaces and Orthogonality week 3-4 Fall 2006 Dot product of R n The inner product or dot product of R n is a function, defined by u, v a b + a 2 b 2 + + a n b n for u a, a 2,, a n T, v b,
More informationA NOTE ON TRIVIAL FIBRATIONS
A NOTE ON TRIVIAL FIBRATIONS Petar Pavešić Fakulteta za Matematiko in Fiziko, Univerza v Ljubljani, Jadranska 19, 1111 Ljubljana, Slovenija petar.pavesic@fmf.uni-lj.si Abstract We study the conditions
More informationGeometric Transformations
Geometric Transformations Definitions Def: f is a mapping (function) of a set A into a set B if for every element a of A there exists a unique element b of B that is paired with a; this pairing is denoted
More informationSets of Fibre Homotopy Classes and Twisted Order Parameter Spaces
Communications in Mathematical Physics Manuscript-Nr. (will be inserted by hand later) Sets of Fibre Homotopy Classes and Twisted Order Parameter Spaces Stefan Bechtluft-Sachs, Marco Hien Naturwissenschaftliche
More informationModule MA3411: Abstract Algebra Galois Theory Appendix Michaelmas Term 2013
Module MA3411: Abstract Algebra Galois Theory Appendix Michaelmas Term 2013 D. R. Wilkins Copyright c David R. Wilkins 1997 2013 Contents A Cyclotomic Polynomials 79 A.1 Minimum Polynomials of Roots of
More information1 VECTOR SPACES AND SUBSPACES
1 VECTOR SPACES AND SUBSPACES What is a vector? Many are familiar with the concept of a vector as: Something which has magnitude and direction. an ordered pair or triple. a description for quantities such
More informationComputing the Symmetry Groups of the Platonic Solids With the Help of Maple
Computing the Symmetry Groups of the Platonic Solids With the Help of Maple Patrick J. Morandi Department of Mathematical Sciences New Mexico State University Las Cruces NM 88003 USA pmorandi@nmsu.edu
More informationGeneric Polynomials of Degree Three
Generic Polynomials of Degree Three Benjamin C. Wallace April 2012 1 Introduction In the nineteenth century, the mathematician Évariste Galois discovered an elegant solution to the fundamental problem
More informationNOTES ON LINEAR TRANSFORMATIONS
NOTES ON LINEAR TRANSFORMATIONS Definition 1. Let V and W be vector spaces. A function T : V W is a linear transformation from V to W if the following two properties hold. i T v + v = T v + T v for all
More informationCopy in your notebook: Add an example of each term with the symbols used in algebra 2 if there are any.
Algebra 2 - Chapter Prerequisites Vocabulary Copy in your notebook: Add an example of each term with the symbols used in algebra 2 if there are any. P1 p. 1 1. counting(natural) numbers - {1,2,3,4,...}
More informationCLUSTER ALGEBRAS AND CATEGORIFICATION TALKS: QUIVERS AND AUSLANDER-REITEN THEORY
CLUSTER ALGEBRAS AND CATEGORIFICATION TALKS: QUIVERS AND AUSLANDER-REITEN THEORY ANDREW T. CARROLL Notes for this talk come primarily from two sources: M. Barot, ICTP Notes Representations of Quivers,
More informationInner products on R n, and more
Inner products on R n, and more Peyam Ryan Tabrizian Friday, April 12th, 2013 1 Introduction You might be wondering: Are there inner products on R n that are not the usual dot product x y = x 1 y 1 + +
More information3 1. Note that all cubes solve it; therefore, there are no more
Math 13 Problem set 5 Artin 11.4.7 Factor the following polynomials into irreducible factors in Q[x]: (a) x 3 3x (b) x 3 3x + (c) x 9 6x 6 + 9x 3 3 Solution: The first two polynomials are cubics, so if
More informationA numerable cover of a topological space X is one which possesses a partition of unity.
Chapter 1 I. Fibre Bundles 1.1 Definitions Definition 1.1.1 Let X be a topological space and let {U j } j J be an open cover of X. A partition of unity relative to the cover {U j } j J consists of a set
More information3. Let A and B be two n n orthogonal matrices. Then prove that AB and BA are both orthogonal matrices. Prove a similar result for unitary matrices.
Exercise 1 1. Let A be an n n orthogonal matrix. Then prove that (a) the rows of A form an orthonormal basis of R n. (b) the columns of A form an orthonormal basis of R n. (c) for any two vectors x,y R
More information