Multivariable Functions

⚡ Key Takeaways

A multivariable function maps several real inputs to one or more real outputs, f:Rn→Rmf:\mathbb{R}^n\to\mathbb{R}^m. Its values depend jointly on all input variables, so it encodes surfaces, fields, and transformations rather than mere curves. Used across calculus, physics, economics, machine learning, and engineering wherever a quantity depends on more than one independent variable. Studied systematically since the 18th–19th centuries (Euler, Cauchy, Jacobi, Weierstrass).

💡 The Core Insight

The central conceptual leap from one variable to many is that there is no single "rate of change": variation depends on the direction in which you move. A scalar field over Rn\mathbb{R}^n has infinitely many directional derivatives at each point, organized by a single linear object—the gradient or, more generally, the derivative (Jacobian) matrix. Local behavior is governed by linear approximation in all directions at once, and limits must respect every path of approach, not just coordinate lines.

Formal Statement

DefinitionMultivariable Function

Let D⊆RnD\subseteq\mathbb{R}^n be nonempty. A multivariable function is a rule

1
f:D⊆Rn→Rm,x=(x1,…,xn)↦f(x)=(f1(x),…,fm(x))\quad f: D\subseteq\mathbb{R}^n \to \mathbb{R}^m,\qquad \mathbf{x}=(x_1,\dots,x_n)\mapsto f(\mathbf{x})=\big(f_1(\mathbf{x}),\dots,f_m(\mathbf{x})\big)

Derivation hint: a function is a set of ordered pairs (x,y)(\mathbf{x},\mathbf{y}) with x∈D\mathbf{x}\in D, y∈Rm\mathbf{y}\in\mathbb{R}^m, in which each x\mathbf{x} appears at most once; the component form follows by projecting onto coordinates. Here:

  • nn = number of independent variables (dimension of the domain),
  • mm = number of output components (dimension of the codomain),
  • each fi:D→Rf_i:D\to\mathbb{R} is a scalar component function,
  • the range is {f(x):x∈D}⊆Rm\{f(\mathbf{x}):\mathbf{x}\in D\}\subseteq\mathbb{R}^m.

When m=1m=1, ff is a scalar field and its graph is the set

2
Γf={(x,f(x))∈Rn+1:x∈D}\quad \Gamma_f=\{(\mathbf{x},f(\mathbf{x}))\in\mathbb{R}^{n+1}:\mathbf{x}\in D\}

Derivation hint: replace the last output coordinate of the codomain Rn+1\mathbb{R}^{n+1} with the function value; this generalizes y=f(x)y=f(x) to a hypersurface of dimension nn.

DefinitionLevel Sets

For a scalar field f:D→Rf:D\to\mathbb{R} and constant c∈Rc\in\mathbb{R}, the level set at value cc is

3
Lc=f−1({c})={x∈D:f(x)=c}\quad L_c=f^{-1}(\{c\})=\{\mathbf{x}\in D : f(\mathbf{x})=c\}

Derivation hint: take the preimage of a single point under ff; in R2\mathbb{R}^2 this is a level curve (contour), in R3\mathbb{R}^3 a level surface.

DefinitionLimit of a Multivariable Function

Let a\mathbf{a} be a limit point of DD. We write lim⁡x→af(x)=L\lim_{\mathbf{x}\to\mathbf{a}}f(\mathbf{x})=\mathbf{L} if

4
∀ε>0 ∃δ>0: 0<∥x−a∥<δ, x∈D  ⟹  ∥f(x)−L∥<ε\quad \forall\varepsilon>0\ \exists\delta>0:\ 0<\|\mathbf{x}-\mathbf{a}\|<\delta,\ \mathbf{x}\in D \implies \|f(\mathbf{x})-\mathbf{L}\|<\varepsilon

Derivation hint: replace absolute values in the single-variable ε\varepsilon–δ\delta definition by the Euclidean norm ∥⋅∥\|\cdot\|; the punctured ball of radius δ\delta must lie entirely inside DD's relevant neighborhood for every direction simultaneously.

TheoremContinuity and Component Decomposition

A function f:D→Rmf:D\to\mathbb{R}^m is continuous at a∈D\mathbf{a}\in D if and only if every component function fif_i is continuous at a\mathbf{a}. Moreover lim⁡x→af(x)=L\lim_{\mathbf{x}\to\mathbf{a}}f(\mathbf{x})=\mathbf{L} iff lim⁡x→afi(x)=Li\lim_{\mathbf{x}\to\mathbf{a}}f_i(\mathbf{x})=L_i for each ii. The vector limit (when it exists) is unique and must agree along every path approaching a\mathbf{a}.

ProofComponent Reduction of Limits

We show vector convergence is equivalent to coordinatewise convergence. 1. Forward direction. Suppose lim⁡x→af(x)=L\lim_{\mathbf{x}\to\mathbf{a}}f(\mathbf{x})=\mathbf{L}. For each ii, the projection πi(y)=yi\pi_i(\mathbf{y})=y_i satisfies ∣yi−Li∣≤∥y−L∥|y_i-L_i|\le\|\mathbf{y}-\mathbf{L}\|. Hence given ε>0\varepsilon>0, the same δ\delta from [4][4] forces ∣fi(x)−Li∣≤∥f(x)−L∥<ε|f_i(\mathbf{x})-L_i|\le\|f(\mathbf{x})-\mathbf{L}\|<\varepsilon. 2. Reverse direction. Suppose each fi→Lif_i\to L_i. Given ε>0\varepsilon>0, choose δi\delta_i so ∣fi(x)−Li∣<ε/m|f_i(\mathbf{x})-L_i|<\varepsilon/\sqrt{m} on the punctured δi\delta_i-ball. Let δ=min⁡iδi\delta=\min_i\delta_i. 3. Then on the punctured δ\delta-ball,

5
∥f(x)−L∥=(∑i=1m∣fi(x)−Li∣2)1/2<(∑i=1mε2m)1/2=ε\quad \|f(\mathbf{x})-\mathbf{L}\| = \Big(\sum_{i=1}^m |f_i(\mathbf{x})-L_i|^2\Big)^{1/2} < \Big(\sum_{i=1}^m \tfrac{\varepsilon^2}{m}\Big)^{1/2}=\varepsilon

Derivation hint: square and sum the componentwise bounds, then take the square root; the bound ε/m\varepsilon/\sqrt m is chosen precisely so the sum of mm terms collapses to ε2\varepsilon^2. 4. Uniqueness follows from the Hausdorff property of Rm\mathbb{R}^m: two distinct limits L≠L′\mathbf{L}\ne\mathbf{L}' would force ∥f(x)−L∥\|f(\mathbf{x})-\mathbf{L}\| and ∥f(x)−L′∥\|f(\mathbf{x})-\mathbf{L}'\| both below ∥L−L′∥/2\|\mathbf{L}-\mathbf{L}'\|/2, contradicting the triangle inequality. ■\blacksquare

∎
DefinitionDirectional Derivative and Gradient

For scalar ff, the directional derivative at a\mathbf{a} along a unit vector u\mathbf{u} is

6
Duf(a)=lim⁡t→0f(a+tu)−f(a)t\quad D_{\mathbf{u}}f(\mathbf{a})=\lim_{t\to 0}\frac{f(\mathbf{a}+t\mathbf{u})-f(\mathbf{a})}{t}

Derivation hint: restrict ff to the line t↦a+tut\mapsto\mathbf{a}+t\mathbf{u}, producing a one-variable function whose ordinary derivative at t=0t=0 is Duf(a)D_{\mathbf u}f(\mathbf a). The gradient collects all first partials, and for differentiable ff,

7
∇f(a)=(∂f∂x1,…,∂f∂xn)∣a,Duf(a)=∇f(a)⋅u\quad \nabla f(\mathbf{a})=\Big(\tfrac{\partial f}{\partial x_1},\dots,\tfrac{\partial f}{\partial x_n}\Big)\Big|_{\mathbf{a}},\qquad D_{\mathbf{u}}f(\mathbf{a})=\nabla f(\mathbf{a})\cdot\mathbf{u}

Derivation hint: apply the multivariable chain rule to g(t)=f(a+tu)g(t)=f(\mathbf{a}+t\mathbf{u}); g′(0)=∑i∂if uig'(0)=\sum_i \partial_i f\, u_i, which is the dot product.

TheoremBest Linear Approximation / Differentiability

f:D→Rmf:D\to\mathbb{R}^m is differentiable at an interior point a\mathbf{a} if there exists a linear map Df(a)∈Rm×nDf(\mathbf{a})\in\mathbb{R}^{m\times n} (the Jacobian) with

8
lim⁡h→0∥f(a+h)−f(a)−Df(a) h∥∥h∥=0\quad \lim_{\mathbf{h}\to\mathbf{0}}\frac{\big\|f(\mathbf{a}+\mathbf{h})-f(\mathbf{a})-Df(\mathbf{a})\,\mathbf{h}\big\|}{\|\mathbf{h}\|}=0

Derivation hint: this demands the error of the affine approximation f(a)+Df(a)hf(\mathbf a)+Df(\mathbf a)\mathbf h vanish faster than ∥h∥\|\mathbf h\|; it is the exact multivariable analogue of f(a+h)=f(a)+f′(a)h+o(h)f(a+h)=f(a)+f'(a)h+o(h). The Jacobian entries are the partials [Df(a)]ij=∂fi/∂xj[Df(\mathbf{a})]_{ij}=\partial f_i/\partial x_j. Existence of all partials does not imply differentiability, but if the partials exist and are continuous near a\mathbf{a}, then ff is differentiable there (C1⇒C^1\Rightarrow differentiable).

mathematician · Augustin-Louis Cauchy | 1789–1857

Cauchy gave the modern rigorous footing for limits, continuity, and convergence that multivariable analysis rests upon. His insistence on the ε\varepsilon–δ\delta spirit (later formalized by Weierstrass) turned vague talk of "infinitely small" multivariable increments into precise statements. Cauchy also contributed foundational results on systems of functions and the determinant theory that underlies the Jacobian, the key object measuring how a multivariable map distorts volume locally.

Building Intuition

🧠 Intuition

Picture a scalar field f(x,y)f(x,y) as a landscape: the height above each point (x,y)(x,y) is the function value. The graph [2][2] is the terrain surface. Level curves [3][3] are the contour lines on a topographic map—walking along one keeps your altitude fixed. The gradient [7][7] points in the direction of steepest ascent, and its magnitude tells you how steep. Crucially, the gradient is always perpendicular to the level curve through your point: along a contour the height doesn't change, so the "uphill" arrow can have no component tangent to it. For a vector field f:R2→R2f:\mathbb{R}^2\to\mathbb{R}^2, drop the landscape picture and imagine an arrow attached to every point—like wind velocity over a map. The Jacobian [8][8] then tells you how a tiny disk of points near a\mathbf{a} gets stretched, rotated, and sheared into a tiny ellipse near f(a)f(\mathbf{a}).

Figure
Graph, level curves, and gradient of f(x,y)=x2+y2f(x,y)=x^2+y^2
Level curves of f(x,y)=x²+y² with gradient arrow x y f=c (level curve) c↑ ∇f (steepest ascent) a tangent ⟂ ∇f
TF
The Field Picture

Physicists meet multivariable functions as fields. A scalar field like temperature T(x,y,z)T(x,y,z) or electric potential V(r)V(\mathbf r) assigns one number to each point of space; its gradient −∇V=E-\nabla V=\mathbf E gives the electric field, a vector field. The recurring theme is that physical laws are statements about how fields vary in space and time: ∇⋅E\nabla\cdot\mathbf E, ∇×B\nabla\times\mathbf B, and ∇2ϕ\nabla^2\phi all package directional rates of change of multivariable functions. The Jacobian's determinant appears when changing coordinates in integrals (e.g., to spherical coordinates) and measures local volume scaling.

Worked Examples

ExampleComputing a Gradient and Steepest-Ascent Rate

Given: f(x,y)=x2y+3yf(x,y)=x^2 y + 3y (a dimensionless potential), evaluate at a=(2,1)\mathbf{a}=(2,1), and find the maximum rate of increase and its direction.

Steps: 1. Partials: ∂f∂x=2xy\dfrac{\partial f}{\partial x}=2xy, ∂f∂y=x2+3\dfrac{\partial f}{\partial y}=x^2+3. 2. At (2,1)(2,1): ∂xf=2(2)(1)=4\partial_x f = 2(2)(1)=4, ∂yf=4+3=7\partial_y f = 4+3=7. 3. Gradient: ∇f(2,1)=(4,7)\nabla f(2,1)=(4,7) via [7][7]. 4. Maximum directional derivative equals ∥∇f∥\|\nabla f\| (achieved when u∥∇f\mathbf u\parallel\nabla f):

9
max⁡∥u∥=1Duf=∥∇f(2,1)∥=42+72=65\quad \max_{\|\mathbf u\|=1} D_{\mathbf u}f = \|\nabla f(2,1)\| = \sqrt{4^2+7^2}=\sqrt{65}

Derivation hint: Duf=∇f⋅u=∥∇f∥cos⁡θD_{\mathbf u}f=\nabla f\cdot\mathbf u=\|\nabla f\|\cos\theta is maximized at θ=0\theta=0, giving ∥∇f∥\|\nabla f\|. 5. Unit direction of steepest ascent: u∗=165(4,7)\mathbf u^*=\tfrac{1}{\sqrt{65}}(4,7).

Answer: ∇f(2,1)=(4,7),max rate=65≈8.06 (units of f per unit length),u∗=165(4,7)\boxed{\nabla f(2,1)=(4,7),\quad \text{max rate}=\sqrt{65}\approx 8.06\ \text{(units of }f\text{ per unit length)},\quad \mathbf u^*=\tfrac{1}{\sqrt{65}}(4,7)}

ExampleA Limit That Fails (Path Dependence)

Given: f(x,y)=xyx2+y2f(x,y)=\dfrac{xy}{x^2+y^2} for (x,y)≠(0,0)(x,y)\ne(0,0). Does lim⁡(x,y)→(0,0)f\lim_{(x,y)\to(0,0)}f exist?

Steps: 1. Along y=0y=0: f(x,0)=0/x2=0f(x,0)=0/x^2=0, so the limit along the xx-axis is 00. 2. Along x=0x=0: f(0,y)=0f(0,y)=0 likewise gives 00. 3. Along y=xy=x: f(x,x)=x22x2=12f(x,x)=\dfrac{x^2}{2x^2}=\dfrac12 for all x≠0x\ne0. 4. Compute the candidate values:

10
lim⁡x→0f(x,0)=0 ≠ 12=lim⁡x→0f(x,x)\quad \lim_{x\to0}f(x,0)=0 \ \ne\ \tfrac12=\lim_{x\to0}f(x,x)

Derivation hint: substitute the path equation into ff to reduce it to a single-variable limit; differing path limits violate uniqueness from the <span class="wiki-link-missing">Continuity and Component Decomposition</span> theorem. 5. Because two paths give different values, the joint limit cannot exist.

Answer: The limit does not exist; f is discontinuous at (0,0) regardless of how it is defined there.\boxed{\text{The limit does not exist; } f \text{ is discontinuous at } (0,0)\text{ regardless of how it is defined there.}}

Common Misconceptions

⚠️ Common mistake

Existence of all partial derivatives does NOT imply continuity or differentiability. Partials probe only the coordinate-axis directions. A function can have ∂xf\partial_x f and ∂yf\partial_y f defined everywhere yet not be continuous, let alone differentiable, at a point. The correct local linearization criterion is the limit [8][8], not the mere existence of partials. The reliable shortcut is the C1C^1 theorem: continuous partials guarantee differentiability.

CounterexamplePartials Exist, Function Is Discontinuous

Let

11
f(x,y)={xyx2+y2,(x,y)≠(0,0)0,(x,y)=(0,0)\quad f(x,y)=\begin{cases}\dfrac{xy}{x^2+y^2}, & (x,y)\ne(0,0)\\[2mm] 0,& (x,y)=(0,0)\end{cases}

Derivation hint: this is the function of [10][10] with the value 00 assigned at the origin. Both partials at the origin exist:

12
fx(0,0)=lim⁡t→0f(t,0)−0t=lim⁡t→00t=0,fy(0,0)=0\quad f_x(0,0)=\lim_{t\to0}\frac{f(t,0)-0}{t}=\lim_{t\to0}\frac{0}{t}=0,\qquad f_y(0,0)=0

Derivation hint: along each axis f≡0f\equiv0, so the difference quotient defining each partial is identically zero. Yet ff is not continuous at (0,0)(0,0), since the limit along y=xy=x is 12≠f(0,0)=0\tfrac12\ne f(0,0)=0. Existence of partials therefore fails to control behavior off the axes—the essential warning of multivariable calculus.

Connections

connection

Multivariable functions sit at the crossroads of analysis and geometry. The single-variable theory of Differentiation generalizes to the Jacobian Matrix and the differentiability criterion [8][8]. Integration extends to Multiple Integrals via Fubini's theorem, where the Change of Variables Theorem uses the Jacobian determinant. The directional structure [7][7] launches the study of Gradient Vector Fields, Divergence and Curl, and ultimately Vector Calculus. Level sets [3][3] connect to Implicit Function Theorem and the geometry of Manifolds. In optimization, ∇f=0\nabla f=\mathbf 0 characterizes critical points, linking to Lagrange Multipliers and the Hessian Matrix second-derivative test.

Real-World Applications

🔬 Where this appears

Historical Development

⏳ History
- 1667–1684: Newton and Leibniz develop single-variable calculus, laying the conceptual groundwork for rates of change later extended to many variables.
- 1734: Euler systematically studies functions of several variables and introduces notation for partial differentiation in mechanics and fluid problems.
- 1748: Euler's Introductio in analysin infinitorum treats functions abstractly, broadening the function concept beyond single inputs.
- 1797–1813: Lagrange develops the calculus of variations and the multiplier method for constrained multivariable optimization.
- 1821: Cauchy's Cours d'analyse gives rigorous limit and continuity definitions adaptable to multivariable settings.
- 1841: Jacobi publishes on functional determinants—the Jacobian—formalizing how multivariable maps transform volumes.
- 1854–1868: Riemann's work on manifolds and multivariable integration reframes functions on curved domains.
- 1870s: Weierstrass cements the ε\varepsilon–δ\delta formalism, and pathological examples (nowhere-differentiable, path-dependent limits) sharpen the distinction between partial and total differentiability.
- 1900s: Fréchet and others generalize differentiability to abstract normed spaces, with [8][8] as the template (the Fréchet derivative).

Subtleties & Limits

open-problem

While the theory of multivariable functions is classical and complete, practical and computational frontiers remain open. High-dimensional optimization (where nn is in the millions) is dominated by the geometry of saddle points and non-convex loss landscapes, whose structure is not fully understood. The behavior of generic smooth functions in very high dimensions—where almost all critical points are saddles and the curse of dimensionality makes sampling intractable—drives active research in optimization theory and statistics. Even classifying singularities of smooth maps Rn→Rm\mathbb R^n\to\mathbb R^m (catastrophe and singularity theory, following Whitney and Thom) yields rich, still-expanding taxonomies, and questions about the regularity of solutions to nonlinear PDEs involving multivariable fields (e.g., Navier–Stokes smoothness) remain among the deepest unsolved problems in mathematics.

See Also

Partial Derivatives · Gradient Vector Fields · Jacobian Matrix · Chain Rule (Multivariable) · Implicit Function Theorem · Hessian Matrix · Vector Calculus · Change of Variables Theorem