|
|
| Line 1: |
Line 1: |
| {{refimprove|date=March 2012}}
| | Msvcr71.dll is an significant file which helps support Windows process different components of the program including important files. Specifically, the file is utilized to help run corresponding files in the "Virtual C Runtime Library". These files are important in accessing any settings that help the different applications plus programs inside the program. The msvcr71.dll file fulfills many significant functions; however it's not spared from getting damaged or corrupted. Once the file gets corrupted or damaged, the computer usually have a difficult time processing and reading components of the program. Nonetheless, consumers want not panic considering this problem might be solved by following many procedures. And I might show you several tricks about Msvcr71.dll.<br><br>Firstly, we should utilize your Antivirus or security tool plus run a scan on the computer. It is possible which your computer is infected with virus or malware that slows down your computer. If there is nothing found in the scanning report, it might be your RAM that cause the issue.<br><br>So, this advanced double scan is not merely among the greater, however it's additionally freeware. And as of all of this which countless respect CCleaner one of the greater registry cleaners inside the market today. I would add which I personally like Regcure for the simple reason that it has a better interface and I know for a fact it is ad-ware without charge.<br><br>Always see to it which you have installed antivirus, anti-spyware plus anti-adware programs plus have them up-to-date on a regular basis. This can help stop windows XP running slow.<br><br>Use a [http://bestregistrycleanerfix.com/system-mechanic system mechanic]. This can look your Windows registry for 3 kinds of keys that can definitely hurt PC performance. These are: duplicate, missing, plus corrupted.<br><br>Windows relies heavily on this database, storing everything from the latest emails to a Internet favorites in there. Because it's so crucial, the computer is continually adding and updating the files inside it. This is ok, however it can make the computer run slow, when your computer accidentally breaks its crucial registry files. This is a especially common problem, and really makes the computer run slower each day. What happens is that because a computer is constantly using 100's of registry files at once, it sometimes gets confused and create several of them unreadable. This then makes a computer run slow, considering Windows takes longer to read the files it needs.<br><br>Perfect Optimizer is a wise Registry Product, changes consistently and has lots of qualities. Despite its price, we will find that the update are certainly valuable. They provide a lot of help through phone, mail plus forums. We could wish To check out the free trial to check it out for oneself.<br><br>By changing the way you utilize the web you are able to have access more of your precious bandwidth. This will eventually give you a quicker surfing experience. Here is a link to 3 techniques to personalize your PC speed on the net. |
| In [[mathematics]], a '''quadratic form''' is a [[homogeneous polynomial]] of [[Degree of a polynomial|degree]] two in a number of variables. For example,
| |
| :<math>4x^2 + 2xy - 3y^2</math>
| |
| is a quadratic form in the variables ''x'' and ''y''. | |
| | |
| Quadratic forms occupy a central place in various branches of mathematics, including [[number theory]], [[linear algebra]], [[group theory]] ([[orthogonal group]]), [[differential geometry]] ([[Riemannian metric]]), [[differential topology]] ([[intersection form (4-manifold)|intersection forms]] of [[four-manifold]]s), and [[Lie theory]] (the [[Killing form]]).
| |
| | |
| == Introduction ==
| |
| Quadratic forms are homogeneous quadratic polynomials in ''n'' variables. In the cases of one, two, and three variables they are called '''unary''', '''[[binary quadratic form|binary]]''', and '''ternary''' and have the following explicit form:
| |
| | |
| :<math>q(x) = ax^2\quad \textrm{(unary)} </math>
| |
| :<math>q(x,y) = ax^2 + bxy + cy^2\quad \textrm{(binary)} </math>
| |
| :<math>q(x,y,z) = ax^2 + by^2 + cz^2 + dxy + exz + fyz \quad\textrm{(ternary)} </math>
| |
| | |
| where ''a'', ..., ''f'' are the '''coefficients'''.<ref>A tradition going back to [[Gauss]] dictates the use of manifestly even coefficients for the products of distinct variables, i.e. 2''b'' in place of ''b'' in binary forms and 2''d'', 2''e'', 2''f'' in place of ''d'', ''e'', ''f'' in ternary forms. Both conventions occur in the literature</ref> Note that [[quadratic function]]s, such as {{nowrap|''ax''<sup>2</sup> + ''bx'' + ''c''}} in the one variable case, are not quadratic forms, as they are typically not [[homogeneous polynomial|homogeneous]] (unless ''b'' and ''c'' are both 0).
| |
| | |
| The theory of quadratic forms and methods used in their study depend in a large measure on the nature of the coefficients, which may be [[real number|real]] or [[complex number|complex]] numbers, [[rational number]]s, or [[integer]]s. In [[linear algebra]], [[analytic geometry]], and in the majority of applications of quadratic forms, the coefficients are real or complex numbers. In the algebraic theory of quadratic forms, the coefficients are elements of a certain [[field (algebra)|field]]. In the arithmetic theory of quadratic forms, the coefficients belong to a fixed [[commutative ring]], frequently the integers '''Z''' or the [[p-adic integer|''p''-adic integers]] '''Z'''<sub>''p''</sub>.<ref>[[Localization of a ring#Terminology|away from 2]], i. e. if 2 is invertible in the ring, quadratic forms are equivalent to [[symmetric bilinear form]]s (by the [[polarization identities]]), but at 2 they are different concepts; this distinction is particularly important for quadratic forms over the integers.</ref> Binary quadratic forms have been extensively studied in [[number theory]], in particular, in the theory of [[quadratic field]]s, [[continued fraction]]s, and [[modular forms]]. The theory of integral quadratic forms in ''n'' variables has important applications to [[algebraic topology]].
| |
| | |
| Using [[homogeneous coordinates]], a non-zero quadratic form in ''n'' variables defines an (''n''−2)-dimensional [[Quadric (projective geometry)|quadric]] in the (''n''−1)-dimensional [[projective space]]. This is a basic construction in [[projective geometry]]. In this way one may visualize 3-dimensional real quadratic forms as [[conic sections]].
| |
| | |
| A closely related notion with geometric overtones is a '''quadratic space''', which is a pair (''V'',''q''), with ''V'' a [[vector space]] over a field ''K'', and {{nowrap|''q'': ''V'' → ''K''}} a quadratic form on ''V''. An example is given by the three-dimensional [[Euclidean space]] and the square of the [[Euclidean norm]] expressing the [[distance]] between a point with coordinates (''x'',''y'',''z'') and the origin:
| |
| | |
| : <math> q(x,y,z)=d((x,y,z),(0,0,0))^2=\|(x,y,z)\|^2=x^2+y^2+z^2. </math>
| |
| | |
| ==History==
| |
| The study of particular quadratic forms, in particular the question of whether a given integer can be the value of a quadratic form over the integers, dates back many centuries. One such case is [[Fermat's theorem on sums of two squares]], which determines when an integer may be expressed in the form {{nowrap|''x''<sup>2</sup> + ''y''<sup>2</sup>}}, where ''x'', ''y'' are integers. This problem is related to the problem of finding [[Pythagorean triple]]s, which appeared in the second millennium B.C.<ref>[http://www-groups.dcs.st-and.ac.uk/~history/HistTopics/Babylonian_Pythagoras.html Babylonian Pythagoras]</ref>
| |
| | |
| In 628, the Indian mathematician [[Brahmagupta]] wrote ''[[Brahmasphutasiddhanta]]'' which includes, among many other things, a study of equations of the form {{nowrap|1=''x''<sup>2</sup> − ''ny''<sup>2</sup> = ''c''}}. In particular he considered what is now called [[Pell's equation]], {{nowrap|1=''x''<sup>2</sup> − ''ny''<sup>2</sup> = 1}}, and found a method for its solution.<ref>[http://www-groups.dcs.st-and.ac.uk/~history/Biographies/Brahmagupta.html Brahmagupta biography]</ref> In Europe this problem was studied by [[William Brouncker, 2nd Viscount Brouncker|Brouncker]], [[Leonhard Euler|Euler]] and [[Joseph Louis Lagrange|Lagrange]].
| |
| | |
| In 1801 [[Carl Friedrich Gauss|Gauss]] published ''[[Disquisitiones Arithmeticae]],'' a major portion of which was devoted to a complete theory of [[binary quadratic form]]s over the [[integer]]s. Since then, the concept has been generalized, and the connections with [[quadratic number field]]s, the [[modular group]], and other areas of mathematics have been further elucidated.
| |
| | |
| == Real quadratic forms ==
| |
| {{see also|Sylvester's law of inertia|Definite form}}
| |
| | |
| Any ''n''×''n'' real [[symmetric matrix]] ''A'' determines a quadratic form ''q''<sub>''A''</sub> in ''n'' variables by the formula
| |
| | |
| : <math>q_A(x_1,\ldots,x_n) = \sum_{i,j=1}^{n}a_{ij}{x_i}{x_j}. </math>
| |
| | |
| Conversely, given a quadratic form in ''n'' variables, its coefficients can be arranged into an ''n''×''n'' symmetric matrix. One of the most important questions in the theory of quadratic forms is how much can one simplify a quadratic form ''q'' by a homogeneous linear change of variables. A fundamental theorem due to [[Carl Gustav Jacobi|Jacobi]] asserts that ''q'' can be brought to a '''diagonal form'''
| |
| | |
| : <math> \lambda_1 \tilde x_1^2 + \lambda_2 \tilde x_2^2 + \cdots + \lambda_n \tilde x_n^2, </math>
| |
| | |
| so that the corresponding symmetric matrix is [[diagonal matrix|diagonal]], and this is even possible to accomplish with a change of variables given by an [[orthogonal matrix]] – in this case the coefficients λ<sub>1</sub>, λ<sub>2</sub>, …, λ<sub>''n''</sub> are in fact determined uniquely up to a permutation. If the change of variables is given by an invertible matrix, not necessarily orthogonal, then the coefficients λ<sub>''i''</sub> can be made to be 0,1, and −1. [[Sylvester's law of inertia]] states that the numbers of 1 and −1 are [[invariant (mathematics)|invariants]] of the quadratic form, in the sense that any other diagonalization will contain the same number of each. The '''signature''' of the quadratic form is the triple (''n''<sub>0</sub>, ''n''<sub>+</sub>, ''n''<sub>−</sub>) where ''n''<sub>0</sub> is the number 0s and ''n''<sub>±</sub> is the number of ±1s. Sylvester's law of inertia shows that this is a well-defined quantity attached to the quadratic form. The case when all λ<sub>''i''</sub> have the same sign is especially important: in this case the quadratic form is called '''[[positive definite form|positive definite]]''' (all 1) or '''negative definite''' (all −1); if none of the terms are 0 then the form is called '''{{visible anchor|nondegenerate}}'''; this includes positive definite, negative definite, and indefinite (a mix of 1 and −1); equivalently, a nondegenerate quadratic form is one whose associated symmetric form is a [[nondegenerate form|nondegenerate ''bilinear'' form]]. A real vector space with an indefinite nondegenerate quadratic form of index (''p'', ''q'') (''p'' 1s, ''q'' −1s) is often denoted as '''R'''<sup>''p'',''q''</sup> particularly in the physical theory of [[space-time]].
| |
| | |
| The [[Discriminant#Discriminant of a quadratic form|discriminant of a quadratic form]], concretely the class of the determinant of a representing matrix in ''K''/(''K*'')<sup>2</sup> (up to non-zero squares) can also be defined, and for a real quadratic form is a cruder invariant than signature, taking values of only “positive, zero, or negative”. Zero corresponds to degenerate, while for a non-degenerate form it is the parity of the number of negative coefficients, <math>(-1)^{n_-}.</math>
| |
| | |
| These results are reformulated in a different way below.
| |
| | |
| Let ''q'' be a quadratic form defined on an ''n''-dimensional [[real number|real]] vector space. Let ''A'' be the matrix of the quadratic form ''q'' in a given basis. This means that ''A'' is a symmetric ''n''×''n'' matrix such that
| |
| | |
| : <math>q(v)=x^\mathrm{T} Ax,</math>
| |
| | |
| where ''x'' is the column vector of coordinates of ''v'' in the chosen basis. Under a change of basis, the column ''x'' is multiplied on the left by an ''n''×''n'' [[invertible matrix]] ''S'', and the symmetric square matrix ''A'' is transformed into another symmetric square matrix ''B'' of the same size according to the formula
| |
| | |
| : <math> A\to B=SAS^\mathrm{T}.</math> | |
| | |
| Any symmetric matrix ''A'' can be transformed into a diagonal matrix
| |
| | |
| : <math> B=\begin{pmatrix}
| |
| \lambda_1 & 0 & \cdots & 0\\
| |
| 0 & \lambda_2 & \cdots & 0\\
| |
| \vdots & \vdots & \ddots & 0\\
| |
| 0 & 0 & \cdots & \lambda_n
| |
| \end{pmatrix}</math>
| |
| | |
| by a suitable choice of an orthogonal matrix ''S'', and the diagonal entries of ''B'' are uniquely determined — this is Jacobi's theorem. If ''S'' is allowed to be any invertible matrix then ''B'' can be made to have only 0,1, and −1 on the diagonal, and the number of the entries of each type (''n''<sub>0</sub> for 0, ''n''<sub>+</sub> for 1, and ''n''<sub>−</sub> for −1) depends only on ''A''. This is one of the formulations of Sylvester's law of inertia and the numbers ''n''<sub>+</sub> and ''n''<sub>−</sub> are called the '''positive''' and '''negative''' '''indices of inertia'''. Although their definition involved a choice of basis and consideration of the corresponding real symmetric matrix ''A'', Sylvester's law of inertia means that they are invariants of the quadratic form ''q''.
| |
| | |
| The quadratic form ''q'' is positive definite (resp., negative definite) if ''q''(''v'') > 0 (resp., ''q''(''v'') < 0) for every nonzero vector ''v''.<ref>If a non-strict inequality (with ≥ or ≤) holds then the quadratic form ''q'' is called semidefinite.</ref> When ''q''(''v'') assumes both positive and negative values, ''q'' is an '''indefinite''' quadratic form. The theorems of Jacobi and Sylvester show that any positive definite quadratic form in ''n'' variables can be brought to the sum of ''n'' squares by a suitable invertible linear transformation: geometrically, there is only ''one'' positive definite real quadratic form of every dimension. Its [[isometry group]] is a ''[[compact space|compact]]'' [[orthogonal group]] O(''n''). This stands in contrast with the case of indefinite forms, when the corresponding group, the [[indefinite orthogonal group]] O(''p'', ''q''), is non-compact. Further, the isometry groups of ''Q'' and −''Q'' are the same (O(''p'', ''q'') ≈ O(''q'', ''p'')), but the associated [[Clifford algebra]]s (and hence [[Pin group]]s) are different.
| |
| | |
| == Definitions ==
| |
| An ''n''-ary '''quadratic form''' over a field ''K'' is a [[homogeneous polynomial]] of degree 2 in ''n'' variables with coefficients in ''K'':
| |
| | |
| : <math>q(x_1,\ldots,x_n) = \sum_{i,j=1}^{n}a_{ij}{x_i}{x_j}, \quad a_{ij}\in K. </math>
| |
| | |
| This formula may be rewritten using matrices: let ''x'' be the [[column vector]] with components ''x''<sub>1</sub>, ..., ''x''<sub>''n''</sub> and {{nowrap|1=''A'' = (''a''<sub>''ij''</sub>)}} be the ''n''×''n'' matrix over ''K'' whose entries are the coefficients of ''q''. Then
| |
| | |
| : <math> q(x)=x^\mathrm{T}Ax. </math>
| |
| | |
| Two ''n''-ary quadratic forms φ and ψ over ''K'' are '''equivalent''' if there exists a nonsingular linear transformation {{nowrap|''C'' ∈ [[General linear group|GL]](''n'', ''K'')}} such that
| |
| | |
| : <math> \psi(x)=\varphi(Cx). </math>
| |
| | |
| <!-- Space at the beginning of the next line is intentional. Please, do not remove! -->
| |
| ''Let us assume that the characteristic of ''K'' is different from 2.'' | |
| (The theory of quadratic forms over a field of characteristic 2 has important differences and many definitions and theorems have to be modified.) The coefficient matrix ''A'' of ''q'' may be replaced by the [[symmetric matrix]] {{nowrap|(''A'' + ''A''<sup>T</sup>)/2}} with the same quadratic form, so it may be assumed from the outset that ''A'' is symmetric. Moreover, a symmetric matrix ''A'' is uniquely determined by the corresponding quadratic form. Under an equivalence ''C'', the symmetric matrix ''A'' of φ and the symmetric matrix ''B'' of ψ are related as follows:
| |
| | |
| : <math> B=C^\mathrm{T}AC. </math>
| |
| | |
| The '''associated bilinear form''' of a quadratic form ''q'' is defined by
| |
| | |
| : <math> b_q(x,y)=\tfrac{1}{2}(q(x+y)-q(x)-q(y)) = x^\mathrm{T}Ay = y^\mathrm{T}Ax. </math>
| |
| | |
| Thus, ''b''<sub>''q''</sub> is a [[symmetric bilinear form]] over ''K'' with matrix ''A''. Conversely, any symmetric bilinear form ''b'' defines a quadratic form
| |
| | |
| : <math> q(x)=b(x,x) </math>
| |
| | |
| and these two processes are the inverses of one another. As a consequence, over a field of characteristic not equal to 2, the theories of symmetric bilinear forms and of quadratic forms in ''n'' variables are essentially the same.
| |
| | |
| === Quadratic spaces ===
| |
| A quadratic form ''q'' in ''n'' variables over ''K'' induces a map from the ''n''-dimensional coordinate space ''K''<sup>''n''</sup> into ''K'':
| |
| | |
| : <math> Q(v)=q(v), \quad v=[v_1,\ldots,v_n]^\mathrm{T}\in K^n. </math>
| |
| | |
| The map ''Q'' is a '''quadratic map''', which means that it has the properties:
| |
| | |
| *For all ''a'' in ''K'' and ''v'' in ''V'':
| |
| ::<math> Q(av) = a^2 Q(v). </math>
| |
| | |
| *When the characteristic of ''K'' is not two, the map {{nowrap|''B''<sub>''Q''</sub>: ''V''×''V'' → ''K''}} defined below is bilinear over ''K'':
| |
| ::<math> B_Q(v,w)= \tfrac{1}{2}(Q(v+w)-Q(v)-Q(w)).</math>
| |
|
| |
| This bilinear form ''B<sub>Q</sub>'' has the special property that {{nowrap|1=''B''(''x'', ''x'') = ''Q''(''x'')}} for all ''x'' in ''V''. When the characteristic of ''K'' is two so that 2 is not a [[Unit (ring theory)|unit]], it is still possible to use a quadratic form to define a bilinear form {{nowrap|1=''B''(''x'',''y'') = ''Q''(''x''+''y'') − ''Q''(''x'') − ''Q''(''y'')}}. However, ''Q''(''x'') can no longer be recovered from this ''B'' in the same way, since {{nowrap|1=''B''(''x'', ''x'') = 0}} for all ''x''. | |
| | |
| The pair (''V'', ''Q'') consisting of a finite-dimensional vector space ''V'' over ''K'' and a quadratic map from ''V'' to ''K'' is called a '''quadratic space''' and ''B<sub>Q</sub>'' is the associated bilinear form of ''Q''. The notion of a quadratic space is a coordinate-free version of the notion of quadratic form. Sometimes, ''Q'' is also called a quadratic form.
| |
| | |
| Two ''n''-dimensional quadratic spaces (''V'', ''Q'') and (''V'' ′, ''Q'' ′) are '''isometric''' if there exists an invertible linear transformation {{nowrap|''T'': ''V'' →''V'' ′}} ('''isometry''') such that
| |
| | |
| : <math> Q(v) = Q'(Tv) \text{ for all } v\in V.</math>
| |
| | |
| The isometry classes of ''n''-dimensional quadratic spaces over ''K'' correspond to the equivalence classes of ''n''-ary quadratic forms over ''K''.
| |
| | |
| === Further definitions ===
| |
| {{see also|Isotropic quadratic form}}
| |
| Two elements ''v'' and ''w'' of ''V'' are called '''[[orthogonal]]''' if {{nowrap|1=''B''(''v'',''w'') = 0}}. The '''kernel''' of a bilinear form ''B'' consists of the elements that are orthogonal to all elements of ''V''. ''Q'' is '''non-singular''' if the kernel of its associated bilinear form is 0. If there exists a non-zero ''v'' in ''V'' such that {{nowrap|1=''Q''(''v'') = 0}}, the quadratic form ''Q'' is '''[[Isotropic quadratic form|isotropic]]''', otherwise it is '''anisotropic'''. This terminology also applies to vectors and subspaces of a quadratic space. If the restriction of ''Q'' to a subspace ''U'' of ''V'' is identically zero, ''U'' is '''totally singular'''.
| |
| | |
| The [[orthogonal group]] of a non-singular quadratic form ''Q'' is the group of the linear automorphisms of ''V'' that preserve ''Q'', i.e. the group of isometries of (''V'', ''Q'') into itself.
| |
| | |
| == Equivalence of forms ==
| |
| Every quadratic form ''q'' in ''n'' variables over a field of characteristic not equal to 2 is equivalent to a '''diagonal form'''
| |
| | |
| : <math>q(x)=a_1 x_1^2 + a_2 x_2^2+ \ldots +a_n x_n^2.</math>
| |
| | |
| Such a diagonal form is often denoted by
| |
| | |
| :<math>\langle a_1,\dots,a_n\rangle.</math>
| |
| | |
| Classification of all quadratic forms up to equivalence can thus be reduced to the case of diagonal forms.
| |
| | |
| ==Geometric meaning==
| |
| Using [[Cartesian coordinates]] in three dimensions, let <math>\mathbf{x} = (x,y,z)^T</math>, and let <math>A</math> be a [[symmetric matrix|symmetric]] 3-by-3 matrix. Then the geometric nature of the [[solution set]] of the equation <math>\mathbf{x}^\mathrm{T}A\mathbf{x}+\mathbf{b}^\mathrm{T}\mathbf{x}=1</math> depends on the eigenvalues of the matrix <math>A</math>.
| |
| | |
| If all [[eigenvalue]]s of <math>A</math> are non-zero, then the solution set is an [[ellipsoid]] or a [[hyperboloid]]. If all the eigenvalues are positive, then it is an ellipsoid; if all the eigenvalues are negative, then it is an ''imaginary ellipsoid'' (we get the equation of an ellipsoid but with imaginary radii); if some eigenvalues are positive and some are negative, then it is a hyperboloid.
| |
| | |
| If there exist one or more eigenvalues <math>\lambda_i = 0</math>, then the shape depends on the corresponding <math>b_i</math>. If the corresponding <math>b_i \neq 0</math>, then the solution set is a [[paraboloid]] (either elliptic or hyperbolic); if the corresponding <math>b_i = 0</math>, then the dimension <math>i</math> degenerates and does not get into play, and the geometric meaning will be determined by other eigenvalues and other components of <math>\mathbb{b}</math>. When the solution set is a paraboloid, whether it is elliptic or hyperbolic is determined by whether all other non-zero eigenvalues are of the same sign: if they are, then it is elliptic; otherwise, it is hyperbolic.
| |
| | |
| == Integral quadratic forms ==
| |
| Quadratic forms over the ring of integers are called '''integral quadratic forms''', whereas the corresponding modules are '''quadratic lattices''' (sometimes, simply [[lattice (group)|lattice]]s). They play an important role in [[number theory]] and [[topology]].
| |
| | |
| An integral quadratic form has integer coefficients, such as ''x''<sup>2</sup> + ''xy'' + ''y''<sup>2</sup>; equivalently, given a lattice Λ in a vector space ''V'' (over a field with characteristic 0, such as '''Q''' or '''R'''), a quadratic form ''Q'' is integral ''with respect to'' Λ if and only if it is integer-valued on Λ, meaning {{nowrap|''Q''(''x'',''y'') ∈ '''Z'''}} if {{nowrap|''x'',''y'' ∈ Λ}}.
| |
| | |
| This is the current use of the term; in the past it was sometimes used differently, as detailed below.
| |
| | |
| === Historical use ===
| |
| Historically there was some confusion and controversy over whether the notion of '''integral quadratic form''' should mean:
| |
| ;''twos in'': the quadratic form associated to a symmetric matrix with integer coefficients
| |
| ;''twos out'': a polynomial with integer coefficients (so the associated symmetric matrix may have half-integer coefficients off the diagonal)
| |
| This debate was due to the confusion of quadratic forms (represented by polynomials) and symmetric bilinear forms (represented by matrices), and "twos out" is now the accepted convention; "twos in" is instead the theory of integral symmetric bilinear forms (integral symmetric matrices).
| |
| | |
| In "twos in", binary quadratic forms are of the form <math>ax^2+2bxy+cy^2</math>, represented by the symmetric matrix
| |
| :<math>\begin{pmatrix}a & b\\ b&c\end{pmatrix}</math>
| |
| this is the convention [[Gauss]] uses in [[Disquisitiones Arithmeticae]].
| |
| | |
| In "twos out", binary quadratic forms are of the form <math>ax^2+bxy+cy^2</math>, represented by the symmetric matrix
| |
| :<math>\begin{pmatrix}a & b/2\\ b/2&c\end{pmatrix}.</math>
| |
| | |
| Several points of view mean that ''twos out'' has been adopted as the standard convention. Those include:
| |
| * better understanding of the 2-adic theory of quadratic forms, the 'local' source of the difficulty;
| |
| * the [[lattice (group)|lattice]] point of view, which was generally adopted by the experts in the arithmetic of quadratic forms during the 1950s;
| |
| * the actual needs for integral quadratic form theory in [[topology]] for [[intersection theory]];
| |
| * the [[Lie group]] and [[algebraic group]] aspects.
| |
| | |
| === Universal quadratic forms ===
| |
| An integral quadratic form whose image consists of all the positive integers is sometimes called ''universal''. [[Lagrange's four-square theorem]] shows that <math>w^2+x^2+y^2+z^2</math> is universal. [[Ramanujan]] generalized this to <math>aw^2+bx^2+cy^2+dz^2</math> and found 54 multisets {''a'',''b'',''c'',''d''} that can each generate all positive integers, namely,
| |
| | |
| :{1,1,1,''d''}, 1 ≤ ''d'' ≤ 7
| |
| :{1,1,2,''d''}, 2 ≤ ''d'' ≤ 14
| |
| :{1,1,3,''d''}, 3 ≤ ''d'' ≤ 6
| |
| :{1,2,2,''d''}, 2 ≤ ''d'' ≤ 7
| |
| :{1,2,3,''d''}, 3 ≤ ''d'' ≤ 10
| |
| :{1,2,4,''d''}, 4 ≤ ''d'' ≤ 14
| |
| :{1,2,5,''d''}, 6 ≤ ''d'' ≤ 10
| |
| | |
| There are also forms whose image consists of all but one of the positive integers. For example, {1,2,5,5} has 15 as the exception. Recently, the [[15 and 290 theorems]] have completely characterized universal integral quadratic forms: if all coefficients are integers, then it represents all positive integers if and only if it represents all integers up through 290; if it has an integral matrix, it represents all positive integers if and only if it represents all integers up through 15.
| |
| | |
| == See also ==
| |
| *[[ε-quadratic form]]
| |
| *[[Quadratic form (statistics)]]
| |
| *[[Discriminant#Discriminant of a quadratic form|Discriminant of a quadratic form]]
| |
| *[[Cubic form]]
| |
| *[[Witt group]]
| |
| *[[Witt's theorem]]
| |
| *[[Hasse–Minkowski theorem]]
| |
| *[[Orthogonal group]]
| |
| *[[Square class]]
| |
| *[[Ramanujan's ternary quadratic form]]
| |
| | |
| ==Notes==
| |
| <references/>
| |
| | |
| ==References==
| |
| * {{Citation | last=O'Meara | first=O.T. | authorlink=O. Timothy O'Meara | title=Introduction to Quadratic Forms | publisher=[[Springer-Verlag]] | location=Berlin, New York | isbn=978-3-540-66564-9 | year=2000}}
| |
| * {{Citation | last1=Conway | first1=John Horton | author1-link= John Horton Conway | last2=Fung | first2=Francis Y. C. | title=The Sensual (Quadratic) Form | publisher=The Mathematical Association of America | series=Carus Mathematical Monographs | isbn=978-0-88385-030-5 | year=1997}}
| |
| * {{cite book
| |
| | last = Shafarevich
| |
| | first = I. R.
| |
| | authorlink = Igor Shafarevich
| |
| | coauthors = A. O. Remizov
| |
| | title = Linear Algebra and Geometry
| |
| | publisher = [[Springer Science+Business Media|Springer]]
| |
| | year = 2012
| |
| | url = http://www.springer.com/mathematics/algebra/book/978-3-642-30993-9
| |
| | isbn = 978-3-642-30993-9}}
| |
| | |
| ==Further reading==
| |
| * {{cite book | first=J.W.S. | last=Cassels | authorlink=J. W. S. Cassels | title=Rational Quadratic Forms | series=London Mathematical Society Monographs | volume=13 | publisher=[[Academic Press]] | year=1978 | isbn=0-12-163260-1 | zbl=0395.10029 }}
| |
| * {{cite book | last=Kitaoka | first=Yoshiyuki | title=Arithmetic of quadratic forms | series=Cambridge Tracts in Mathematics | volume=106 | publisher=Cambridge University Press | year=1993 | isbn=0-521-40475-4 | zbl=0785.11021 }}
| |
| * {{cite book | title=Introduction to Quadratic Forms over Fields | volume=67 | series=Graduate Studies in Mathematics | first=Tsit-Yuen | last=Lam | authorlink=Tsit Yuen Lam | publisher=[[American Mathematical Society]] | year=2005 | isbn=0-8218-1095-2 | zbl=1068.11023 | mr = 2104929 }}
| |
| * {{cite book | first1=J. | last1=Milnor | author1-link=John Milnor| first2=D. | last2=Husemoller | title=Symmetric Bilinear Forms | series=[[Ergebnisse der Mathematik und ihrer Grenzgebiete]] | volume=73 | publisher=[[Springer-Verlag]] | year=1973 | isbn=3-540-06009-X | zbl=0292.10016 }}
| |
| * {{cite book | last=O'Meara | first=O.T. | authorlink=O. Timothy O'Meara | title=Introduction to quadratic forms | series=Die Grundlehren der mathematischen Wissenschaften | volume=117 | publisher=[[Springer-Verlag]] | isbn=3-540-66564-1 | year=1973 | zbl=0259.10018 }}
| |
| | |
| ==External links ==
| |
| * {{eom|id=q/q076080|author=A.V.Malyshev|title=Quadratic form}}
| |
| * {{eom|id=b/b016370|author=A.V.Malyshev|title=Binary quadratic form}}
| |
| | |
| {{DEFAULTSORT:Quadratic Form}}
| |
| [[Category:Linear algebra]]
| |
| [[Category:Quadratic forms]]
| |
| [[Category:Real algebraic geometry]]
| |