(redirected from Jacobians)
Also found in: Dictionary.
Related to Jacobians: Jacobins


The Jacobian of functions ƒi (x1, x2, …, xn ), i = 1, 2, …, n, of real variables xi is the determinant of the matrix whose i th row lists all the first-order partial derivatives of the function ƒi (x1, x2, …, xn ). Also known as Jacobian determinant.



(or functional determinant), a determinant Jacobian with elements aik = ∂yi/∂xk where yi = fi(x1, . . ., xn), 1 ≤ in, are functions that have continuous partial derivatives in some region Δ. It is denoted by

The Jacobian was introduced by K. Jacobi in 1833 and 1841. If, for example, n = 2, then the system of functions

(1) yl = f1(x1, x2) y2 = f2(x1, x2)

defines a mapping of a region Δ, which lies in the plane x1x2, onto a region of the plane y1y2. The role of the Jacobian for the mapping is largely analogous to that of the derivative for a function of a single variable. Thus, the absolute value of the Jacobian at some point M is equal to the local factor by which areas at the point are altered by the mapping; that is, it is equal to the limit of the ratio of the area of the image of the neighborhood of M to the area of the neighborhood as the dimensions of the neighborhood approach zero. The Jacobian at M is positive if mapping (1) does not change the orientation in the neighborhood of M, and negative otherwise.

If the Jacobian does not vanish in the region Δ and if φ(y1, y2) is a function defined in the region Δ1 (the image of Δ), then

(the formula for change of variables in a double integral). An analogous formula obtains for multiple integrals. If the Jacobian of mapping (1) does not vanish in region Δ, then there exists the inverse mapping

x1 = ψ(y1, y2) x2 = ψ2(y1, y2)


(an analogue of the formula for differentiation of an inverse function). This assertion finds numerous applications in the theory of implicit functions.

In order for the explicit expression, in the neighborhood of the point Jacobian, of the functions y1, . . . . ym that are implicitly defined by the equations

(2) Fk (x1. . . .,xn, y1. . .,ym) = 0 Ikm

to be possible, it is sufficient that the coordinates of M satisfy equations (2), that the functions Fk have continuous partial derivatives, and that the Jacobian

be nonzero at M.


Kudriavtsev, L. D. Matematicheskii analiz, 2nd ed., vol. 2. Moscow, 1973.
Il’in, V. A., and E. G. Pozniak. Osnovy matematicheskogo analiza, 3rd ed.. part I. Moscow, 1971.
References in periodicals archive ?
Mazin relate the q, t-Catalan numbers and their generalizations to the homology of compactified Jacobians for singular plane curves with Puiseux pair (a, b).
In a hyperelliptic curve cryptosystem, the rational point group of an elliptic curve, is replaced by the Jacobian group of a hyperelliptic curve, and its security is based on the discrete logarithm on this Jacobian group, that is, based on the hyperelliptic curve discrete logarithm problems(HECDLP).
For solving this non-smooth equations can be propose the non-smooth damped Newton method using the generalized Jacobians.
n x n] (with n [greater than or equal to] m) approximate the Jacobian [[nabla]c(x).
Using these facts to evaluate the Jacobians we simply calculate [Mathematical Expression Omitted] and [Mathematical Expression Omitted] where [[Lambda].
The main aim of this paper is to show that the Newton method based on the plenary hull of the Clarke generalized Jacobians (the nonsmooth damped Newton method) can be implemented for solving Lipschitz nonsmooth equation.
The partial matrix estimation technique [8], which has been used in the estimation of sparse Jacobians and Hessians under various names [6, 7, 15, 16, 20], provides a way for approximating more general matrices.
This notion arises in different fields of research including the study of "abelian sandpiles" ([Dha90, Gab93]), the study of component groups of Nron models of Jacobians of algebraic curves ([Ray70, Lor89]), and the theory of chip-firing games on graphs ([Big97]).
Hida (University of California, Los Angeles) has arranged material in five chapters covering an algebra-geometric tool box, elliptic curves, geometric modular forms, Jacobians and Galois representations, and modularity problems.
Seber covers vectors, vector spaces, convexity, rank matrix functions (inverse, transpose, trace, determinant and norm), related matrices (including complex and Hermitian), eigenvalues, eigenvectors, singular values, generalized inverses, special matrices, non-negative vectors and matrices, positive definite and non-negative definite matrices, special products and operators, inequalities, linear equations, partitioned matrices, patterned matrices, factorization of matrices, differentiation, Jacobians, matrix limits (including sequences and series), random vectors and matrices, inequalities for probabilities and random variables, majorization, optimization and matrix approximation.
We find a highly efficient procedure to calculate the local Jacobians, which are then used in a fashion determined by the context.
They are organized into sections devoted to moduli spaces and Shimura curves, curves and Jacobians over finite fields, Galois covers of function fields in positive characteristic, zeta functions of graphs, and three miscellaneous topics.