Skip to content
JRF DeskUGC NET, PhD, JRF & SET

Economics · Unit 4

Mathematical Economics

Revision notes (21 min read), then 33 real questions from UGC NET papers, 2 of them with an official key we dispute.

Official syllabus · Unit 4

  • Sets, functions and continuity, sequence, series
  • Differential calculus and its applications
  • Linear algebra: matrices, vector spaces
  • Static optimisation problems and their applications
  • Input–output model, linear programming
  • Difference and differential equations with applications

Verbatim from the UGC NET Bureau syllabus.

How often it is asked

PaperQuestions
December 20257 Jan 20266 / 100
June 202529 Jun 20259 / 100
June 2024 (re-exam)28 Aug 20247 / 100
December 202312 Dec 202311 / 100

Average 8.3 questions (17 marks) per paper. Unit tagging is ours.

Scope: sets and functions, calculus and its economic uses, matrices and vector spaces, constrained and unconstrained optimisation, Leontief input-output, linear programming, and difference/differential equations — with stability conditions.


1. Sets, Functions and Continuity, Sequence, Series

Sets

  • A ∪ B (union), A ∩ B (intersection), A − B (difference), Aᶜ (complement).
  • De Morgan's laws: (A ∪ B)ᶜ = Aᶜ ∩ Bᶜ and (A ∩ B)ᶜ = Aᶜ ∪ Bᶜ.
  • n(A ∪ B) = n(A) + n(B) − n(A ∩ B).
  • A set with n elements has 2ⁿ subsets (its power set) and 2ⁿ − 1 proper subsets.
  • Cartesian product A × B has n(A)·n(B) ordered pairs.
  • Convex set: contains the whole line segment between any two of its points. The intersection of convex sets is convex; a union need not be. Budget sets and LP feasible regions are convex.

Relations and functions

  • A function maps each element of the domain to exactly one element of the range.
  • One-to-one (injective), onto (surjective), bijective (both) — an inverse function exists only if the function is bijective.
  • Strictly monotonic functions have inverses.
  • Types: constant, polynomial (linear, quadratic, cubic), rational (the AFC curve, xy = c, is a rectangular hyperbola), exponential, logarithmic.

Limits and continuity

  • f is continuous at x = a if three conditions hold: (i) f(a) is defined; (ii) lim f(x) as x → a exists (the left limit equals the right limit); (iii) the limit equals f(a).
  • Polynomials are continuous everywhere. Rational functions are continuous except where the denominator is zero.
  • Differentiability ⇒ continuity, but not conversely. Example: |x| is continuous but not differentiable at x = 0 (a kink).
  • Standard limits: lim (1 + 1/n)ⁿ = e as n → ∞; lim (eˣ − 1)/x = 1 as x → 0.
  • L'Hôpital's rule applies to the indeterminate forms 0/0 and ∞/∞.

Sequences and series

nth termSum of n termsInfinite sum
AP (arithmetic)a + (n − 1)d(n/2)[2a + (n − 1)d]diverges (d ≠ 0)
GP (geometric)arⁿ⁻¹a(1 − rⁿ)/(1 − r)a/(1 − r), only if |r| < 1
  • A sequence converges if it has a finite limit. A series converges if its sequence of partial sums converges.
  • Necessary condition for a series to converge: the nth term → 0. This is not sufficient: the harmonic series Σ1/n diverges.
  • The p-series Σ1/nᵖ converges if and only if p > 1.
  • Tests for convergence: ratio test (D'Alembert), root test (Cauchy), comparison test.
  • Economic uses of the GP:
    • Keynesian multiplier: 1 + c + c² + … = 1/(1 − c) = 1/MPS.
    • Credit (money) multiplier: 1/r.
    • Present value of a perpetuity: A/i.
    • Compound interest: A = P(1 + r)ⁿ. With continuous compounding: A = Pe^(rt).

Commonly tested: 2ⁿ subsets. Differentiable ⇒ continuous (not the converse; |x| at 0 is the counter-example). An infinite GP converges iff |r| < 1. The multiplier is a GP sum. A convex set contains the line segment between any two of its points.


2. Differential Calculus and its Applications

Derivative rules

  • Power: d(xⁿ)/dx = nxⁿ⁻¹.
  • Product: (uv)′ = u′v + uv′.
  • Quotient: (u/v)′ = (u′v − uv′)/v².
  • Chain: dy/dx = (dy/du)(du/dx).
  • Exponential and log: d(eˣ)/dx = eˣ; d(aˣ)/dx = aˣ ln a; d(ln x)/dx = 1/x.
  • Inverse function: dx/dy = 1/(dy/dx).

Partial and total derivatives

  • Partial derivative fₓ: change one variable, holding the others constant.
  • Young's theorem: f_xy = f_yx (for twice continuously differentiable functions).
  • Total differential: dz = fₓdx + f_y dy.
  • Implicit function rule: dy/dx = −Fₓ/F_y. Slope of an indifference curve or isoquant: MRS = −dy/dx = MUₓ/MU_y; MRTS = MP_L/MP_K.

Elasticity via derivatives

  • Point elasticity: ε = (dQ/dP)(P/Q) = d ln Q / d ln P.
  • For y = axᵇ, the elasticity is constant and equal to b. A rectangular hyperbola (PQ = k) has unit elasticity everywhere.
  • Linear demand: e = (lower segment)/(upper segment). e = 1 at the midpoint, ∞ at the price axis, 0 at the quantity axis.
  • MR = AR(1 − 1/|e|) (Mrs Robinson's formula; Joan Robinson 1933). TR is maximised where |e| = 1, i.e. MR = 0. A monopolist never produces where demand is inelastic.
  • Elasticity of a product: e(uv) = e(u) + e(v). Elasticity of a quotient: e(u/v) = e(u) − e(v).
  • Growth rate: d ln y/dt = ẏ/y. The growth rate of a product is the sum of the growth rates.

Marginal–average relations

  • MC = dTC/dQ. d(AC)/dQ = (MC − AC)/Q, so MC cuts AC at the minimum of AC. The same holds for MP and AP.
  • When the average is falling, the marginal is below it. AVC is minimised where MC = AVC.

Applications

  • Profit maximisation: MR = MC (first-order condition) and dMC/dQ > dMR/dQ (second-order condition: MC cuts MR from below).
  • Effect of taxes: a per-unit tax raises MC; a lump-sum tax leaves output unchanged.
  • Comparative statics via derivatives.

Commonly tested: For y = axᵇ the elasticity is b. MR = AR(1 − 1/e). MC = AC at minimum AC. Young's theorem f_xy = f_yx. MRS = ratio of marginal utilities.


3. Linear Algebra — Matrices, Vector Spaces

Matrices

  • (AB)′ = B′A′; (AB)⁻¹ = B⁻¹A⁻¹. Matrix multiplication is not commutative in general.
  • A is symmetric if A = A′; idempotent if A² = A (e.g. the OLS matrices M = I − X(X′X)⁻¹X′ and P = X(X′X)⁻¹X′; the eigenvalues of an idempotent matrix are 0 or 1, and its rank equals its trace); orthogonal if A′A = I.
  • A singular matrix has |A| = 0; then no inverse exists. A⁻¹ = adj(A)/|A|.

Determinant properties

  • |A′| = |A|.
  • Interchanging two rows changes the sign.
  • Two identical (or proportional) rows → |A| = 0.
  • Multiplying one row by k multiplies |A| by k; |kA| = kⁿ|A| for an n×n matrix.
  • Adding a multiple of one row to another leaves |A| unchanged.
  • |AB| = |A||B|; |A⁻¹| = 1/|A|.
  • The determinant of a triangular matrix is the product of its diagonal elements.
  • Laplace expansion by cofactors.

Rank

  • Rank = the maximum number of linearly independent rows, which equals the maximum number of independent columns. Equivalently, the order of the largest non-zero minor.
  • ρ(A) ≤ min(m, n). An n×n matrix is non-singular iff its rank is n.
  • Rank is unchanged by elementary row operations.

System Ax = b

  • Consistent iff ρ(A) = ρ[A|b] (Rouché–Capelli).
  • Unique solution iff this common rank = n (the number of unknowns). Infinitely many solutions if the rank < n.
  • The homogeneous system Ax = 0 has a non-trivial solution iff |A| = 0.

Cramer's rule (Cramer, 1750): xⱼ = |Aⱼ|/|A|, where Aⱼ is A with column j replaced by b. Valid only if |A| ≠ 0. Example: 2x + y = 5, x + 3y = 10. |A| = 5, |A₁| = 15 − 10 = 5, |A₂| = 20 − 5 = 15. So x = 1, y = 3.

Eigenvalues (characteristic roots)

  • Solve |A − λI| = 0.
  • Σλᵢ = trace(A); Πλᵢ = |A|.
  • A has a zero eigenvalue iff A is singular.
  • The eigenvalues of a symmetric matrix are real. The eigenvalues of a triangular matrix are its diagonal entries.
  • The eigenvalues of A⁻¹ are 1/λ.
  • Example: A = [[2, 1], [1, 2]] gives λ = 1, 3 (trace 4, determinant 3).

Quadratic forms q = x′Ax (A symmetric)

DefinitenessEigenvaluesLeading principal minors
Positive definiteall > 0|D₁| > 0, |D₂| > 0, |D₃| > 0, …
Negative definiteall < 0alternate in sign: |D₁| < 0, |D₂| > 0, |D₃| < 0, …
Positive or negative semidefinite≥ 0 or ≤ 0test all principal minors, not just the leading ones
Indefinitemixed signs—

Vector spaces

  • A vector space is closed under addition and scalar multiplication.
  • Vectors are linearly independent if c₁v₁ + … + cₖvₖ = 0 implies all cᵢ = 0. n vectors in ℝⁿ are independent iff their determinant is non-zero. More than n vectors in ℝⁿ are always dependent.
  • Basis: an independent spanning set. Dimension = the number of vectors in a basis; ℝⁿ has dimension n.
  • Inner product: u·v = 0 means u and v are orthogonal.
  • Rank–nullity theorem: rank + nullity = n (the number of columns).
  • Subspace test: contains 0 and is closed under addition and scalar multiplication.

Commonly tested: trace = Σλ and |A| = Πλ. Cramer's rule needs |A| ≠ 0. |kA| = kⁿ|A|. Idempotent → λ ∈ {0, 1}. Positive definite ⇔ all leading principal minors > 0.


4. Static Optimization Problems and their Applications

One variable

  • First-order condition f′(x) = 0. Second-order condition: f″ < 0 → maximum; f″ > 0 → minimum.
  • If f″ = 0, use higher derivatives: the first non-zero derivative of even order decides; an odd order means a point of inflection.
  • Concave f (f″ ≤ 0) → a local maximum is the global maximum.

Two or more variables (unconstrained)

  • First-order conditions: fₓ = f_y = 0.
  • Hessian H = [[fₓₓ, fₓ_y], [f_yₓ, f_yy]].
  • Maximum: fₓₓ < 0 and |H| = fₓₓf_yy − fₓ_y² > 0 (H negative definite).
  • Minimum: fₓₓ > 0 and |H| > 0 (H positive definite).
  • Saddle point: |H| < 0.
  • With n variables: for a maximum, the leading principal minors alternate in sign starting negative (|H₁| < 0, |H₂| > 0, …); for a minimum, they are all positive.
  • Applications: a multiproduct firm; price discrimination (MR₁ = MR₂ = MC, with the higher price in the market with less elastic demand).

Constrained optimisation (Lagrange)

  • Maximise f(x, y) subject to g(x, y) = c. Form L = f(x, y) + λ[c − g(x, y)].
  • First-order conditions: Lₓ = L_y = L_λ = 0, which give fₓ/gₓ = f_y/g_y (tangency).
  • Bordered Hessian |H̄| = |[[0, gₓ, g_y], [gₓ, Lₓₓ, Lₓ_y], [g_y, L_yₓ, L_yy]]|.
    • Two variables, one constraint: |H̄| > 0 → maximum; |H̄| < 0 → minimum.
    • n variables: for a maximum, |H̄₂| > 0, |H̄₃| < 0, … (alternate signs); for a minimum, all |H̄ᵢ| < 0.
  • Interpretation of λ: λ* = ∂f*/∂c (envelope theorem). It is the shadow price of the constraint — the marginal value of relaxing it by one unit.
    • In utility maximisation, λ = marginal utility of money (income).
    • In cost minimisation, λ = marginal cost.

Worked example: maximise U = xy subject to 2x + 4y = 40.

  • First-order conditions: y = 2λ and x = 4λ, so x = 2y. Then 4y + 4y = 40, so y = 5 and x = 10.
  • λ = 2.5 and U* = 50.
  • Check: the indirect utility function is U* = M²/(4PₓP_y) = M²/32, so dU*/dM = 2M/32 = 80/32 = 2.5 = λ. ✓

Quasi-concavity: a function is quasi-concave if its upper-contour sets are convex (convex-to-origin indifference curves). For a maximum it is sufficient that the objective is quasi-concave and the constraint is linear. Concave ⇒ quasi-concave, but not conversely.

Kuhn–Tucker conditions (Kuhn & Tucker, 1951; Karush 1939), for inequality constraints. Maximise f(x) subject to gᵢ(x) ≤ cᵢ and x ≥ 0, with L = f + Σλᵢ(cᵢ − gᵢ):

  • ∂L/∂xⱼ ≤ 0, xⱼ ≥ 0, and xⱼ·∂L/∂xⱼ = 0.
  • ∂L/∂λᵢ ≥ 0, λᵢ ≥ 0, and λᵢ·∂L/∂λᵢ = 0.

These are complementary slackness conditions: if a constraint is not binding, its λ = 0; if λ > 0, the constraint binds. They are sufficient when f is concave and the constraint set is convex (Arrow–Enthoven 1961 extend this to quasi-concave programming). A constraint qualification is needed for necessity. Applications: peak-load pricing, rationing.

Homogeneous functions and Euler's theorem

  • f is homogeneous of degree n if f(tx, ty) = tⁿf(x, y).
  • If f is homogeneous of degree n, its partial derivatives are homogeneous of degree n − 1.
  • Euler's theorem: x·fₓ + y·f_y = n·f.
  • With constant returns to scale (n = 1): L·MP_L + K·MP_K = Q. Paying each factor its marginal product exactly exhausts output — the adding-up / product-exhaustion problem (Wicksteed 1894; Euler's theorem applied).
  • For linearly homogeneous functions, MP and AP depend only on the K/L ratio, and isoquants are radial blow-ups of one another.
  • Homothetic = a monotonic transformation of a homogeneous function; along any ray, the MRTS is constant.

Cobb–Douglas (Cobb & Douglas, 1928): Q = AL^α K^β.

  • Homogeneous of degree α + β: = 1 is CRS, > 1 IRS, < 1 DRS.
  • α and β are the output elasticities. Under CRS and competitive factor pricing, they are also the factor shares.
  • MP_L = αQ/L. MRTS = (α/β)(K/L).
  • Elasticity of substitution σ = 1.
  • Linear in logs (estimable by OLS). Isoquants are convex and asymptotic to the axes.

CES (Arrow, Chenery, Minhas & Solow, 1961): Q = A[δK^(−ρ) + (1 − δ)L^(−ρ)]^(−v/ρ).

  • A = efficiency parameter; δ = distribution parameter; ρ = substitution parameter (ρ ≥ −1); v = degree of homogeneity (returns to scale).
  • σ = 1/(1 + ρ).
  • Limiting cases:
    • ρ → 0: σ → 1 (Cobb–Douglas).
    • ρ → ∞: σ → 0 (Leontief fixed proportions, L-shaped isoquants).
    • ρ = −1: σ = ∞ (linear, perfect substitutes).
  • σ is constant but need not equal 1. CD and Leontief are special cases.
  • Definition: σ = d ln(K/L)/d ln(MRTS) (Hicks, 1932).

Commonly tested

  • Bordered Hessian > 0 → constrained maximum (2 variables, 1 constraint).
  • λ = shadow price = marginal utility of money.
  • K–T → complementary slackness.
  • Euler's theorem → adding-up (Wicksteed).
  • CD: σ = 1. CES: σ = 1/(1 + ρ), ACMS 1961.
  • Unconstrained maximum: fₓₓ < 0 and fₓₓf_yy > fₓ_y².

5. Input-Output Model, Linear Programming

Leontief input-output (Leontief 1936 RES "Quantitative input and output relations…"; Structure of American Economy 1941; Nobel 1973)

Assumptions:

  • Each industry produces one homogeneous good.
  • Fixed input coefficients (constant returns, no substitution).
  • No joint products.
  • No external economies.

Technical coefficient: aᵢⱼ = xᵢⱼ/Xⱼ — the input from industry i needed per rupee (unit) of output of industry j.

Open model: final demand is exogenous.

  • X = AX + d ⇒ (I − A)X = d ⇒ X = (I − A)⁻¹d.
  • (I − A) is the Leontief matrix; (I − A)⁻¹ is the Leontief inverse (the matrix of multipliers).
  • Column sums of A (in value terms) < 1 → each sector creates positive value added, and the system is viable.
  • Primary input (labour) requirement: L = Σa₀ⱼXⱼ.

Hawkins–Simon conditions (Hawkins & Simon, 1949, Econometrica):

  • All leading principal minors of (I − A) must be positive.
  • For 2×2: 1 − a₁₁ > 0 and |I − A| > 0. Economically: each sector uses less than one unit of its own output to produce one unit, and the system as a whole is productive.
  • These conditions guarantee a non-negative solution X ≥ 0 for any d ≥ 0.

Example: A = [[0.2, 0.3], [0.4, 0.1]], d = (10, 20).

  • |I − A| = 0.8 × 0.9 − 0.3 × 0.4 = 0.60 > 0, and 0.8 > 0, so the H–S conditions hold.
  • X = (1/0.6)[[0.9, 0.3], [0.4, 0.8]]·d = (25, 33.33).
  • Check: X₁ = 0.2(25) + 0.3(33.33) + 10 = 25 ✓.

Closed model: households are treated as an industry (labour is the output and consumption the input); there is no exogenous final demand.

  • (I − A)X = 0 needs a non-trivial solution, so |I − A| = 0.
  • Only relative outputs are determined.

Other links: the dynamic Leontief model (adds a capital matrix); the Leontief paradox (1953, trade).

Linear programming

  • Kantorovich (1939); Dantzig's simplex method (1947); Koopmans' activity analysis; Dorfman–Samuelson–Solow (1958) Linear Programming and Economic Analysis.
  • Components: an objective function, constraints, and non-negativity. The feasible region is a convex polyhedron.
  • Fundamental theorem: if an optimum exists, it occurs at an extreme point (vertex) — a basic feasible solution.
  • Simplex method:
    • Add slack variables (≤ constraints) or surplus and artificial variables (≥ constraints; Big-M or two-phase method).
    • Basic variables = the number of constraints (m); non-basic variables are set to 0.
    • Entering variable: the most negative Cⱼ − Zⱼ (maximisation, standard convention). Leaving variable: the minimum ratio test. The pivot element is where they meet.
    • Optimality for maximisation: all Cⱼ − Zⱼ ≤ 0.
  • Special cases:
    • Degeneracy: a basic variable = 0 (can cause cycling).
    • Unbounded solution: no positive ratio in the minimum ratio test.
    • Infeasible: an artificial variable stays in the final basis.
    • Multiple optima: a non-basic variable has Cⱼ − Zⱼ = 0.
  • Duality:
    • Primal: max c′x s.t. Ax ≤ b, x ≥ 0. Dual: min b′y s.t. A′y ≥ c, y ≥ 0.
    • Dual of the dual = the primal.
    • Each primal constraint corresponds to a dual variable (a shadow price / imputed value of the resource).
    • Weak duality: any feasible primal objective ≤ any feasible dual objective.
    • Duality theorem (von Neumann 1947; Gale–Kuhn–Tucker 1951): if either problem has a finite optimum, so does the other, and max c′x = min b′y. If the primal is unbounded, the dual is infeasible.
  • Complementary slackness:
    • If a primal constraint is slack (a resource is not fully used), its dual price = 0 (a free good).
    • If a dual variable > 0, the corresponding constraint binds.
    • Likewise, if xⱼ > 0, the j-th dual constraint holds with equality (the imputed cost of the activity = its profit, so no activity earns a surplus).

Commonly tested: Hawkins–Simon → all leading principal minors of (I − A) > 0. Closed model → |I − A| = 0. Simplex → Dantzig 1947. Optimum at a corner point. Dual variables = shadow prices. Complementary slackness: a slack constraint has a zero shadow price. The dual of a max problem is a min problem.


6. Difference and Differential Equations with Applications

First-order linear difference equation (discrete time; Chiang & Wainwright notation)

yₜ₊₁ + a·yₜ = c

  • Solution (a ≠ −1): yₜ = y₀ − c/(1 + a)ᵗ + c/(1 + a). The particular solution (intertemporal equilibrium) is ȳ = c/(1 + a).
  • Let b = −a. The time path depends on b:
bTime path
b > 1explodes, non-oscillating
b = 1stays at the same distance from equilibrium
0 < b < 1converges, non-oscillating
−1 < b < 0damped oscillation (converges)
b = −1uniform oscillation
b < −1explosive oscillation

Convergence iff |b| < 1. Oscillation iff b < 0.

Cobweb model (Kaldor 1934, Ezekiel 1938; agricultural markets):

  • Qdₜ = α − βPₜ; Qsₜ = −γ + δPₜ₋₁ (supply responds to the previous period's price); β, δ > 0.
  • Market clearing gives Pₜ = (−δ/β)Pₜ₋₁ + (α + γ)/β. Equilibrium P* = (α + γ)/(β + δ).
  • Since b = −δ/β < 0, the path always oscillates:
    • δ < β → convergent. The supply curve is steeper than the demand curve (in the usual P–Q diagram); equivalently, |slope of supply| > |slope of demand|.
    • δ = β → uniform oscillation (continuous cycles).
    • δ > β → explosive oscillation.

Example: Qd = 18 − 4Pₜ, Qs = −3 + 3Pₜ₋₁. Then Pₜ = −0.75Pₜ₋₁ + 5.25, P* = 3, and the path is a damped oscillation.

Other discrete-time models: Samuelson's multiplier–accelerator (1939) is a second-order difference equation; Harrod's growth model in discrete form; lagged income determination Yₜ = cYₜ₋₁ + A, which is stable iff 0 < c < 1.

First-order linear differential equation (continuous time)

dy/dt + a·y = b

  • Solution (a ≠ 0): y(t) = [y(0) − b/a]e^(−at) + b/a.
  • Dynamically stable iff a > 0 (the complementary function → 0). There is no oscillation in a first-order continuous model.

Walrasian price adjustment (market stability):

  • Qd = α − βP; Qs = −γ + δP.
  • dP/dt = j(Qd − Qs), with j > 0: price rises when there is excess demand.
  • So dP/dt + j(β + δ)P = j(α + γ), giving P(t) = [P(0) − P*]e^(−j(β+δ)t) + P*, with P* = (α + γ)/(β + δ).
  • Stable iff β + δ > 0. This holds with a normal (downward) demand curve and an upward supply curve. It can still hold with a downward-sloping supply curve, as long as the supply curve is steeper than the demand curve.
  • Contrast the Marshallian (quantity) adjustment, which depends on excess demand price.

Other continuous-time applications: the Domar growth model (dI/dt = sσI ⇒ I(t) = I(0)e^(sσt), with a warranted growth rate); the Solow model (k̇ = sf(k) − nk); exponential growth.

Second-order equations: use the characteristic roots. Complex roots → oscillation. In continuous time the system is stable iff the real parts are < 0; in discrete time, iff the modulus is < 1.

Commonly tested

  • Difference equation: stable iff |b| < 1, oscillating iff b < 0.
  • Differential equation: stable iff the exponent coefficient is negative (a > 0 in dy/dt + ay = b).
  • Cobweb converges when demand is more elastic than supply (supply steeper); continuous oscillation when the slopes are equal.
  • Walras stability: dP/dt = j·ED.
  • Samuelson multiplier–accelerator → 2nd-order difference equation.
  • Domar → differential equation.

Last-minute 20 facts

  1. n elements → 2ⁿ subsets. De Morgan: (A ∪ B)ᶜ = Aᶜ ∩ Bᶜ.
  2. Differentiable ⇒ continuous; |x| at 0 is continuous but not differentiable.
  3. Infinite GP sum = a/(1 − r) for |r| < 1; the multiplier is 1/(1 − c).
  4. Elasticity = d ln y/d ln x; for y = axᵇ it equals b.
  5. MR = AR(1 − 1/|e|); TR is maximised at |e| = 1.
  6. MC cuts AC (and AVC) at their minimum points.
  7. Σ eigenvalues = trace; Π eigenvalues = determinant.
  8. |kA| = kⁿ|A|; a singular matrix has no inverse; a zero eigenvalue ⇔ singular.
  9. Ax = b is consistent iff ρ(A) = ρ[A|b]; the solution is unique iff that rank = n.
  10. Cramer's rule xⱼ = |Aⱼ|/|A| (needs |A| ≠ 0).
  11. Unconstrained maximum: fₓₓ < 0 and fₓₓf_yy − fₓ_y² > 0.
  12. Bordered Hessian (2 variables, 1 constraint): |H̄| > 0 → maximum; < 0 → minimum.
  13. λ = ∂f*/∂c = shadow price; in utility maximisation it is the marginal utility of money.
  14. Kuhn–Tucker (1951): complementary slackness; a non-binding constraint has λ = 0.
  15. Euler: Σxᵢfᵢ = n·f; under CRS, factor payments exhaust the product.
  16. CD: σ = 1, exponents = output elasticities. CES (ACMS 1961): σ = 1/(1 + ρ); ρ → 0 gives CD, ρ → ∞ gives Leontief.
  17. Hawkins–Simon (1949): all leading principal minors of (I − A) > 0. Closed Leontief model: |I − A| = 0.
  18. LP: optimum at a vertex; simplex (Dantzig 1947); max c′x = min b′y at the optimum (duality theorem).
  19. Cobweb converges iff δ < β (supply steeper than demand); the path always oscillates.
  20. Walras dP/dt = j(Qd − Qs) is stable iff β + δ > 0; a first-order differential equation with dy/dt + ay = b is stable iff a > 0.

Sources

  • Chiang, A. C. & Wainwright, K., Fundamental Methods of Mathematical Economics, 4th ed. (McGraw-Hill) — Ch. 4–5 (matrices, Leontief, Hawkins–Simon), Ch. 11–12 (Hessian, bordered Hessian, λ interpretation, homogeneous functions, CD/CES), Ch. 13 (Kuhn–Tucker), Ch. 15 (Walrasian price dynamics), Ch. 17 (difference equations, cobweb).
  • Sydsaeter, K. & Hammond, P., Essential Mathematics for Economic Analysis — limits, continuity, series, elasticity, determinants, eigenvalues.
  • Dorfman, Samuelson & Solow (1958), Linear Programming and Economic Analysis — duality and complementary slackness (standard reference, cited from knowledge).
  • Hawkins, D. & Simon, H. A. (1949), "Note: Some Conditions of Macroeconomic Stability", Econometrica 17(3/4).
  • Arrow, Chenery, Minhas & Solow (1961), "Capital-Labor Substitution and Economic Efficiency", Review of Economics and Statistics 43(3).
  • Numeric examples (Cramer's rule, eigenvalues, Lagrange/shadow price, Leontief inverse, cobweb) worked by hand and checked.

Practice: 33 real questions

Newest papers first. Pick an option to check yourself; your progress is saved on this device.

0/33
0 correct
Q1UGC NET December 2025

The range of the function y = f(x) = √(1 − x²) is :

Q2UGC NET December 2025

Based on the following statements :

A. Matrix Addition is not Commutative

B. Matrix Addition is Associative

C. Matrix Multiplication is Commutative

D. Matrix Multiplication is Associative if product exists

Choose the correct answer from the options given below :

Q3UGC NET December 2025

Match List - I with List - II.

List - IList - II
A. Slack VariableI. Best of all feasible solutions
B. Surplus VariableII. Solution violating at least one condition
C. Optimal SolutionIII. Used when there are less than or equal to (≤) type inequalities
D. Infeasible SolutionIV. Used when there are greater than or equal to (≥) type inequalities

Choose the correct answer from the options given below :

Q4UGC NET December 2025

Given the difference equation Yt+1 − 1.2Yt = 0, the general expression Yt in terms of t can be :

Q5UGC NET December 2025

Match List - I with List - II.

List - IList - II
A. nth term of an Arithmetic ProgressionI. (n/2)[2a + (n − 1)d]
B. nth term of a Geometric ProgressionII. a(rⁿ − 1)/(r − 1), r > 1
C. Sum to n terms of an Arithmetic ProgressionIII. a + (n − 1)d
D. Sum to n terms of a Geometric ProgressionIV. a r^(n−1)

where a is first term, d is common difference and r is common ratio

Choose the correct answer from the options given below :

Q6UGC NET December 2025

For Cobb-Douglas production function with two inputs, Q = AK^α L^β where A > 0, α and β are > 0, the marginal products are :

A. MPk = (α/K)Q

B. MPk = (β/K)Q

C. MPL = (α/L)Q

D. MPL = (β/L)Q

Choose the correct answer from the options given below :

Q7UGC NET June 2025

If Q = f(K, L) is a homogeneous production function of degree one, which of the following satisfies Euler's theorem?

Q8UGC NET June 2025

If U = 6x² + y², and 4x − y = 1. What is the value of U?

Q9UGC NET June 2025

Integrate ∫ (x+3)/(x+5) dx.

Q10UGC NET June 2025

Given U = (x + 2)(y + 1) and P_x = 4 and P_y = 6 and budget (B) =130. Find the optimum levels of purchase of x* and y*.

Q11UGC NET June 2025

If the demand law is: P = √(9 − x) and the demand is fixed at x₀ = 5. Find the consumer's surplus.

Q12UGC NET June 2025

Evaluate ∫₁² e^(−2x) dx.

Q13UGC NET June 2025

Assume that the rate of investment is described by the function I(t) = 12t^(1/3) and capital stock k(0)=25. Find the time path of capital stock k.

Q14UGC NET June 2025

A company has examined its costs and revenue structure and has determined that C-total cost, R-the total revenue and X-the number of units produced are related as :

C = 100 + 0.015X² and R = 3X

Find the product level X that will maximize profit for this company.

Q15UGC NET June 2025

Match List-I with List-II :

List-IList-II
A. ∫₀^∞ 1/(1+x²) dxI. does not exist
B. ∫₁^∞ 1/√x dxII. 1/3
C. ∫₋∞^(−1) 1/x⁴ dxIII. π/2
D. ∫₋∞^(+∞) 1/(1+x²) dxIV. π

Choose the correct answer from the options given below :

Q16UGC NET June 2024 (re-exam)

Given y = (1 + x)/(1 − 2x) find the correct alternative :

Q17UGC NET June 2024 (re-exam)

The quadratic form ax² + by² + 2hxy is negative for all values of x and y (other than x = y = 0) if and only if :

Q18UGC NET June 2024 (re-exam)

The production function Q = LK/(L + K) is :

Q19UGC NET June 2024 (re-exam)

Position of points O (0, 0) and P (2, −3) in the region of graph of inequation 2x − 3y < 5 will be :

Q20UGC NET June 2024 (re-exam)

In the Cobb-Douglas production function :

q = ALα Kβ, where A, α and β are all positive, the parameters α and β measure

Q21UGC NET June 2024 (re-exam)Official key disputed

Arrange the following expressions in terms of increasing order of magnitude [given : a > o, b > o, x > o]

(A) y = e^a

(B) y = e^(a+bx)

(C) y = e^(a+b/x)

(D) y = e^(a−b/x)

(E) y = e^(a+2bx)

Choose the correct answer from the options given below :

Q22UGC NET June 2024 (re-exam)

A feasible solution in a linear programming problem (LPP) :

(A) Must satisfy all the problem's constraints simultaneously

(B) Need not satisfy all the constraints, only some of them

(C) Must be a corner point in the feasible region

(D) may or may not optimise the value of the objective function

(E) Must be greater than or equal to zero

Choose the correct answer from the options given below :

Q23UGC NET December 2023

If f(x, y) is a homogeneous function of degree 2 with f′(2, 3) = 4 and f′(4, 6) = 12, find f(6, 9) :

Q24UGC NET December 2023

If the Average Revenue function AR = 10 + 5q − q², then the Marginal Revenue function is a :

Q25UGC NET December 2023

Suppose f(·) is a continuous function over a closed and bounded interval [a, b]. Then there exists a point d in [a, b] where f(·) has a minimum, and a point c in [a, b] where f(·) has a maximum, so that f(d) ≤ f(x) ≤ f(c) for all x in [a, b]. The statement is derived from :

Q26UGC NET December 2023

The demand and supply functions for cobweb model are given as :

Qdt = 19 − 6Pt and Qst = 6Pt−1 − 5

Choose the right answer related to intertemporal equilibrium price and the nature of the equilibrium.

Q27UGC NET December 2023

If A = [2 3; 0 4] and B = [2 0; 1 5] which of the following is not correct ?

Q28UGC NET December 2023

Let H = e^Q where Q = Ax^α y^β

Consider the following statements.

(A) Q is a homogeneous function for all values of α and β

(B) H is a homothetic function for all values of α and β

(C) Q is a homogeneous function only if α + β = 1

(D) H is not a homogeneous function

(E) Q is not a homogeneous function

Choose the correct answer from the options given below :

Q29UGC NET December 2023

A = [1 3; 2 8; 4 0] and B = [5; 9]

(A) AB is given by [32; 82; 20]

(B) BA is given by [32 82 20]

(C) AB is not defined

(D) BA is not defined

(E) AᵀB is defined

Choose the correct answer from the options given below :

Q30UGC NET December 2023

Consider a matrix A = [3 5; −2 −4]

consider the following statements on characteristic polynomial, Eigen Values and Eigen Vectors.

(A) The characteristic polynomial is λ² + λ − 2

(B) The characteristic polynomial is λ² − 2λ − 4 and the characteristic root or Eigen Values are λ* = 2 and 1

(C) The characteristic polynomial is λ² − λ + 2 and the characteristic root or Eigen Values are λ* = 1 and 2

(D) The characteristic root or Eigen Values are λ* = −2 and 1

Choose the correct answer from the options given below :

Q31UGC NET December 2023Official key disputed

Suppose production function q = f(k, l), is a homogeneous function of degree 1. Consider the following statements.

(A) The marginal products of capital and labour (∂q/∂k and ∂q/∂l) are homogeneous of degree 1.

(B) The second order cross marginal products of k and l are equal (i.e., ∂²q/∂l∂k = ∂²q/∂k∂l).

(C) By Euler's Theorem : (∂q/∂k)·k + (∂q/∂l)·l = q

(D) By Euler's theorem : (∂²q/∂k²)·k + (∂²q/∂l²)·l = 0

Choose the correct answer from the options given below :

Q32UGC NET December 2023

Consider the following statements :

(A) The union of finite numbers of closed set is a closed set

(B) The empty set is an open set but not a closed set

(C) Every infinite set is an open set

(D) The intersection of finite numbers of open sets is an open set

Choose the correct answer from the options given below :

Q33UGC NET December 2023

Consider the following 3 Constrained Optimization Problems (COP).

(a) Maximize z = ln x, subject to x > 1

(b) Maximize z = ln x, subject to x < 1

(c) Maximize z = ln x, subject to 1 < x < 2

(A) (a) and (b) have no solutions but (c) has solution

(B) (a) and (b) have solutions but (c) has no solution

(C) (a), (b) and (c) have no solution

(D) (a) and (c) have no solution but (b) has solution

Choose the correct answer from the options given below :