DOCSLIB.ORG

A Simple Manifold-Based Construction of Surfaces of Arbitrary Smoothness

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
A Simple Manifold-Based Construction of Surfaces of Arbitrary Smoothness A Simple Manifold-Based Construction of Surfaces of Arbitrary Smoothness Lexing Ying, Denis Zorin New York University Abstract surface fitting. Localized influence of control points is impor- tant both for efficiency and intuitive surface control. We present a smooth surface construction based on the manifold • Good visual quality. Many surfaces constructed to precise math- approach of Grimm and Hughes. We demonstrate how this ap- ematical specifications often suffer from inferior surface qual- proach can relatively easily produce a number of desirable prop- ity. We demonstrate how good visual surface quality can be erties which are hard to achieve simultaneously with polynomial ∞ achieved simultaneously with many useful mathematical prop- patches, subdivision or variational surfaces. Our surfaces are C - erties. continuous with explicit nonsingular C∞ parameterizations, high- order flexible at control vertices, depend linearly on control points, Apart from making this combination of desirable qualities pos- have fixed-size local support for basis functions, and have good vi- sible, manifold representations are useful for a number of reasons. sual quality. For example, this is a natural setting for solving equations on sur- faces (e.g. reaction-diffusion or fluid flow [Stam 2003]) as the CR Categories: I.3.5 Computational Geometry and Object Mod- chart overlap simplifies maintaining smoothness of solutions across eling; Curve, surface, solid, and object representations boundaries. For manifolds it is easier to apply algorithms designed Keywords: Geometric modeling, manifolds. for parametric patches which treat the surface as a function f(u, v) to surfaces of arbitrary topology without handling special cases for inter-patch boundaries needed for patch-based representations. If 1 Introduction one needs to define a hierarchical basis on a manifold surface, one can simply define it on the plane and then use the chart parametriza- Much of the work on smooth surface representations, excluding tion to transfer it to the surface. Such bases can be used in many variational surfaces, is based on the paradigm of stitching poly- contexts requiring approximation: fitting, trimming, boolean oper- nomial patches together. While subdivision surfaces are generally ations etc. defined as limits of recursive refinement algorithms, the surfaces Our work was initially motivated by the needs of a specific ap- produced by most popular schemes can still be interpreted as infi- plication in scientific computing: boundary integral equations on nite collections of stitched spline patches. surfaces, which, in graphics literature have appeared in [James and In this paper we take a different, often neglected approach based Pai 1999]. Our application required high-order smooth nonsingu- on the manifold construction of [Grimm and Hughes 1995]. We lar parametrization to ensure fast convergence of quadrature rules demonstrate how this approach can produce with relative ease a on surfaces, i.e. for the parametrization to have good mathematical number of desirable properties which are hard to achieve simultane- quality; at the same time, it was essential to be able to model objects ously with polynomial patches, subdivision or variational surfaces. of arbitrary shape and obtain good visual quality without additional Specifically, our surfaces have the following properties: processing. 2 • Any prescribed degree of smoothness including C∞ with ex- We have observed that even all existing flexible C construc- plicit nonsingular parameterizations of the same smoothness. It tions are quite complex, and while higher-order constructions exist, is widely recognized that C2-continuity is important for visual despite having nice mathematical properties, few were ever fully quality, as it insures smooth normal variation. Higher degrees implemented and visual surface quality was typically inferior to of smoothness are useful for numerical purposes: for example, lower-order schemes. Subdivision surfaces are a notable exception: for C3-continuous surfaces variation of curvature functionals they were not constructed to satisfy a specific set of requirements. are well-defined everywhere, Ck-continuity makes it possible Rather, it was observed that the subdivision algorithms for splines to use high-order quadratures to ensure rapid convergence (the- generalize well to arbitrary control meshes, and the visual quality of oretically at super-algebraic rates for C∞-surfaces). Explicit the surface is adequate in an intuitive sense, except for high-valence vertices. Analysis of properties came later and is quite complex. closed-form parameterizations are always preferable for a vari- 1 ety of tasks, from texturing to surface-surface intersections. Even obtaining a C nonsingular parametrization is nontrivial and requires inversion of the characteristic map [Stam 1998]. • The surfaces are at least 3-flexible. i.e. can have arbitrary pre- In our approach, we relax the requirement of representing sur- scribed derivatives of order up to three at control vertices. This faces using polynomial patches to simplify the construction needed property ensures that a surface does not have artificial flat spots. to achieve good mathematical quality, and we ensure that our sur- • Linear dependence on control points, fixed-size local support faces closely approximate the shape of subdivision surfaces to for basis functions. Linear dependence on control points con- achieve acceptable visual quality for a similar range of vertex va- siderably simplifies formulation of a number of algorithms, e.g. lences. We believe that due to the properties enumerated above, mani- fold representations provide the most convenient basis for “black- box” surface approximation software: the user provides an input control mesh, and the surface and its parametric derivatives of any order can be evaluated at any point. While the black-box approach is not the most efficient, it is the most convenient and reliable one for applications requiring a large variety of algorithms to operate on surfaces. 1 ∞ Acknowledgments. We would like to thank Elif Tosun for her the images ϕi(Ci) cover all of M . M is a C manifold if the −1 help with the project and the anonymous reviewers for many useful transition maps from chart to chart tji = ϕj ◦ ϕi defined for pairs ∞ comments. This research was supported in part by NSF awards of chart for which ϕi(Ci) and ϕj (Cj ) intersect, are C . In our DMS-9980069, CCR-0093390, and CCR-9988528, Sloan Foun- construction, we use the control mesh as the domain M 2. dation Fellowship, IBM University Partnership Award and NYU Another important idea that we use is the partition of unity. A Dean’s Dissertation Fellowship. set of functions wi each defined on Ci, and having compact sup- −1 port, is called a partition of unity, if i wi ◦ ϕi =1, where the summation is over all charts. 2 Previous work Overview of the construction. The general approach is close ∞ We are not aware of any C constructions for surfaces with general to the one in [Grimm and Hughes 1995]. We construct functions l 3 control meshes. fi : Ci → R , defining the geometry locally on each chart; then, The work on computational representations of surfaces based on we use a partition of unity to define the global geometry. On M, l −1 manifolds is relatively limited. The idea was introduced in [Grimm the complete surface is defined by i(wifi ) ◦ ϕi . However, in and Hughes 1995]. More recently, [Navau and Garcia 2000] have practice it is evaluated on individual charts Ci via proposed a Ck construction based only on polynomials. Parameter- l ization techniques using the manifolds can also be found in [Grimm fi(x)= wj (tji(x))fj (tji(x)) (1) 2002] and [Grimm and Hughes 2003]. j:ϕi(x)∈ϕj (Cj ) Extensive literature exists on spline-based constructions of different types; Ck constructions include S-patches [Loop and Note the complexity of evaluation of this expression is determined DeRose 1989], DMS splines [Seidel 1994], freeform splines by three factors: complexity of transition maps tij , weights wj l [Prautzsch 1997] and TURBS [Reif 1998]. DMS splines were de- and geometry functions fj . In our case, the transition maps can α veloped to the greatest extent; as a large number of knots and con- be expressed in complex form as z (up to a rotation), the weights ∞ trol points need to be introduced for each triangle, an additional are piecewise exponential and C , and the geometry functions are algorithm is needed to position these points if only an initial mesh polynomials of degrees proportional to the valence of vertices cor- is given. TURBS are based on singular parameterizations; for both responding to the charts. ∞ free-form splines and TURBS additional degrees need to be set, Another important observation is that every fi(x) is C if all ∞ which can be done using fairing functionals and precomputed ma- components are C . Next, we discuss each component separately. trices, similar to the technique that we use. There are numerous C2 constructions, e.g. [Gregory and Hahn 1989], [Wang 1992], [Peters Charts and transition maps. As a basis for our construction, 1996], [Hermann 1996], [Bohl and Reif 1997], and most recently we use the conformal atlas for meshes. Conformal atlas has al- [Peters 2002]. There is an even larger number of C1-constructions; 2 ready been used in several graphics applications, most recently in excluding subdivision surfaces, which are C away from isolated [Gu and Yau 2003]. While many variations can be found in the points, these constructions rarely yield surfaces of acceptable qual- literature (e.g. [Duchamp et al. 1997] in the context of parametriza- ity. In all cases, the required polynomial degree and number of tion), a complete description of the specific structure is not eas- additional patch control points to be set rapidly grows with smooth- ily available, and we present it here. We define charts per vertex. ness. Each chart domain is a curved star shape Di, shown in Figure 1. Unfortunately, in most cases it is impossible to compare the vi- The overlap region between the images of two charts in the con- sual quality of resulting surfaces to our construction.
Load more

Recommended publications
  • Chapter 11. Three Dimensional Analytic Geometry and Vectors
    Chapter 11. Three dimensional analytic geometry and vectors. Section 11.5 Quadric surfaces. Curves in R2 : x2 y2 ellipse + =1 a2 b2 x2 y2 hyperbola − =1 a2 b2 parabola y = ax2 or x = by2 A quadric surface is the graph of a second degree equation in three variables. The most general such equation is Ax2 + By2 + Cz2 + Dxy + Exz + F yz + Gx + Hy + Iz + J =0, where A, B, C, ..., J are constants. By translation and rotation the equation can be brought into one of two standard forms Ax2 + By2 + Cz2 + J =0 or Ax2 + By2 + Iz =0 In order to sketch the graph of a quadric surface, it is useful to determine the curves of intersection of the surface with planes parallel to the coordinate planes. These curves are called traces of the surface. Ellipsoids The quadric surface with equation x2 y2 z2 + + =1 a2 b2 c2 is called an ellipsoid because all of its traces are ellipses. 2 1 x y 3 2 1 z ±1 ±2 ±3 ±1 ±2 The six intercepts of the ellipsoid are (±a, 0, 0), (0, ±b, 0), and (0, 0, ±c) and the ellipsoid lies in the box |x| ≤ a, |y| ≤ b, |z| ≤ c Since the ellipsoid involves only even powers of x, y, and z, the ellipsoid is symmetric with respect to each coordinate plane. Example 1. Find the traces of the surface 4x2 +9y2 + 36z2 = 36 1 in the planes x = k, y = k, and z = k. Identify the surface and sketch it. Hyperboloids Hyperboloid of one sheet. The quadric surface with equations x2 y2 z2 1.
    [Show full text]
  • An Introduction to Topology the Classification Theorem for Surfaces by E
    An Introduction to Topology An Introduction to Topology The Classification theorem for Surfaces By E. C. Zeeman Introduction. The classification theorem is a beautiful example of geometric topology. Although it was discovered in the last century*, yet it manages to convey the spirit of present day research. The proof that we give here is elementary, and its is hoped more intuitive than that found in most textbooks, but in none the less rigorous. It is designed for readers who have never done any topology before. It is the sort of mathematics that could be taught in schools both to foster geometric intuition, and to counteract the present day alarming tendency to drop geometry. It is profound, and yet preserves a sense of fun. In Appendix 1 we explain how a deeper result can be proved if one has available the more sophisticated tools of analytic topology and algebraic topology. Examples. Before starting the theorem let us look at a few examples of surfaces. In any branch of mathematics it is always a good thing to start with examples, because they are the source of our intuition. All the following pictures are of surfaces in 3-dimensions. In example 1 by the word “sphere” we mean just the surface of the sphere, and not the inside. In fact in all the examples we mean just the surface and not the solid inside. 1. Sphere. 2. Torus (or inner tube). 3. Knotted torus. 4. Sphere with knotted torus bored through it. * Zeeman wrote this article in the mid-twentieth century. 1 An Introduction to Topology 5.
    [Show full text]
  • Section 2.6 Cylindrical and Spherical Coordinates
    Section 2.6 Cylindrical and Spherical Coordinates A) Review on the Polar Coordinates The polar coordinate system consists of the origin O,the rotating ray or half line from O with unit tick. A point P in the plane can be uniquely described by its distance to the origin r = dist (P, O) and the angle µ, 0 µ < 2¼ : · Y P(x,y) r θ O X We call (r, µ) the polar coordinate of P. Suppose that P has Cartesian (stan- dard rectangular) coordinate (x, y) .Then the relation between two coordinate systems is displayed through the following conversion formula: x = r cos µ Polar Coord. to Cartesian Coord.: y = r sin µ ½ r = x2 + y2 Cartesian Coord. to Polar Coord.: y tan µ = ( p x 0 µ < ¼ if y > 0, 2¼ µ < ¼ if y 0. · · · Note that function tan µ has period ¼, and the principal value for inverse tangent function is ¼ y ¼ < arctan < . ¡ 2 x 2 1 So the angle should be determined by y arctan , if x > 0 xy 8 arctan + ¼, if x < 0 µ = > ¼ x > > , if x = 0, y > 0 < 2 ¼ , if x = 0, y < 0 > ¡ 2 > > Example 6.1. Fin:>d (a) Cartesian Coord. of P whose Polar Coord. is ¼ 2, , and (b) Polar Coord. of Q whose Cartesian Coord. is ( 1, 1) . 3 ¡ ¡ ³ So´l. (a) ¼ x = 2 cos = 1, 3 ¼ y = 2 sin = p3. 3 (b) r = p1 + 1 = p2 1 ¼ ¼ 5¼ tan µ = ¡ = 1 = µ = or µ = + ¼ = . 1 ) 4 4 4 ¡ 5¼ Since ( 1, 1) is in the third quadrant, we choose µ = so ¡ ¡ 4 5¼ p2, is Polar Coord.
    [Show full text]
  • 21. Orthonormal Bases
    21. Orthonormal Bases The canonical/standard basis 011 001 001 B C B C B C B0C B1C B0C e1 = B.C ; e2 = B.C ; : : : ; en = B.C B.C B.C B.C @.A @.A @.A 0 0 1 has many useful properties. • Each of the standard basis vectors has unit length: q p T jjeijj = ei ei = ei ei = 1: • The standard basis vectors are orthogonal (in other words, at right angles or perpendicular). T ei ej = ei ej = 0 when i 6= j This is summarized by ( 1 i = j eT e = δ = ; i j ij 0 i 6= j where δij is the Kronecker delta. Notice that the Kronecker delta gives the entries of the identity matrix. Given column vectors v and w, we have seen that the dot product v w is the same as the matrix multiplication vT w. This is the inner product on n T R . We can also form the outer product vw , which gives a square matrix. 1 The outer product on the standard basis vectors is interesting. Set T Π1 = e1e1 011 B C B0C = B.C 1 0 ::: 0 B.C @.A 0 01 0 ::: 01 B C B0 0 ::: 0C = B. .C B. .C @. .A 0 0 ::: 0 . T Πn = enen 001 B C B0C = B.C 0 0 ::: 1 B.C @.A 1 00 0 ::: 01 B C B0 0 ::: 0C = B. .C B. .C @. .A 0 0 ::: 1 In short, Πi is the diagonal square matrix with a 1 in the ith diagonal position and zeros everywhere else.
    [Show full text]
  • Area, Volume and Surface Area
    The Improving Mathematics Education in Schools (TIMES) Project MEASUREMENT AND GEOMETRY Module 11 AREA, VOLUME AND SURFACE AREA A guide for teachers - Years 8–10 June 2011 YEARS 810 Area, Volume and Surface Area (Measurement and Geometry: Module 11) For teachers of Primary and Secondary Mathematics 510 Cover design, Layout design and Typesetting by Claire Ho The Improving Mathematics Education in Schools (TIMES) Project 2009‑2011 was funded by the Australian Government Department of Education, Employment and Workplace Relations. The views expressed here are those of the author and do not necessarily represent the views of the Australian Government Department of Education, Employment and Workplace Relations. © The University of Melbourne on behalf of the international Centre of Excellence for Education in Mathematics (ICE‑EM), the education division of the Australian Mathematical Sciences Institute (AMSI), 2010 (except where otherwise indicated). This work is licensed under the Creative Commons Attribution‑NonCommercial‑NoDerivs 3.0 Unported License. http://creativecommons.org/licenses/by‑nc‑nd/3.0/ The Improving Mathematics Education in Schools (TIMES) Project MEASUREMENT AND GEOMETRY Module 11 AREA, VOLUME AND SURFACE AREA A guide for teachers - Years 8–10 June 2011 Peter Brown Michael Evans David Hunt Janine McIntosh Bill Pender Jacqui Ramagge YEARS 810 {4} A guide for teachers AREA, VOLUME AND SURFACE AREA ASSUMED KNOWLEDGE • Knowledge of the areas of rectangles, triangles, circles and composite figures. • The definitions of a parallelogram and a rhombus. • Familiarity with the basic properties of parallel lines. • Familiarity with the volume of a rectangular prism. • Basic knowledge of congruence and similarity. • Since some formulas will be involved, the students will need some experience with substitution and also with the distributive law.
    [Show full text]
  • Multivector Differentiation and Linear Algebra 0.5Cm 17Th Santaló
    Multivector differentiation and Linear Algebra 17th Santalo´ Summer School 2016, Santander Joan Lasenby Signal Processing Group, Engineering Department, Cambridge, UK and Trinity College Cambridge [email protected], www-sigproc.eng.cam.ac.uk/ s jl 23 August 2016 1 / 78 Examples of differentiation wrt multivectors. Linear Algebra: matrices and tensors as linear functions mapping between elements of the algebra. Functional Differentiation: very briefly... Summary Overview The Multivector Derivative. 2 / 78 Linear Algebra: matrices and tensors as linear functions mapping between elements of the algebra. Functional Differentiation: very briefly... Summary Overview The Multivector Derivative. Examples of differentiation wrt multivectors. 3 / 78 Functional Differentiation: very briefly... Summary Overview The Multivector Derivative. Examples of differentiation wrt multivectors. Linear Algebra: matrices and tensors as linear functions mapping between elements of the algebra. 4 / 78 Summary Overview The Multivector Derivative. Examples of differentiation wrt multivectors. Linear Algebra: matrices and tensors as linear functions mapping between elements of the algebra. Functional Differentiation: very briefly... 5 / 78 Overview The Multivector Derivative. Examples of differentiation wrt multivectors. Linear Algebra: matrices and tensors as linear functions mapping between elements of the algebra. Functional Differentiation: very briefly... Summary 6 / 78 We now want to generalise this idea to enable us to find the derivative of F(X), in the A ‘direction’ – where X is a general mixed grade multivector (so F(X) is a general multivector valued function of X). Let us use ∗ to denote taking the scalar part, ie P ∗ Q ≡ hPQi. Then, provided A has same grades as X, it makes sense to define: F(X + tA) − F(X) A ∗ ¶XF(X) = lim t!0 t The Multivector Derivative Recall our definition of the directional derivative in the a direction F(x + ea) − F(x) a·r F(x) = lim e!0 e 7 / 78 Let us use ∗ to denote taking the scalar part, ie P ∗ Q ≡ hPQi.
    [Show full text]
  • Riemann Surfaces
    RIEMANN SURFACES AARON LANDESMAN CONTENTS 1. Introduction 2 2. Maps of Riemann Surfaces 4 2.1. Defining the maps 4 2.2. The multiplicity of a map 4 2.3. Ramification Loci of maps 6 2.4. Applications 6 3. Properness 9 3.1. Definition of properness 9 3.2. Basic properties of proper morphisms 9 3.3. Constancy of degree of a map 10 4. Examples of Proper Maps of Riemann Surfaces 13 5. Riemann-Hurwitz 15 5.1. Statement of Riemann-Hurwitz 15 5.2. Applications 15 6. Automorphisms of Riemann Surfaces of genus ≥ 2 18 6.1. Statement of the bound 18 6.2. Proving the bound 18 6.3. We rule out g(Y) > 1 20 6.4. We rule out g(Y) = 1 20 6.5. We rule out g(Y) = 0, n ≥ 5 20 6.6. We rule out g(Y) = 0, n = 4 20 6.7. We rule out g(C0) = 0, n = 3 20 6.8. 21 7. Automorphisms in low genus 0 and 1 22 7.1. Genus 0 22 7.2. Genus 1 22 7.3. Example in Genus 3 23 Appendix A. Proof of Riemann Hurwitz 25 Appendix B. Quotients of Riemann surfaces by automorphisms 29 References 31 1 2 AARON LANDESMAN 1. INTRODUCTION In this course, we’ll discuss the theory of Riemann surfaces. Rie- mann surfaces are a beautiful breeding ground for ideas from many areas of math. In this way they connect seemingly disjoint fields, and also allow one to use tools from different areas of math to study them.
    [Show full text]
  • Visual Cortex: Looking Into a Klein Bottle Nicholas V
    776 Dispatch Visual cortex: Looking into a Klein bottle Nicholas V. Swindale Arguments based on mathematical topology may help work which suggested that many properties of visual cortex in understanding the organization of topographic maps organization might be a consequence of mapping a five- in the cerebral cortex. dimensional stimulus space onto a two-dimensional surface as continuously as possible. Recent experimental results, Address: Department of Ophthalmology, University of British Columbia, 2550 Willow Street, Vancouver, V5Z 3N9, British which I shall discuss here, add to this complexity because Columbia, Canada. they show that a stimulus attribute not considered in the theoretical studies — direction of motion — is also syst- Current Biology 1996, Vol 6 No 7:776–779 ematically mapped on the surface of the cortex. This adds © Current Biology Ltd ISSN 0960-9822 to the evidence that continuity is an important, though not overriding, organizational principle in the cortex. I shall The English neurologist Hughlings Jackson inferred the also discuss a demonstration that certain receptive-field presence of a topographic map of the body musculature in properties, which may be indirectly related to direction the cerebral cortex more than a century ago, from his selectivity, can be represented as positions in a non- observations of the orderly progressions of seizure activity Euclidian space with a topology known to mathematicians across the body during epilepsy. Topographic maps of one as a Klein bottle. First, however, it is appropriate to cons- kind or another are now known to be a ubiquitous feature ider the experimental data. of cortical organization, at least in the primary sensory and motor areas.
    [Show full text]
  • Analytic Geometry
    STATISTIC ANALYTIC GEOMETRY SESSION 3 STATISTIC SESSION 3 Session 3 Analytic Geometry Geometry is all about shapes and their properties. If you like playing with objects, or like drawing, then geometry is for you! Geometry can be divided into: Plane Geometry is about flat shapes like lines, circles and triangles ... shapes that can be drawn on a piece of paper Solid Geometry is about three dimensional objects like cubes, prisms, cylinders and spheres Point, Line, Plane and Solid A Point has no dimensions, only position A Line is one-dimensional A Plane is two dimensional (2D) A Solid is three-dimensional (3D) Plane Geometry Plane Geometry is all about shapes on a flat surface (like on an endless piece of paper). 2D Shapes Activity: Sorting Shapes Triangles Right Angled Triangles Interactive Triangles Quadrilaterals (Rhombus, Parallelogram, etc) Rectangle, Rhombus, Square, Parallelogram, Trapezoid and Kite Interactive Quadrilaterals Shapes Freeplay Perimeter Area Area of Plane Shapes Area Calculation Tool Area of Polygon by Drawing Activity: Garden Area General Drawing Tool Polygons A Polygon is a 2-dimensional shape made of straight lines. Triangles and Rectangles are polygons. Here are some more: Pentagon Pentagra m Hexagon Properties of Regular Polygons Diagonals of Polygons Interactive Polygons The Circle Circle Pi Circle Sector and Segment Circle Area by Sectors Annulus Activity: Dropping a Coin onto a Grid Circle Theorems (Advanced Topic) Symbols There are many special symbols used in Geometry. Here is a short reference for you:
    [Show full text]
  • Motion on a Torus Kirk T
    Motion on a Torus Kirk T. McDonald Joseph Henry Laboratories, Princeton University, Princeton, NJ 08544 (October 21, 2000) 1 Problem Find the frequency of small oscillations about uniform circular motion of a point mass that is constrained to move on the surface of a torus (donut) of major radius a and minor radius b whose axis is vertical. 2 Solution 2.1 Attempt at a Quick Solution Circular orbits are possible in both horizontal and vertical planes, but in the presence of gravity, motion in vertical orbits will be at a nonuniform velocity. Hence, we restrict our attention to orbits in horizontal planes. We use a cylindrical coordinate system (r; θ; z), with the origin at the center of the torus and the z axis vertically upwards, as shown below. 1 A point on the surface of the torus can also be described by two angular coordinates, one of which is the azimuth θ in the cylindrical coordinate system. The other angle we define as Á measured with respect to the plane z = 0 in a vertical plane that contains the point as well as the axis, as also shown in the figure above. We seek motion at constant angular velocity Ω about the z axis, which suggests that we consider a frame that rotates with this angular velocity. In this frame, the particle (whose mass we take to be unity) is at rest at angle Á0, and is subject to the downward force of 2 gravity g and the outward centrifugal force Ω (a + b cos Á0), as shown in the figure below.
    [Show full text]
  • 28. Exterior Powers
    28. Exterior powers 28.1 Desiderata 28.2 Definitions, uniqueness, existence 28.3 Some elementary facts 28.4 Exterior powers Vif of maps 28.5 Exterior powers of free modules 28.6 Determinants revisited 28.7 Minors of matrices 28.8 Uniqueness in the structure theorem 28.9 Cartan's lemma 28.10 Cayley-Hamilton Theorem 28.11 Worked examples While many of the arguments here have analogues for tensor products, it is worthwhile to repeat these arguments with the relevant variations, both for practice, and to be sensitive to the differences. 1. Desiderata Again, we review missing items in our development of linear algebra. We are missing a development of determinants of matrices whose entries may be in commutative rings, rather than fields. We would like an intrinsic definition of determinants of endomorphisms, rather than one that depends upon a choice of coordinates, even if we eventually prove that the determinant is independent of the coordinates. We anticipate that Artin's axiomatization of determinants of matrices should be mirrored in much of what we do here. We want a direct and natural proof of the Cayley-Hamilton theorem. Linear algebra over fields is insufficient, since the introduction of the indeterminate x in the definition of the characteristic polynomial takes us outside the class of vector spaces over fields. We want to give a conceptual proof for the uniqueness part of the structure theorem for finitely-generated modules over principal ideal domains. Multi-linear algebra over fields is surely insufficient for this. 417 418 Exterior powers 2. Definitions, uniqueness, existence Let R be a commutative ring with 1.
    [Show full text]
  • High Energy and Smoothness Asymptotic Expansion of the Scattering Amplitude
    HIGH ENERGY AND SMOOTHNESS ASYMPTOTIC EXPANSION OF THE SCATTERING AMPLITUDE D.Yafaev Department of Mathematics, University Rennes-1, Campus Beaulieu, 35042, Rennes, France (e-mail : [email protected]) Abstract We find an explicit expression for the kernel of the scattering matrix for the Schr¨odinger operator containing at high energies all terms of power order. It turns out that the same expression gives a complete description of the diagonal singular- ities of the kernel in the angular variables. The formula obtained is in some sense universal since it applies both to short- and long-range electric as well as magnetic potentials. 1. INTRODUCTION d−1 d−1 1. High energy asymptotics of the scattering matrix S(λ): L2(S ) → L2(S ) for the d Schr¨odinger operator H = −∆+V in the space H = L2(R ), d ≥ 2, with a real short-range potential (bounded and satisfying the condition V (x) = O(|x|−ρ), ρ > 1, as |x| → ∞) is given by the Born approximation. To describe it, let us introduce the operator Γ0(λ), −1/2 (d−2)/2 ˆ 1/2 d−1 (Γ0(λ)f)(ω) = 2 k f(kω), k = λ ∈ R+ = (0, ∞), ω ∈ S , (1.1) of the restriction (up to the numerical factor) of the Fourier transform fˆ of a function f to −1 −1 the sphere of radius k. Set R0(z) = (−∆ − z) , R(z) = (H − z) . By the Sobolev trace −r d−1 theorem and the limiting absorption principle the operators Γ0(λ)hxi : H → L2(S ) and hxi−rR(λ + i0)hxi−r : H → H are correctly defined as bounded operators for any r > 1/2 and their norms are estimated by λ−1/4 and λ−1/2, respectively.
    [Show full text]