Visual Tools
Calculators
Tables
Mathematical Keyboard
Converters
Other Tools


Compex Numbers Properties



Key Terms
Overview of Complex Number Properties
Complex Numbers as a Field
Arithmetic Properties (Field Axioms)
Properties of the Conjugate
Properties of the Modulus
Properties of the Argument
Algebraic Closure
What Complex Numbers Lack
Summary: Operation Effects on Conjugate, Modulus, and Argument



The Rules Governing Complex Arithmetic

Complex numbers obey specific rules that determine how they interact under arithmetic operations. Some of these properties arise from the algebraic structure shared with real numbers, while others are unique to the complex number system. Understanding these properties provides the foundation for manipulating complex expressions, simplifying calculations, and recognizing what complex numbers can and cannot do.

Key Terms

Complex Number— elements of the field C\mathbb{C}
Additive Inverse— guarantees subtraction in C\mathbb{C}
Multiplicative Inverse— guarantees division for nonzero elements
Modulus— underpins the metric structure of C\mathbb{C}

See All Complex Numbers Definitions →


Overview of Complex Number Properties

The properties of complex numbers fall into distinct categories based on their origin and nature.

Arithmetic properties govern basic operations — addition, subtraction, multiplication, and division. These properties derive from the fact that complex numbers form what mathematicians call a field, an algebraic structure shared with the real numbers R\mathbb{R} and rational numbers Q\mathbb{Q}. Any rule that works for real arithmetic also works for complex arithmetic.

Conjugate, modulus, and argument properties are unique to complex numbers. The conjugate z‾\overline{z} reflects a number across the real axis. The modulus ∣z∣|z| measures distance from the origin. The argument arg⁡(z)\arg(z) specifies direction. Each of these concepts carries its own set of rules describing how it behaves under arithmetic operations.

Algebraic closure is a property that makes C\mathbb{C} more powerful than R\mathbb{R}. Every polynomial equation has solutions in the complex numbers — a guarantee that real numbers cannot provide.

Ordering is a property that C\mathbb{C} lacks. Unlike real numbers, complex numbers cannot be arranged on a line from smallest to largest. The familiar comparisons "greater than" and "less than" do not apply.

The sections that follow examine each category in detail.

Complex Numbers as a Field

In abstract algebra, a field is a set equipped with two operations — addition and multiplication — that satisfy a specific collection of axioms. These axioms guarantee predictable arithmetic: you can add, subtract, multiply, and divide (except by zero) and always obtain a result within the same set.

The rational numbers Q\mathbb{Q} form a field. So do the real numbers R\mathbb{R}. The complex numbers C\mathbb{C} extend this pattern — they too satisfy every field axiom.

Why does this matter? Because field structure ensures that algebraic techniques transfer seamlessly. Factoring, expanding, simplifying, solving equations — all the methods developed for real numbers work identically for complex numbers. No special cases, no exceptions, no hidden traps.

The field axioms divide into several groups:

• Closure: Operations keep you inside the set

• Commutativity: Order of operands does not matter

• Associativity: Grouping of operands does not matter

• Identity elements: Zero for addition, one for multiplication

• Inverse elements: Every number has a negative; every nonzero number has a reciprocal

• Distributivity: Multiplication distributes over addition

The next section lists these axioms precisely and confirms that C\mathbb{C} satisfies each one.

Arithmetic Properties (Field Axioms)

The eleven field axioms, all satisfied by C\mathbb{C}:

Closure


• z1+z2∈Cz_1 + z_2 \in \mathbb{C} for all z1,z2∈Cz_1, z_2 \in \mathbb{C}

• z1⋅z2∈Cz_1 \cdot z_2 \in \mathbb{C} for all z1,z2∈Cz_1, z_2 \in \mathbb{C}

Adding or multiplying complex numbers always produces a complex number.

Commutativity


• z1+z2=z2+z1z_1 + z_2 = z_2 + z_1

• z1⋅z2=z2⋅z1z_1 \cdot z_2 = z_2 \cdot z_1

Order does not affect the result.

Associativity


• (z1+z2)+z3=z1+(z2+z3)(z_1 + z_2) + z_3 = z_1 + (z_2 + z_3)

• (z1⋅z2)⋅z3=z1⋅(z2⋅z3)(z_1 \cdot z_2) \cdot z_3 = z_1 \cdot (z_2 \cdot z_3)

Grouping does not affect the result.

Identity Elements


• Additive identity: z+0=zz + 0 = z

• Multiplicative identity: z⋅1=zz \cdot 1 = z

Inverse Elements


• Additive inverse: For every zz, there exists −z-z such that z+(−z)=0z + (-z) = 0

• Multiplicative inverse: For every z≠0z \neq 0, there exists z−1z^{-1} such that z⋅z−1=1z \cdot z^{-1} = 1

The multiplicative inverse is z−1=z‾∣z∣2z^{-1} = \frac{\overline{z}}{|z|^2}.

Distributivity


• z1⋅(z2+z3)=z1⋅z2+z1⋅z3z_1 \cdot (z_2 + z_3) = z_1 \cdot z_2 + z_1 \cdot z_3

Multiplication distributes over addition.

These eleven properties guarantee that complex arithmetic behaves consistently and predictably, just like real arithmetic.
Axiom group Additive form (+) Multiplicative form (·)
Closure z₁ + z₂ ∈ ℂ z₁ · z₂ ∈ ℂ
Commutativity z₁ + z₂ = z₂ + z₁ z₁ · z₂ = z₂ · z₁
Associativity (z₁ + z₂) + z₃ = z₁ + (z₂ + z₃) (z₁ · z₂) · z₃ = z₁ · (z₂ · z₃)
Identity z + 0 = z (additive identity 0) z · 1 = z (multiplicative identity 1)
Inverse −z exists; z + (−z) = 0 z⁻¹ exists for z ≠ 0; z · z⁻¹ = 1
(formula: z⁻¹ = z̄ / |z|²)
Distributivity z₁ · (z₂ + z₃) = z₁ · z₂ + z₁ · z₃    (multiplication distributes over addition)

Properties of the Conjugate

The complex conjugate z‾\overline{z} of z=a+biz = a + bi is z‾=a−bi\overline{z} = a - bi. Conjugation interacts with arithmetic operations in predictable ways.

Conjugate of a Conjugate


z‾‾=z\overline{\overline{z}} = z


Conjugating twice returns the original number.

Conjugate of a Sum


z1+z2‾=z1‾+z2‾\overline{z_1 + z_2} = \overline{z_1} + \overline{z_2}


The conjugate of a sum equals the sum of conjugates.

Conjugate of a Difference


z1−z2‾=z1‾−z2‾\overline{z_1 - z_2} = \overline{z_1} - \overline{z_2}


Conjugate of a Product


z1⋅z2‾=z1‾⋅z2‾\overline{z_1 \cdot z_2} = \overline{z_1} \cdot \overline{z_2}


The conjugate of a product equals the product of conjugates.

Conjugate of a Quotient


(z1z2)‾=z1‾z2‾\overline{\left(\frac{z_1}{z_2}\right)} = \frac{\overline{z_1}}{\overline{z_2}}


Extracting Real and Imaginary Parts


z+z‾=2Re(z)z + \overline{z} = 2\text{Re}(z)


z−z‾=2i⋅Im(z)z - \overline{z} = 2i \cdot \text{Im}(z)


Product with Conjugate


z⋅z‾=∣z∣2z \cdot \overline{z} = |z|^2


A complex number multiplied by its conjugate yields the square of its modulus — always a non-negative real number. This property is essential for division of complex numbers.

Properties of the Modulus

The modulus ∣z∣|z| of z=a+biz = a + bi is ∣z∣=a2+b2|z| = \sqrt{a^2 + b^2}, representing the distance from the origin to zz in the complex plane.

Non-Negativity


∣z∣≥0|z| \geq 0


∣z∣=0  ⟺  z=0|z| = 0 \iff z = 0


The modulus is zero only for the number zero itself.

Modulus of a Conjugate


∣z‾∣=∣z∣|\overline{z}| = |z|


A number and its conjugate have equal moduli.

Modulus of a Product


∣z1⋅z2∣=∣z1∣⋅∣z2∣|z_1 \cdot z_2| = |z_1| \cdot |z_2|


The modulus of a product equals the product of moduli.

Modulus of a Quotient


∣z1z2∣=∣z1∣∣z2∣\left|\frac{z_1}{z_2}\right| = \frac{|z_1|}{|z_2|}


Modulus of a Power


∣zn∣=∣z∣n|z^n| = |z|^n


Triangle Inequality


∣z1+z2∣≤∣z1∣+∣z2∣|z_1 + z_2| \leq |z_1| + |z_2|


The distance from the origin to z1+z2z_1 + z_2 never exceeds the sum of individual distances. Geometrically, one side of a triangle cannot exceed the sum of the other two sides.

Reverse Triangle Inequality


∣∣z1∣−∣z2∣∣≤∣z1−z2∣\big||z_1| - |z_2|\big| \leq |z_1 - z_2|


The difference of moduli never exceeds the modulus of the difference.

Properties of the Argument

The argument arg⁡(z)\arg(z) is the angle from the positive real axis to the line connecting the origin to zz. Arguments are determined only up to multiples of 2π2\pi, so the following properties hold modulo 2π2\pi.

Argument of a Product


arg⁡(z1⋅z2)=arg⁡(z1)+arg⁡(z2)\arg(z_1 \cdot z_2) = \arg(z_1) + \arg(z_2)


Multiplying complex numbers adds their arguments. Geometrically, multiplication rotates by the sum of the angles.

Argument of a Quotient


arg⁡(z1z2)=arg⁡(z1)−arg⁡(z2)\arg\left(\frac{z_1}{z_2}\right) = \arg(z_1) - \arg(z_2)


Dividing complex numbers subtracts arguments.

Argument of a Power


arg⁡(zn)=n⋅arg⁡(z)\arg(z^n) = n \cdot \arg(z)


Raising to the nnth power multiplies the argument by nn. This property underlies De Moivre's theorem.

Argument of a Conjugate


arg⁡(z‾)=−arg⁡(z)\arg(\overline{z}) = -\arg(z)


Conjugation reflects across the real axis, negating the angle.

Argument of a Negative


arg⁡(−z)=arg⁡(z)+π\arg(-z) = \arg(z) + \pi


Negation rotates by 180°180°.

Note on Multivaluedness


Since arg⁡(z)\arg(z) is defined only up to 2πk2\pi k for integer kk, these equalities hold in the sense that representative values from each side differ by a multiple of 2π2\pi. When using the principal argument Arg(z)\text{Arg}(z), results may need adjustment to stay within the chosen interval.

Algebraic Closure

A field is algebraically closed if every non-constant polynomial with coefficients in that field has at least one root in that field. The complex numbers are algebraically closed. The real numbers are not.

The Fundamental Theorem of Algebra


Every polynomial of degree n≥1n \geq 1 with complex coefficients has exactly nn roots in C\mathbb{C}, counting multiplicity.

This theorem guarantees that polynomial equations always have solutions — no need to invent further number systems beyond C\mathbb{C}.

Why R\mathbb{R} Fails


The polynomial x2+1=0x^2 + 1 = 0 has no real solutions. No real number squared equals −1-1. This limitation motivated the creation of complex numbers in the first place.

In C\mathbb{C}, the equation x2+1=0x^2 + 1 = 0 has two solutions: x=ix = i and x=−ix = -i.

Practical Consequence


When factoring polynomials over C\mathbb{C}, every polynomial of degree nn factors completely into nn linear factors:

p(z)=an(z−r1)(z−r2)⋯(z−rn)p(z) = a_n(z - r_1)(z - r_2)\cdots(z - r_n)


Over R\mathbb{R}, some polynomials resist complete factorization. Over C\mathbb{C}, none do.

For more on polynomial roots, see equations and polynomials.
Question ℝ (real numbers) ℂ (complex numbers)
Algebraically closed? ✗ No ✓ Yes
Every non-constant polynomial has a root in the field? Not always — e.g., x² + 1 = 0 has no real root Always — guaranteed by the Fundamental Theorem of Algebra
Degree-n polynomial factors completely into n linear factors? Not always (some factors remain irreducible quadratics) Always: p(z) = aₙ(z − r₁)(z − r₂)⋯(z − rₙ)
Number of roots of a degree-n polynomial 0 to n exactly n (counting multiplicity)

What Complex Numbers Lack

Despite their algebraic completeness, complex numbers lack one property that real numbers possess: order.

Not an Ordered Field


The real numbers are ordered. Given distinct a,b∈Ra, b \in \mathbb{R}, either a<ba < b or b<ab < a. This ordering respects arithmetic: if a<ba < b, then a+c<b+ca + c < b + c for any cc, and ac<bcac < bc when c>0c > 0.

No such ordering exists for C\mathbb{C}. There is no way to define "<<" on complex numbers that remains consistent with the field operations.

Why Ordering Fails


Suppose an ordering existed. Consider where ii falls relative to 00.

Case 1: i>0i > 0

Then i⋅i>0i \cdot i > 0, so i2>0i^2 > 0, meaning −1>0-1 > 0. But this contradicts 1>01 > 0 (which must hold in any ordered field).

Case 2: i<0i < 0

Then −i>0-i > 0, so (−i)(−i)>0(-i)(-i) > 0, meaning i2>0i^2 > 0, so −1>0-1 > 0. Same contradiction.

Neither case works. The number ii cannot be consistently placed relative to 00, and the same argument applies to every non-real complex number.

What We Can Compare


Although z1<z2z_1 < z_2 is meaningless for complex numbers, we can compare their moduli. The statement ∣z1∣<∣z2∣|z_1| < |z_2| is well-defined because moduli are real numbers. We compare sizes, not positions.

Summary: Operation Effects on Conjugate, Modulus, and Argument

The conjugate, modulus, and argument each interact predictably with the same arithmetic operations. The table below collects how each of the three invariants behaves under sum, difference, product, quotient, power, and conjugation — exposing the parallel structure that the preceding sections established one at a time.
Operation Conjugate behaves as… Modulus behaves as… Argument behaves as…
Sum   z₁ + z₂ z̄₁ + z̄₂ |z₁ + z₂| ≤ |z₁| + |z₂|
(triangle inequality)		 no simple rule
Difference   z₁ − z₂ z̄₁ − z̄₂ |z₁ − z₂| ≥ | |z₁| − |z₂| |
(reverse triangle inequality)		 no simple rule
Product   z₁ · z₂ z̄₁ · z̄₂ |z₁| · |z₂| arg(z₁) + arg(z₂)
Quotient   z₁ / z₂ z̄₁ / z̄₂ |z₁| / |z₂| arg(z₁) − arg(z₂)
Power   zⁿ (z̄)ⁿ |z|ⁿ n · arg(z)
(De Moivre)
Conjugation   z̄ z (double conjugate) |z| (unchanged) −arg(z)