Rotating Frames: What If the Ellipse Spins While the Particle Moves?

In our last post, we lifted ellipses into 3D space to explore planetary orbits. But here’s a twist — what if the ellipse itself spins while the particle moves along it? In other words, what happens if the entire orbital plane rotates over time? This is not just a fun thought experiment — it reflects real-world effects, like the precession of orbits, gyroscopes, and the Coriolis effect on Earth. Today, we’ll rotate our coordinate system and simulate the result in Octave. 

Combining Two Motions

Let’s start with a basic elliptical path: r(t) = < a*cos(ωt), b*sin(ωt) > Now imagine the entire coordinate system spins slowly — like placing the ellipse on a turntable. We apply a rotation angle φ(t) to the whole position vector. So the new position becomes: 
x_rot(t) = x(t)*cos(φ(t)) - y(t)*sin(φ(t))
y_rot(t) = x(t)*sin(φ(t)) + y(t)*cos(φ(t))
This is a classic 2D rotation matrix applied to a moving object. If φ(t) increases over time, we get compound motion: the object moves on the ellipse, and the ellipse rotates as it does. 

Rotating Frame Simulation in Octave

Let’s simulate this with Octave. We’ll use: * a = 5, b = 3 (ellipse shape) * ω = 2π (standard motion) * φ(t) = α \* t for some slow spin rate α 
% Parameters
a = 5;
b = 3;
omega = 2 * pi;
alpha = pi / 4;   % Spin rate (radians per second)
t = linspace(0, 2, 1000);  % Time over two seconds

% Elliptical position
x = a * cos(omega * t);
y = b * sin(omega * t);

% Rotation angle over time
phi = alpha * t;

% Apply rotation to the ellipse
x_rot = x .* cos(phi) - y .* sin(phi);
y_rot = x .* sin(phi) + y .* cos(phi);

% Plot the path
plot(x_rot, y_rot);
axis equal;
title('Particle on a Rotating Elliptical Path');
xlabel('x');
ylabel('y');
---

What You’ll See

The path looks like a flower or rosette pattern. Each time around the ellipse, the shape is rotated a bit more. This is what happens in many planetary systems — orbits precess due to gravitational interactions. ---

What Real Phenomenon Does This Model?

  • Orbital Precession: Mercury’s orbit precesses due to the Sun’s shape and general relativity.
  • Foucault Pendulum: A pendulum’s swing rotates due to Earth’s rotation — same math!
  • Coriolis Effect: In rotating frames like Earth, moving objects follow curved paths.

What Does This Teach Us?

  • Motion can be compound — combining local and global movements.
  • Rotating frames help us understand weather systems, space dynamics, and even how your phone’s compass works.
  • Math lets us simulate and visualize these layers of motion in simple, elegant ways.

Try This Yourself:

  • Change the spin rate alpha — try faster or negative values.
  • Plot x and y separately to see how rotation changes their patterns.
  • Combine this with the 3D code from Post #3 to get a rotating elliptical orbit in 3D space.
Everything from hurricanes to gyroscopes to orbiting moons is influenced by rotating frames of reference. Next time you see a spinning top or a weather system on the news, you’ll know — that’s physics in action.

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