Have you ever considered how the shortest route to your location is determined by Google Maps<\/a>?Or how you\u2019re automatically moving the steering wheel will impact the motion of your vehicle when you spin it? Well, it all comes down to the Jacobian Matrix. The Jacobian Matrix is a matrix of partial derivatives of a vector function. The transformation of Jacobian spherical coordinates is where the Jacobian is most commonly used. It addresses the idea of Jacobian spherical coordinates transformation in differentiation. In this article, we\u2019ll be discussing the mathematical concept of the Jacobian Matrix, its formula, determinants, and how we\u2019re using it in our daily lives.<\/p>\n The Jacobian matrix and its determinants are defined for a finite number of functions with the same number of variables, and are referred to as \u201cJacobian\u201d. It tells us how changes in one set of variables affect another set of variables in a function that maps between different spaces.<\/p>\n In this scenario, the first partial derivative of the same function concerning the variables is found in each row. The matrix can be of either form \u2013 a square matrix with an equal number of rows and columns, or a rectangular matrix with an uneven number of rows and columns.<\/p>\n Example: While trekking through a mountain with an upside-down trail, there is usually a direction and a degree of steepness. No matter where you are on the mountain, the Jacobian is like having your guide who tells you how steep your climb will be and which way you are going.<\/p>\n Also Read: Mathematics behind Machine Learning \u2013 The Core Concepts you Need to Know<\/a><\/em><\/p>\n Now, a Jacobian matrix is a matrix consisting of partial derivatives that shows the transformation of an input vector into an output vector by a function. It explains how each output changes with respect to every input variable. For a function f: \u211d\u207f \u2192 \u211d\u1d50\u00a0 having total number of m components and n variables, the Jacobian formula can be represented as:<\/p>\n Symbolic Jacobian matrix:<\/strong> Jacobian at point (2, 3):<\/strong> Determinant of Jacobian (symbolic):<\/strong> Determinant at point (2, 3):<\/strong> Numerical Jacobian at point (2, 3):<\/strong><\/p>\n Here, the Jacobian Formula will give local linear approximation to a function around a point and give explanation about how the function is stretching, rotating, and transforming space.<\/p>\n In order to understand the Jacobian Matrix fully, we\u2019ll be discussing different foundations of mathematics:<\/p>\n It basically refers to the functions that map points from one space to another. These functions have multiple outputs corresponding to multiple inputs. Such functions give the foundation structures of real-life systems like fluid dynamics.<\/p>\n The Jacobian combines linear algebra and multi-variable calculus. Scalar derivatives tell us about the rate of change in single-variable functions. It also explains about rates of change in functions with multiple inputs and outputs presented in matrix format.<\/p>\n Also Read: 12 Matrix Operations You Should Know While Starting your Deep Learning Journey<\/a><\/em><\/p>\n The structure and the formatting of a Jacobian matrix explain important information about the representation of the transformation. For a function f: \u211d\u207f into \u211d\u1d50, where \u2018n\u2019 represents the input and \u2018m\u2019 output, the Jacobian is an \u2018m\u2019 by \u2018n\u2019 matrix. The entries of the Jacobian matrix denote J\u1d62\u2c7c=\u2202f\u1d62\/\u2202x\u2c7c , the representation of i\u2019th output functions change with respect to the j\u2019th input variable.<\/p>\n So, the dimensions of a matrix affect the transformation. From a 3D space to a 2D space, Jacobian will have rows equal to outputs and columns equal to inputs, which results in a 2*3 matrix.<\/p>\n The functional behaviour of the Jacobian also explains the visual insights with the algebraic definition. The following interpretation helps us in identifying how the Jacobian matrix describes the local behaviour of functions in geometric terms.<\/p>\n The relationship between the Jacobian and Invertibility proved necessary information. It provided insights into the local behavior of the function at a particular point.<\/p>\n A function is said to be invertible in a neighbourhood whenever the Jacobian is non-singular, its determinant being not equal to zero. Then coinciding with that point we\u2019ll have our Inverse Function theorem. But whenever the Jacobian determinant becomes zero, the output domain undergoes folding, compaction, or localization.<\/p>\n Also Read: A Comprehensive Beginners Guide to Linear Algebra for Data Scientists<\/a><\/em><\/p>\n Now let\u2019s understand the properties of the Jacobian.<\/p>\n Now, we\u2019ll see three different methods of computing the Jacobian Matrix and transformation of Jacobian spherical coordinates \u2013 Analytical Derivation, Numerical Approximation and Automatic Differentiation.<\/p>\n It is the classical way that relies on direct computation of the partial derivatives to produce the Jacobian matrix providing insight into the transformation structure. It is achieved by systematically differentiating each component function with respect to each input variable.<\/p>\n Let\u2019s consider an example where vector function\u00a0 f: \u211d\u207f \u2192 \u211d\u1d50 with components f\u2081, f\u2082, \u2026, f\u2098, and variables x\u2081, x\u2082, \u2026, x\u2099 is computed with the partial derivative \u2202fi\/\u2202xj for each j=1,2,\u2026.n.<\/p>\n Example: f(x,y) = (x\u00b2-y, 2xy), the partial derivatives evaluated are:<\/p> \u2202f\u2081\/\u2202x = 2x And by this we can say that the Jacobian matrix observed is:<\/p> J(x,y) = [2x\u00a0 -1 By this method, we can see exact results. However, things can get complicated while dealing with multiple variables at a time or complicated functions where computations are not possible.<\/p>\n Whenever an analytical derivation is either too bulky to carry out or when a function lacks a form expression, numerical methods offer practical alternative solutions that compute partial derivatives using finite differences. The two principal finite difference methods are:<\/p>\n Here, h = small step that typically would be of order of 10\u207b\u2076 for double precision.<\/p>\n It is all about choosing the right size of step to take. Too big brings in approximation errors while small causes numerical instability due to floating point limitations. Advanced techniques using adaptive step sizing or Richardson extrapolation can improve accuracy further.<\/p>\n Automatic differentiation which combines analytical accuracy with computational automation is very high on the list. It is different from the numerical method in that AD computes exact derivatives rather than approximating them which leads to avoiding errors of discretization. The basis principles of automatic differentiation are:<\/p>\n This makes automatic differentiation very accessible and efficient for modern software frameworks such as TensorFlow, PyTorch, JAX. They prefer it for computing Jacobians in machine learning, and optimization problems with the scientific ones.<\/p>\n Let\u2019s see how we can implement a Jacobian matrix and jacobian spherical coordinates using Python. We\u2019ll use both symbolic computation and numerical approximation with SymPy and NumPy respectively.<\/p>\n Import the necessary paths required to run the function.<\/p>\n Write the function for symbolic computation with SymPy.<\/p>\n Write the function for numerical approximation with NumPy.<\/p>\n Write the main function for the execution of above function and visualization of transformation.<\/p>\n The nonlinear mapping f(x,y) = (x\u00b2-y, 2xy) is proposed, and the Jacobian properties are highlighted. The original space is shown at left with a uniform grid and a unit circle, while the right map shows the space after transformation, where the circle has morphed into a figure-eight.<\/p>\n The Jacobian matrix is calculated both symbolically (Matrix([[2x, -1], [2y, 2*x]])) and at the numerical point (2,3). It shows a determinant equal to 22. This signifies a large stretch of area locally. Thus, this analysis provides a mathematical view of how the transformation distorts the area. The linearization (green curve) represents the local structure of this nonlinear mapping.<\/p>\n The latest ML frameworks include automatic differentiation tools that compute the Jacobian matrix for us. This is a game changer for complex applications such as:<\/p>\n Calculus, differential geometry, and linear algebra are all disciplines of mathematics that the Jacobian Matrix ties together and applies to real-world applications. From the advanced surgical robots to GPS locations, the Jacobian plays a huge role in making the technology more responsive and congenital. It\u2019s an example of how mathematics can both describe our universe and help us interact with it more effectively and efficiently.<\/p>\n A. The determinant gives you information about volume changes and invertibility, while the full matrix provides directional information. Use the determinant when you care about scaling factors and invertibility, and the full matrix when you need to know how directions transform.<\/p>\n<\/p><\/div>\n A. The gradient is actually a special case of the Jacobian! When your function outputs just one value (a scalar field), the Jacobian is a single row, which is exactly the gradient of that function.<\/p>\n<\/p><\/div>\n A. Yes! If your function isn\u2019t differentiable at a point, the Jacobian isn\u2019t defined there. This happens at corners, cusps, or discontinuities in your function.<\/p>\n<\/p><\/div>\n A. When changing coordinate systems (like from Cartesian to polar), the Jacobian determines how areas or volumes transform between the systems. This is essential in multivariable calculus for correctly computing integrals in different coordinate systems.<\/p>\n<\/p><\/div>\n A. Numerical approximations of the Jacobian can suffer from round-off errors and truncation errors. In critical applications like robotics or financial modeling, sophisticated techniques like automatic differentiation are often used to minimize these errors.<\/p>\n<\/p><\/div>\n<\/p><\/div>\n <\/a>\n <\/div>\n<\/p><\/div>\n Gen AI Intern at Analytics Vidhya\u00a0 I am currently working as a Gen AI Intern at Analytics Vidhya, where I contribute to innovative AI-driven solutions that empower businesses to leverage data effectively. As a final-year Computer Science student at Vellore Institute of Technology, I bring a solid foundation in software development, data analytics, and machine learning to my role.\u00a0<\/p>\n Feel free to connect with me at [email\u00a0protected]<\/a>\u00a0<\/p>\n<\/p><\/div>\n<\/p><\/div>\n What is the Jacobian?<\/h2>\n
What is a Jacobian Matrix?<\/h2>\n
Matrix([[2*x, -1], [2*y, 2*x]])<\/code><\/p>\nMatrix([[4, -1], [6, 4]])<\/code><\/p>\n4*x**2 + 2*y<\/code><\/p>\n22<\/code><\/p>\n[[ 4.000001 -1. ] \n [ 6. 4. ]]<\/code><\/code><\/pre>\nMathematical Foundations of the Jacobian Matrix<\/h2>\n
1. Vector-valued Functions & Multivariable Calculus<\/h3>\n
2. Notation & Dimensions<\/h3>\n
3. Geometric Interpretations<\/h3>\n
![\"Geometric](\"https:\/\/cdn.analyticsvidhya.com\/wp-content\/uploads\/2025\/05\/image3-1.webp\")
<\/figure>\n\n
4. Jacobian & Invertibility of Jacobian Function<\/h3>\n
![\"Jacobian](\"https:\/\/cdn.analyticsvidhya.com\/wp-content\/uploads\/2025\/05\/image5-2.webp\")
<\/figure>\n\n
Properties of the Jacobian<\/h2>\n
\n
Computing the Jacobian Matrix<\/h2>\n
Analytical Derivation of Jacobian Matrix<\/h3>\n
J(x) = [
Numerical Approximation of the Jacobian Matrix<\/h3>\n
\n
\u2202fi\/\u2202x\u2c7c \u2248 [f(x\u2081,...,x\u2c7c+h,...,x\u2099) - f(x\u2081,...,x\u2c7c,...,x\u2099)]\/h<\/pre>\n
\n
\u2202fi\/\u2202x\u2c7c \u2248 [f(x\u2081,...,x\u2c7c+h,...,x\u2099) - f(x\u2081,...,x\u2c7c-h,...,x\u2099)]\/(2h)<\/pre>\n
Automatic Differentiation of Jacobian Matrix<\/h3>\n
\n
Calculating Jacobian Matrix and determinant using Python<\/h2>\n
Step 1: Set Up the Environment<\/h4>\n
import numpy as np\nimport sympy as sp\nimport matplotlib.pyplot as plt\nfrom matplotlib.patches import Ellipse<\/code><\/pre>\nStep 2: Perform the Symbolic Computation<\/h4>\n
def symbolic_jacobian():\n x, y = sp.symbols('x y')\n f1 = x**2 - y\n f2 = 2*x*y\n \n # Define the function vector\n f = sp.Matrix([f1, f2])\n X = sp.Matrix([x, y])\n \n # Calculate the Jacobian matrix\n J = f.jacobian(X)\n \n print(\"Symbolic Jacobian matrix:\")\n print(J)\n \n # Calculate the Jacobian at point (2, 3)\n J_at_point = J.subs([(x, 2), (y, 3)])\n print(\"\\nJacobian at point (2, 3):\")\n print(J_at_point)\n \n # Calculate the determinant\n det_J = J.det()\n print(\"\\nDeterminant of Jacobian (symbolic):\")\n print(det_J)\n print(\"\\nDeterminant at point (2, 3):\")\n print(det_J.subs([(x, 2), (y, 3)]))\n \n return J, det_J<\/code><\/pre>\nStep 3: Add the Numerical Approximation<\/h4>\n
def numerical_jacobian(func, x, epsilon=1e-6):\n n = len(x) # Number of input variables\n m = len(func(x)) # Number of output variables\n \n jacobian = np.zeros((m, n))\n \n for i in range(n):\n x_plus = x.copy()\n x_plus[i] += epsilon\n \n jacobian[:, i] = (func(x_plus) - func(x)) \/ epsilon\n \n return jacobian<\/code><\/pre>\nStep 4: Write the Execution Function<\/h4>\n
def f(x):\n return np.array([x[0]**2 - x[1], 2*x[0]*x[1]])\n\n\n# Visualize the transformation\ndef visualize_transformation():\n # Create a grid of points\n x = np.linspace(-3, 3, 20)\n y = np.linspace(-3, 3, 20)\n X, Y = np.meshgrid(x, y)\n \n # Calculate transformed points\n U = X**2 - Y\n V = 2*X*Y\n \n # Plot original and transformed grid\n fig, (ax1, ax2) = plt.subplots(1, 2, figsize=(12, 6))\n \n # Original grid\n ax1.set_title('Original Space')\n ax1.set_xlabel('x')\n ax1.set_ylabel('y')\n ax1.grid(True)\n ax1.plot(X, Y, 'k.', markersize=2)\n \n # Add a unit circle\n circle = plt.Circle((0, 0), 1, fill=False, color=\"red\", linewidth=2)\n ax1.add_artist(circle)\n ax1.set_xlim(-3, 3)\n ax1.set_ylim(-3, 3)\n ax1.set_aspect('equal')\n \n # Transformed grid\n ax2.set_title('Transformed Space')\n ax2.set_xlabel('u')\n ax2.set_ylabel('v')\n ax2.grid(True)\n ax2.plot(U, V, 'k.', markersize=2)\n \n # Calculate the transformation of the unit circle\n theta = np.linspace(0, 2*np.pi, 100)\n x_circle = np.cos(theta)\n y_circle = np.sin(theta)\n u_circle = x_circle**2 - y_circle\n v_circle = 2*x_circle*y_circle\n ax2.plot(u_circle, v_circle, 'r-', linewidth=2)\n \n # Show the local linear approximation at point (1, 0)\n point = np.array([1, 0])\n J = numerical_jacobian(f, point)\n \n # Calculate how the Jacobian transforms a small circle at our point\n scale = 0.5\n transformed_points = []\n for t in theta:\n delta = scale * np.array([np.cos(t), np.sin(t)])\n transformed_delta = J @ delta\n transformed_points.append(transformed_delta)\n \n transformed_points = np.array(transformed_points)\n \n # Plot the approximation\n base_point_transformed = f(point)\n ax2.plot(base_point_transformed[0] + transformed_points[:, 0],\n base_point_transformed[1] + transformed_points[:, 1],\n 'g-', linewidth=2, label=\"Linear Approximation\")\n \n ax2.legend()\n plt.tight_layout()\n plt.show()\n\n\n# Execute the functions\nsymbolic_result = symbolic_jacobian()\npoint = np.array([2.0, 3.0])\nnumerical_result = numerical_jacobian(f, point)\n\n\nprint(\"\\nNumerical Jacobian at point (2, 3):\")\nprint(numerical_result)\n\n\n# Visualize the transformation\nvisualize_transformation()\n<\/code><\/pre>\nOutput:<\/h4>\n
![\"output\"](\"https:\/\/cdn.analyticsvidhya.com\/wp-content\/uploads\/2025\/05\/image1-1-2.webp\")
<\/figure>\n![\"Jacobian](\"https:\/\/cdn.analyticsvidhya.com\/wp-content\/uploads\/2025\/05\/image4-2.webp\")
<\/figure>\nOutput Review:<\/h4>\n
Applications of the Jacobian Matrix<\/h2>\n
\n
Conclusion<\/h2>\n
Frequently Asked Questions<\/h2>\n
\n ![\"Riya](\"https:\/\/av-eks-lekhak.s3.amazonaws.com\/media\/lekhak-profile-images\/converted_image_5X1DGT2.webp\")
<\/p>\n
Department of Computer Science, Vellore Institute of Technology, Vellore, India\u00a0<\/p>\nLogin to continue reading and enjoy expert-curated content.<\/h4>\n