MHB How can we determine the reflection across a given line in Hesse normal form?

  • Thread starter Thread starter mathmari
  • Start date Start date
  • Tags Tags
    Line Reflection
Click For Summary
To determine the reflection of a point across a line in Hesse normal form, the reflection can be expressed as P' = P - 2(ax + by + c) * (a, b). The key properties of reflection include that the reflected point P' lies on the perpendicular to the line g through point P and that the line g bisects the segment PP'. The discussion explores the relationship between the original point vector OP and the reflected point vector OP', suggesting that OP' can be derived from OP and the normal vector n. The participants seek clarification on constructing OP' using geometric relationships and vector operations. The conversation emphasizes understanding the geometric interpretation of reflections across lines in a coordinate system.
mathmari
Gold Member
MHB
Messages
4,984
Reaction score
7
Hey! :o

Let $g$ be a line with equation $g:ax+by+c=0$ in Hesse normal form. I want to show that the reflection across $g$ is described by \begin{equation*}\binom{x}{y}\mapsto \binom{x}{y}-2(ax+by+c)\binom{a}{b}\end{equation*}

At the reflection across $g$ it holds the following for the image $P'$ of each point $P$:
  • $P'$ lies on the perpendicular to $g$ through $P$.
  • $g$ bisects $PP'$.
So to show the desired result, do we have to find the perpendicular line to $g$ ? (Wondering)
 
Physics news on Phys.org
Hey mathmari! (Smile)

Let's draw a picture:
\begin{tikzpicture}[>=stealth]
\coordinate (C) at (4,3);
\coordinate (P) at (4.5,6.5);
\coordinate (Q) at (2.5,5);
\coordinate (P') at (0.5,3.5);
\draw[->, green, ultra thick] (Q) -- node[above left] {$(\vec{CP} \cdot \mathbf n)\mathbf n$} (P);
\draw (Q) -- (P');
\draw[->, blue] (0,0) -- node[below right] {$-c\mathbf n$} (C) node
{$C$};
\draw[->, blue, ultra thick] (0,0) -- node[below right] {$\mathbf n = \binom ab$} (4/5,3/5);
\draw[blue, ultra thick] (1,7) -- (7, -1) node
{$g:\mathbf n \cdot \mathbf x + c = ax+by+c=0$};
\draw[->, red, ultra thick] (0,0) -- (P);
\draw[->, red, ultra thick] (0,0) -- (P');
\draw[->, green, ultra thick] (C) -- (P);
\fill (P) circle (0.05) node
{$P$};
\fill (Q) circle (0.05) node [below] {$Q$};
\fill (P') circle (0.05) node
{$P'$};
\fill circle (0.1) node [below] {$O$};
\end{tikzpicture}
We are given $\vec{OP}$ and we want to find $\vec{OP'}$ yes?

Can we construct the vector $\vec{OP'}$ using $\vec{OP}$, $\mathbf n$, and $c$? (Wondering)​
 
I like Serena said:
Let's draw a picture:
\begin{tikzpicture}[>=stealth]
\coordinate (C) at (4,3);
\coordinate (P) at (4.5,6.5);
\coordinate (Q) at (2.5,5);
\coordinate (P') at (0.5,3.5);
\draw[->, green, ultra thick] (Q) -- node[above left] {$(\vec{CP} \cdot \mathbf n)\mathbf n$} (P);
\draw (Q) -- (P');
\draw[->, blue] (0,0) -- node[below right] {$-c\mathbf n$} (C) node
{$C$};
\draw[->, blue, ultra thick] (0,0) -- node[below right] {$\mathbf n = \binom ab$} (4/5,3/5);
\draw[blue, ultra thick] (1,7) -- (7, -1) node
{$g:\mathbf n \cdot \mathbf x + c = ax+by+c=0$};
\draw[->, red, ultra thick] (0,0) -- (P);
\draw[->, red, ultra thick] (0,0) -- (P');
\draw[->, green, ultra thick] (C) -- (P);
\fill (P) circle (0.05) node
{$P$};
\fill (Q) circle (0.05) node [below] {$Q$};
\fill (P') circle (0.05) node
{$P'$};
\fill circle (0.1) node [below] {$O$};
\end{tikzpicture}
We are given $\vec OP$ and we want to find $\vec OP'$ yes?

Can we construct the vector $\vec OP'$ using $\vec OP$, $\mathbf n$, and $c$? (Wondering)​
It holds that $$\vec OP'+(-c\mathbf n)=\vec OP$$ doesn't it? (Wondering)​
 
mathmari said:
It holds that $$\vec OP'+(-c\mathbf n)=\vec OP$$ doesn't it? (Wondering)

Ah no, it doesn't.
It may look like it, but that's just due to a bit of unfortunate choices for the coordinates in the drawing. (Blush)
OCPP' is generally not a parallellogram.

Let me rectify that:
\begin{tikzpicture}[>=stealth]
\coordinate (O) at (-2,-1.5);
\coordinate (C) at (4,3);
\coordinate (P) at (4.5,6.5);
\coordinate (Q) at (2.5,5);
\coordinate (P') at (0.5,3.5);
\draw[->, green, ultra thick] (Q) -- node[above left] {$(\vec{CP} \cdot \mathbf n)\mathbf n$} (P);
\draw (Q) -- (P');
\draw[->, blue] (O) -- node[below right] {$-c\mathbf n$} (C) node
{$C$};
\draw[->, blue, ultra thick] (O) -- node[below right] {$\mathbf n = \binom ab$} +(4/5,3/5);
\draw[blue, ultra thick] (1,7) -- (7, -1) node
{$g:\mathbf n \cdot \mathbf x + c = ax+by+c=0$};
\draw[->, red, ultra thick] (O) -- (P);
\draw[->, red, ultra thick] (O) -- (P');
\draw[->, green, ultra thick] (C) -- (P);
\fill (P) circle (0.05) node
{$P$};
\fill (Q) circle (0.05) node [below] {$Q$};
\fill (P') circle (0.05) node
{$P'$};
\fill (O) circle (0.1) node [below] {$O$};
\end{tikzpicture}​
 
I don't really know how we could get $\vec{OP'}$. Could you give me a hint? (Wondering)
 
mathmari said:
I don't really know how we could get $\vec{OP'}$. Could you give me a hint?

Isn't $\vec{OP'}=\vec{OP}-2(\vec{CP}\cdot\mathbf n)\mathbf n$ and $\vec{CP}=\vec{OP}-(-c\mathbf n)$?
Can we solve that? (Wondering)
 

Similar threads

Replies
8
Views
3K
Replies
22
Views
4K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 11 ·
Replies
11
Views
2K
Replies
8
Views
2K
  • · Replies 1 ·
Replies
1
Views
3K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 2 ·
Replies
2
Views
1K