Ellipses and Complex Numbers: A New Way to Look at Motion

So far in this series, we’ve described elliptical motion using position vectors, trigonometry, and rotation matrices. 

But what if I told you there’s a more elegant way to represent all of it — using complex numbers? 

Today, we’ll explore how complex numbers and Euler’s formula allow us to model elliptical motion, circular motion, and rotation with surprising simplicity. Along the way, we’ll translate our real-valued vector math into the complex plane — and simulate it all in Octave. 

Complex Numbers as Vectors 
A complex number is written as: z = x + i·y, where: x is the real part, y is the imaginary part, and i is the square root of -1.  You can think of this as a 2D vector: z = (x, y)

Euler’s Formula: exp(iθ) = cos(θ) + i·sin(θ)

This means we can represent circular motion using the exponential expression: z(t) = R · e^(i·ω·t)

This traces a circle of radius R, rotating counterclockwise at angular speed ω.

What About Ellipses? 
To model an ellipse, we scale the real and imaginary parts differently: z(t) = a·cos(ω·t) + i·b·sin(ω·t)

This traces an ellipse in the complex plane. We can also write this as: z(t) = Re(a·e^(i·ω·t)) + i·Im(b·e^(i·ω·t))

Octave Code to Plot Elliptical Motion 
Paste the following code into Octave or MATLAB to generate the plot: 

Parameters a = 5; b = 3; omega = 2 * pi; t = linspace(0, 1, 1000); % Complex form of elliptical motion z = a * cos(omega * t) + 1i * b * sin(omega * t); % Extract real and imaginary parts x = real(z); y = imag(z); % Plot plot(x, y); axis equal; xlabel('Real'); ylabel('Imaginary'); title('Elliptical Motion in the Complex Plane'); 

Advantages of Using Complex Numbers
Clean representation of rotation using multiplication 
Combines x and y into a single expression 
Widely used in physics, electrical engineering, and quantum mechanics 

Applications Beyond Math 
Electromagnetic waves
Phase and amplitude are often modeled with complex numbers
Signal processing 

Comments

Post a Comment

Popular posts from this blog

What is Mathematical Fluency?

What does it really mean for students to be mathematically fluent? If you’ve been in any math PD over the past few years, you’ve likely heard the phrase everywhere. We talk about fluency as something students should develop, strengthen, and demonstrate, but it can still feel abstract when we try to describe it in observable, classroom-ready terms. This post breaks down mathematical fluency into the two simplest frames we can use as teachers: what it looks like and what it sounds like . These descriptions can guide instruction, assessment, student goal-setting, and even walkthrough conversations with colleagues or administrators. What Mathematical Fluency Looks Like In a classroom where students are developing mathematical fluency, you see students making choices about strategies rather than following steps robotically. They use representations—number lines, diagrams, tables, graphs, manipulatives, symbolic expressions—and switch between them to make sense of a problem. They move ...
Read more

Unlocking the Group: Cosets, Cayley’s Theorem, and Lagrange’s Theorem

Mathematics is full of elegant ideas that take simple definitions and build deep, powerful structures. In group theory, three such concepts—cosets, Cayley's Theorem, and Lagrange’s Theorem—form a foundational trio that unveils the internal symmetry of algebraic systems. Let’s explore what they mean and why they matter. What’s a Coset, Really? Imagine you have a group and a smaller subgroup inside it. Now, pick any element from the big group and use it to shift every element in the subgroup by multiplying on the left. The resulting set is called a left coset . You can also do this multiplication on the right, forming a right coset . These cosets aren’t usually groups themselves—but they do break the original group into equal-sized, non-overlapping pieces. Intuitively , cosets act like “shifts” of the subgroup across the whole group. Think of tiling a floor: each tile is a copy of the same shape (the subgroup) placed in different locations (cosets). Lagrange’s Theorem: Size Matt...
Read more

Verifying the Binomial Formula with Mathematical Induction

The binomial formula states: ( z 1 + z 2 ) n = ∑ k = 0 n ( n k ) z 1 n − k z 2 k (z_1 + z_2)^n = \sum_{k=0}^n \binom{n}{k} z_1^{n-k} z_2^k where ( n k ) = n ! k ! ( n − k ) ! \binom{n}{k} = \frac{n!}{k!(n-k)!} and n = 1 , 2 , … n = 1, 2, \ldots . This is a powerful formula in algebra, expressing the expansion of ( z 1 + z 2 ) n (z_1 + z_2)^n as a sum of terms involving powers of z 1 z_1 and z 2 z_2 . We’ll verify this formula using mathematical induction . Mathematical induction is a logical method to prove that a statement holds for all positive integers n n . The process involves two steps: Base Case : Verify the formula for the smallest value of n n , typically n = 1 n = 1 . Inductive Step : Assume the formula holds for some n = k n = k , and then prove it holds for n = k + 1 n = k+1 . Step 1: Base Case ( n = 1 n = 1 ) For n = 1 n = 1 , the formula becomes: ( z 1 + z 2 ) 1 = ∑ k = 0 1 ( 1 k ) z 1 1 − k z 2 k (z_1 + z_2)^1 = \sum_{k=0}^1 \binom{1}{k} z_1^{1-k} z_2^k L...
Read more