1. Prolog Algebra / Analysis vs Geometry Relativity → Riemannian Geometry Symmetry → Lie Derivatives → Lie Group → Lie Algebra Integration → Differential forms → Homotopy, Cohomology Tensor / Gauge Fields → Fibre Bundles Topology Website:http://ckw.phys.ncku.edu.twhttp://ckw.phys.ncku.edu.tw Homework submission:class@ckw.phys.ncku.edu.tw Hamiltonian dynamics Electrodynamics Thermodynamics Statistics Fluid Dynamics Defects

2. Supplementary Y.Choquet-Bruhat et al, “Analysis, Manifolds & Physics”, rev. ed., North Holland (82) H.Flanders, “Differential Forms”, Academic Press (63) R.Aldrovandi, J.G.Pereira, “An Introduction to Geometrical Physics”, World Scientific (95) T.Frankel, “The Geometry of Physics”, 2nd ed., CUP (03) B.F.Schutz, “Geometrical Methods of Mathematical Physics”, CUP (80) Main Textbook

3. Geometrical Methods of Mathematical Physics 1.Some Basic Mathematics 2.Differentiable Manifolds And Tensors 3.Lie Derivatives And Lie Groups 4.Differential Forms 5.Applications In Physics 6.Connections For Riemannian Manifolds And Gauge Theories Bernard F. Schutz, Cambridge University Press (80)

4. 1. Some Basic Mathematics 1.1The Space R n And Its Topology 1.2 Mappings 1.3 Real Analysis 1.4 Group Theory 1.5 Linear Algebra 1.6 The Algebra Of Square Matrices See: Choquet, Chapter I.

5. Basic Algebraic Structures See Choquet, Chap 1 or Aldrovandi, Math.1. Group ( G,  ) Ring ( R, +,  ) : ( no e, x -1 ) Field ( F, +,  ) : Ring with e & x -1 except for 0. Module ( M, +,  ; R ) Algebra ( A, +,  ; R with e ) Vector space ( V, + ; F ) Prototypes: R is a field. R n is a vector space.

6. 1.1. The Space R n And Its Topology Goal: Extend multi-variable calculus (on E n ) to curved spaces without metric. –Bonus: vector calculus on E 3 in curvilinear coordinates Basic calculus concepts & tools (metric built-in): – Limit, continuity, differentiability, … – r-ball neighborhood, δ-ε formulism, … Essential concept in the absence of metric: Proximity → Topology.

7. = Set of all n-tuples of real numbers ~ Prototype of an n-D continuum Distance function (Euclidean metric): (Open) Neighborhood of radius r at x : A set S is discrete if A set S is open if Hausdorff separated: Distinct points possess disjoint neighborhoods. Real number R = complete Archimedian ordered field. Preview: Continuity of functions will be defined in terms of open sets.

8. A system U of subsets U i of a set X defines a topology on X if ( Closure under arbitrary unions. ) ( Closure under finite intersections. ) Elements U i of U are called open sets. A topological space is the minimal structure on which concepts of neighborhood, continuity, compactness, connectedness can be defined. Usual topology of R n = Topology with open balls as open sets Metric-free version: Define N r (x) in terms of open intervals.

9. Trivial topology: U = { , X } → every function on X is dis-continuous Discrete topology: U = 2 X → every function on X is continuous Exact choice of topology is usually not very important: 2 topologies are equivalent if there exists an homeomorphism (bi-continuous bijection) between them. Tools for classification of topologies: topological invariances, homology, homotopy

10. 1.2. Mappings by Map f from set X into set Y, denoted, associates each x  X uniquely with y = f (x)  Y. Domain of f = Range of f = Image of M under f = Inverse image of N under f = f  1 exists iff f is 1-1 (injective): f is onto (surjective) if f (X) = Y. f is a bijection if it is 1-1 onto.

11. by Composition Givenby The composition of f & g is the map

12. Elementary calculus version: Let f : R → R. Then f is continuous at x 0 if Open ball version: Let Then f is continuous at x 0 if Continuity i.e., Two possible interpretations in terms of open sets: 1. Every open set in Domain( f) is mapped into an open set in Range(f). 2. Every open set in Range( f) has an open inverse image.

13. Every open set in Domain( f) is mapped into an open set in Range(f)? No! Every open set in Range( f) has an open inverse image? Yes. Open M → half-closed f(M) Open N → half-closed f -1 (N)

14. Continuity at a point: f : X → Y is continuous at x if the inverse image of any open neighborhood of f (x) is open, i.e., f -1 ( N [f(x)]) is open. Continuity in a region: f is continuous on M  X if f is continuous  x  M, i.e., the inverse image of every open set in M is open. Differentiability of f : R n → R

15. by Inverse function theorem : f is invertible in some neighborhood of x 0 if ( Jacobian ) Letthen where

16. 1.3. Real Analysis is analytic at x 0 if f (x) has a Taylor series at x 0 if f is analytic over Domain( f) is square integrable on S  R n if exists. A square integrable function g can be approximated by an analytic function f s.t.

17. An operator on functions defined on R n maps functions to functions. E.g., Commutator of operators: s.t. A & B commute if E.g., Domain (AB)  C 2 but Domain ([A, B ])  C 1

18. 1.4. Group Theory A group (G,  ) is a set G with an internal operation  : G  G → G that is 1. Associative: 2. Endowed with an identity element: 3. Endowed with an inverse for each element: A group (G, +) is Abelian if all of its elements commute: ( Identity is denoted by 0 ) Examples: ( R,+) is an Abelian group. The set of all permutations of n objects form the permutation group S n. All symmetries / transformations are members of some groups.

19. (S,  ) is a subgroup of group (G,  ) if S  G. Rough definition: A Lie group is a group whose elements can be continuously parametrized. ~ continuous symmetries. E.g., The set of all even permutations is a subgroup of S n. But the set of all odd permutations is not a subgroup of S n (no e). Groups (G,  ) is homomorphic to (H,*) if  an onto map f : G → H s.t. It is an isomorphism if f is 1-1 onto. ( R +,  ) & ( R,+) are isomorphic with f = log so that

20. 1.5. Linear Algebra Ring ( R, , + ) is a field if 1.  e  R s.t. e  x = x  e = x  x  R. 2.  x -1  R s.t. x -1  x = x  x -1 = e  x  R except 0. ( R, , + ) is a ring if 1.( R, + ) is an Abelian group. 2.  is associative & distributive wrt +, i.e.,  x,y,z  R, E.g., The set of all n  n matrices is a ring under matrix multiplication & addition. E.g., R & C are fields under algebraic multiplication & addition.

21. ( V, + ; R ) is a module if 1.( V, + ) is an Abelian group. 2. R is a ring. 3. The scalar multiplication R  V→V by (a,v)   a v satisfies Module ( V, + ; F ) is a linear (vector) space if F is a field. 4. If R has an identity e, then ev = v  v  V. We’ll only use F = K = R or C. ( A, , + ; R ) is an algebra over ring R if 1. ( A, , + ) is a ring. 2. ( A, + ; R ) is a module s.t.

22. For historical reasons, the term “linear algebra” denotes the study of linear simultaneous equations, matrix algebra, & vector spaces. Mathematical justification: ( M, , + ; K ), where M is the set of all n  n matrices, is an algebra. Linear combination: { v i } is linearly independent if A basis for V is a maximal linearly independent set of vectors in V. The dimension of V is the number of elements in its basis. An n-D space V is sometimes denoted by V n. Given a basis { e i }, we have v i are called the components of v. Einstein’s notation A subspace of V is a subset of V that is also a vector space.

23. A norm on a linear space V over field K  R or C is a mapping s.t. ( Triangular inequality ) ( Positive semi-definite ) ( Linear ) n is a semi- (pseudo-) norm if only 1 & 2 hold. A normed vector space is a linear space V endowed with a norm. Examples: Euclidean norm

24. An inner product on a linear space (V, + ; K ) is a mapping s.t. or, for physicists, u & v are orthogonal  ( Sesquilinear )

25. Inner Product Spaces Inner product space  linear space endowed with an inner product. An inner product ,  induces a norm || || by Properties of an inner product space: ( Cauchy-Schwarz inequality ) ( Triangular inequality ) ( Parallelogram rule ) The parallelogram rule can be derived from the cosine rule : ( θ  angle between u & v )

26. 1.6.The Algebra of Square Matrices A linear transformation T on vector space (V, + ; K ) is a map s.t. If { e i } is a basis of V, then  Settingwe have  T j i = (j,i)-element of matrix T Writing vectors as a column matrix, we have (  = matrix multiplication )

27. In linear algebra, linear operators are associative, then  ~ i.e., linear associative operators can be represented by matrices. ~ Similarly, We’ll henceforth drop the symbol 

28. In general: Transpose: Adjoint: Unit matrix: Inverse: A is non-singular if A -1 exists. The set of all non-singular n  n matrices forms the group GL(n, K ). Determinant:

29. Cofactor: cof(A i j ) = (-) i+j  determinant of submatrix obtained by deleting the i-th row & j-th column of A. Laplace expansion: j arbitrary  See T.M.Apostol, “Linear Algebra”, Chap 5, for proof. Trace: Similarity transform of A by non-singular B:~ Det & Tr are invariant under a similarity transform:

30. Miscellaneous formulae λ is an eigenvalue of A if  v  0 s.t. ~ For an n-D space, λ satifies the secular equation: v is then called the eigenvector belonging to λ. There are always n complex eigenvalues and m eigenvectors with m  n. Eigenvalues of A & A T are the same.