nLab square root

Square roots

Context

Algebra

Analysis

Square roots

Definitions

Let (K,)(K, \cdot) be a magma object in abelian groups or commutative monoids, such as a ring or a rig. Given an element xKx \in K, the element x 2=xxx^2 = x \cdot x is the square of xx. Conversely, given elements xKx \in K and yKy \in K, if x 2=yx^2 = y, then xx is a square root of yy.

Square roots as functions

Alternatively, the term square root is also used to denote a partial function that is a right inverse of the squaring function in KK. Let K sqK_{\mathrm{sq}} be a subset of KK such that for all xK sqx \in K_{\mathrm{sq}} there exists yKy \in K such that x 2=yx^2 = y. A square root is a function f:K sqKf:K_{\mathrm{sq}} \to K such that f(x) 2=xf(x)^2 = x for all xK sqx \in K_{\mathrm{sq}}. If the squaring function xx 2x \mapsto x^2 is split surjective, then there exists a square root function that is a total function on all of KK.

One sometimes fixes a function ():K sqK\sqrt{(-)}:K_{\mathrm{sq}} \to K on KK; this is the principal square root of KK. For example, in complex analysis the principal square root on the complex numbers is defined as z|z|e iarg(z)2z \mapsto \vert z \vert e^{\frac{i \arg(z)}{2}}, where arg(z)\arg(z) is defined such that τ2<arg(z)τ2-\frac{\tau}{2} \lt \arg(z) \leq \frac{\tau}{2} for all complex numbers zz.

Examples

  • The square root of every element in a boolean ring and more generally a multiplicatively idempotent rig exists and is unique because the multiplicative monoid is idempotent. The identity function is thus a square root function defined on the entirety of the ring or rig.

  • Since both 11 and 1-1 are square roots of 11 in every ring, that the square root of 11 is unique implies that the ring has characteristic 22, where 1=11 = -1.

  • The square root of every non-negative real number exists and is unique on the rig of non-negative real numbers.

  • If KK is an integral domain, then (in classical mathematics) xx and x-x are the only square roots of x 2x^2. If yy has a square root, then we often denote its square roots together as ±y\pm\sqrt{y}, where the symbols ±y\pm\sqrt{y} is just notation and doesn’t necessarily have an official definition. However, if KK has a principal square root function, we can define ±()\pm\sqrt{(-)} to be a function ±():K sqK 2\pm\sqrt{(-)}:K_{\mathrm{sq}} \to K^2 such that ±y=(y,y)\pm\sqrt{y} = (\sqrt{y}, -\sqrt{y}).

In constructive mathematics

In constructive mathematics (here specifically: constructive analysis), it is not provable that xx and x-x are the only square roots of x 2x^2. In the ordered field of real numbers, for example, the absolute value |x|{|x|} (like |x|-{|x|}, for that matter) is also a square root of x 2x^2, yet it is not constructively provable that |x|=x{|x|} = x or |x|=x{|x|} = -x. Without using the lesser limited principle of omniscience, if xx is close to zero (and we do not yet know whether it is exactly zero), we cannot decide whether xx is nonnegative (so that |x|=x{|x|} = x) or nonpositive (so that |x|=x{|x|} = -x).

However, in any linearly ordered field with an absolute value (including any real-closed field), we still have a unique nonnegative square root of x 2x^2, which is in fact |x|{|x|}. Thus, we can still use the notation y\sqrt{y}, but we cannot prove that every square root of yy is one of ±y\pm\sqrt{y}. However, we can prove, in any integral domain even, that if xyx \neq \sqrt{y} and xyx \neq -\sqrt{y}, then x 2yx^2 \neq y. (We are using the weak notions of field and integral domain so that \mathbb{R} will be an example.)

Note that there is never any trouble finding a principal square root of yy if we assume that y0y \neq 0, nor (obviously) is there any trouble if we assume that y=0y = 0. Accordingly, the classical results hold for discrete fields and discrete integral domains, but this doesn't apply constructively to analysis.

In complex analysis

In constructive mathematics, given a set KK, one has to distinguish between mere existence of an element that satisfies some property PP on KK, there exists xKx \in K such that P(x)P(x) holds, and constructive existence of an element that satisfies P(x)P(x) via the BHK interpretation of logic, which is the structure of an element of the set {xK|P(x)}\{x \in K \vert P(x)\}. This becomes very important in complex analysis when talking about square roots.

In constructive complex analysis, there are multiple notions of the fundamental theorem of algebra. One version that is provable without any constructive taboo for the associated complex numbers =[i]/(i 2+1)\mathbb{C} = \mathbb{R}[i]/(i^2 + 1) of the Cauchy real numbers (see Ruitenburg 1991) and for any Cauchy complete Archimedean ordered field (see Geuvers, Wiedijk, & Zwanenburg 2000) uses mere existence of a root for non-constant polynomials. Mere existence of a root in the BHK sense is equivalent in strength to every non-constant polynomial function being a surjection, since non-constant polynomial functions are closed under addition of constant polynomial functions. Hence, this implies that for all cc \in \mathbb{C}, there exists a root of the function zz 2cz \mapsto z^2 - c, implying that there exists a square root of cc for all cc \in \mathbb{C}.

However, the fundamental theorem of algebra is not provable if we try to use constructive existence of a root of non-constant polynomials in the sense of the BHK interpretation, that one can construct a specified element zz \in \mathbb{C} such that p(z)=0p(z) = 0. Constructive existence of a root in the BHK sense is equivalent in strength to having a section of every non-constant polynomial function, since non-constant polynomial functions are closed under addition of constant polynomial functions. In the case of the squaring function zz 2z \mapsto z^2, this implies a square root function on the entirety of the complex numbers. Such a square root function is a section of the squaring function zz 2z \mapsto z^2 and so cannot be proven to exist on the complex numbers from surjectivity of zz 2z \mapsto z^2, since the square root on the complex numbers, if it exists, is discontinuous at zero, which implies the constructive taboo analytic WLPO for the real numbers and decidable equality for the complex numbers. In fact, in certain topoi, such as sheaves over \mathbb{C}, one can prove that there are no square root functions because in those topoi all functions on the complex numbers are continuous.

In light of this, one can instead interpret the constructive FTA as a statement about sets of roots rather than about individual roots, an interpretation that dates from Richman 2000. He constructs a complete metric space M^ n()\hat{M}_n(\mathbb{C}) which, classically, is the space of nn-element multisets of complex numbers (and constructively is the completion of that space) and proves that every complex polynomial function pp of degree nn may be associated with a point in this space in such a way that the nn elements of that point (when viewed as a multiset, if possible, and morally in any case) are the nn roots of pp. The square root function is then a function ±():M^ 2()\pm\sqrt{(-)}:\mathbb{C} \to \hat{M}_2(\mathbb{C}) which takes each complex number cc \in \mathbb{C} to a point ±cM^ 2()\pm\sqrt{c} \in \hat{M}_2(\mathbb{C}) that represents the set of square roots of cc.

In addition, the principal square root of the complex numbers, defined as z|z|e iarg(z)2z \mapsto \vert z \vert e^{\frac{i \arg(z)}{2}}, where arg(z)\arg(z) is defined such that τ2<arg(z)τ2-\frac{\tau}{2} \lt \arg(z) \leq \frac{\tau}{2} for all complex numbers zz, is only a partial function in neutral constructive mathematics. This is important for interpreting the quadratic formula.

References

  • Wim Ruitenburg: Constructing Roots of Polynomials over the Complex Numbers, Computational Aspects of Lie Group Representations and Related Topics, CWI Tract 84 Centre for Mathematics and Computer Science, Amsterdam (1991) 107–-128 [pdf, pdf]

  • Herman Geuvers, Freek Wiedijk, Jan Zwanenburg, A Constructive Proof of the Fundamental Theorem of Algebra without using the Rationals, TYPES ‘00: Selected papers from the International Workshop on Types for Proofs and Programs, Pages 96 - 111, 08 December 2000 [web, pdf]

  • Fred Richman, The fundamental theorem of algebra: a constructive development without choice. Pacific Journal of Mathematics 196 1 (2000) 213–230 [doi:10.2140/pjm.2000.196.213, pdf]

More generally, square roots of positive self-adjoint operators:

  • Zoltán Sebestyén, Zsigmond Tarcsay, On the square root of a positive selfadjoint operator, Period Math Hung 75 (2017) 268–272 [doi:10.1007/s10998-017-0192-1]

Last revised on June 14, 2026 at 03:22:58. See the history of this page for a list of all contributions to it.