Foundations of differentiable manifolds and Lie groups by Frank W. Warner

By Frank W. Warner

Foundations of Differentiable Manifolds and Lie teams offers a transparent, distinctive, and cautious improvement of the elemental proof on manifold concept and Lie teams. assurance contains differentiable manifolds, tensors and differentiable varieties, Lie teams and homogenous areas, and integration on manifolds. The booklet additionally offers an evidence of the de Rham theorem through sheaf cohomology conception and develops the neighborhood idea of elliptic operators culminating in an explanation of the Hodge theorem.

Show description

Read or Download Foundations of differentiable manifolds and Lie groups PDF

Best linear books

Lie Groups Beyond an Introduction

This ebook takes the reader from the top of introductory Lie crew idea to the edge of infinite-dimensional team representations. Merging algebra and research all through, the writer makes use of Lie-theoretic easy methods to boost a gorgeous conception having vast purposes in arithmetic and physics. The booklet in the beginning stocks insights that utilize real matrices; it later is dependent upon such structural positive factors as houses of root platforms.

Lectures on Tensor Categories and Modular Functors

This e-book supplies an exposition of the family one of the following 3 themes: monoidal tensor different types (such as a class of representations of a quantum group), third-dimensional topological quantum box conception, and 2-dimensional modular functors (which evidently come up in 2-dimensional conformal box theory).

Proper Maps of Toposes

We advance the speculation of compactness of maps among toposes, including linked notions of separatedness. This concept is outfitted round types of 'propriety' for topos maps, brought right here in a parallel type. the 1st, giving what we easily name 'proper' maps, is a comparatively susceptible as a result of Johnstone.

Extra info for Foundations of differentiable manifolds and Lie groups

Example text

Conversely, Gauss quadrature rules can be used to estimate norms of the error between the CG approximate solutions and the exact solution during the iterations. This also gives a reliable and cheap way to compute stopping criteria for the CG iterations. 1 The Lanczos Algorithm Let A be a real symmetric matrix of order n. We introduce the Lanczos algorithm as a means of computing an orthogonal basis of a Krylov subspace. 1) be the Krylov matrix of dimension n × k. The subspace that is spanned by the columns of the matrix Kk is called a Krylov subspace and denoted by Kk (A, v) or K(A, v) when no confusion is possible.

2) by VkT and using orthogonality, we have Hk = VkT AVk . Clearly, a symmetric Hessenberg matrix is tridiagonal. Therefore, we denote Hk by Jk (since this is a Jacobi matrix, the elements in the sub- and superdiagonals being strictly positive) and we have hi,j = 0, j = i + 2, . . , k. This implies that v¯k and hence the new vector v k+1 can be computed by using only the two previous vectors v k and v k−1 . This describes the Lanczos algorithm. In fact, Vk is the orthonormal matrix (that is, such that VkT Vk = I) involved in a QR factorization of the Krylov matrix Kk , and the matrix KkT AKk is similar to Jk = VkT AVk .

PROPERTIES OF TRIDIAGONAL MATRICES 29 The last components of the eigenvectors z i of Jk satisfy (k) χ1,k−1 (θi ) (zki )2 = (k) , χ1,k (θi ) that is, (zki )2 = (k) θi (k) θi (k) (k−1) − θ1 (k) − θ1 ··· θi (k) θi (k−1) − θi−1 (k) (k−1) θi − θi−1 (k) (k−1) (k) − θi (k) θi+1 − θi ··· (k) θk−1 − θi (k) (k) θk − θi . The components of the eigenvectors are also related to (the derivatives of) the (k) functions δj (λ) and dj (λ). 5 The first components of the eigenvectors of Jk are given by (z1i )2 = 1 (k) [d1 ] .

Download PDF sample

Rated 4.25 of 5 – based on 39 votes