Tutorials › Topology (Undergraduate) › Coordinate Slices and Lines as Subspaces of the Plane

The Subspace Topology · Tutorial 178 of 799

Coordinate Slices and Lines as Subspaces of the Plane

Learn how Euclidean disks cut coordinate lines and how those intersections describe the relative topology on each line.

Intermediate 9 min read

What You'll Learn

  • Compute the intersection of an open disk with a horizontal or vertical line.
  • Determine when a disk misses a line or is tangent to it.
  • Describe relative neighborhoods on the coordinate axes using open intervals.
  • Relate relative openness on a coordinate line to openness in the real line.
  • Recognize and correct the error of using the disk radius unchanged when its center is off the line.

Reading a Plane Neighborhood on a Line

A subset of a line in the plane inherits its open sets from the plane: an open set in the line is the intersection of that line with an open set in \(\mathbb{R}^2\). This means that a neighborhood on the line can be found by taking an ordinary plane neighborhood and keeping only the points that lie on the line. For coordinate axes and other horizontal or vertical lines, Euclidean disks make this operation especially concrete.

Throughout, \(\mathbb{R}^2\) has its Euclidean topology, whose basic open sets are disks \[ B((u,v),r)=\{(x,y)\in\mathbb{R}^2:(x-u)^2+(y-v)^2<r^2\}, \] where \(r>0\). A line \(L\subseteq\mathbb{R}^2\) has the subspace topology: its open sets are the sets \(L\cap U\), where \(U\) is open in \(\mathbb{R}^2\). In particular, the relative neighborhood obtained from a disk is \(L\cap B((u,v),r)\).

Definition: For \(a,b\in\mathbb{R}\), write \(H_b=\{(x,b):x\in\mathbb{R}\}\) for the horizontal line at height \(b\), and \(V_a=\{(a,y):y\in\mathbb{R}\}\) for the vertical line at horizontal coordinate \(a\). The \(x\)-axis is \(H_0\), and the \(y\)-axis is \(V_0\).

The Disk–Line Intersection Formula

Theorem: Let \(r>0\). The intersection of the open disk \(B((u,v),r)\) with \(H_b\) is empty if \(|v-b|\ge r\). If \(|v-b|<r\), then \[ B((u,v),r)\cap H_b = \{(x,b):u-\sqrt{r^2-(v-b)^2}<x<u+\sqrt{r^2-(v-b)^2}\}. \] For the vertical line \(V_a\), the intersection is empty if \(|u-a|\ge r\). If \(|u-a|<r\), then \[ B((u,v),r)\cap V_a = \{(a,y):v-\sqrt{r^2-(u-a)^2}<y<v+\sqrt{r^2-(u-a)^2}\}. \]

Proof. A point on \(H_b\) has the form \((x,b)\). It belongs to the disk exactly when \[ (x-u)^2+(b-v)^2<r^2. \] If \(|v-b|\ge r\), then \((b-v)^2\ge r^2\), so the left side is at least \(r^2\) for every \(x\). The strict disk inequality cannot hold, and the intersection is empty. If \(|v-b|<r\), subtracting \((b-v)^2\) gives \[ (x-u)^2<r^2-(v-b)^2. \] The right side is positive, so taking square roots gives \[ -\sqrt{r^2-(v-b)^2}<x-u<\sqrt{r^2-(v-b)^2}. \] Adding \(u\) gives the stated open interval. For \(V_a\), a point has the form \((a,y)\), and disk membership is \((a-u)^2+(y-v)^2<r^2\). If \(|u-a|\ge r\), this is impossible; otherwise, subtracting \((a-u)^2\), taking square roots and adding \(v\) gives the stated interval in \(y\). \(\square\)

The formula distinguishes three cases. If the distance from the disk center to the line is less than \(r\), the intersection is an open interval on the line. If that distance equals \(r\), the disk is tangent to the line at a point on its boundary, but the open disk does not contain that point, so the intersection is empty. If the distance is greater than \(r\), the disk misses the line altogether.

Worked Example: A Disk Cutting the x-Axis

Find \(B((2,3),5)\cap H_0\). Here \(H_0\) is the \(x\)-axis, and the center is \(3\) units above it. The distance \(3\) is less than the radius \(5\), so the intersection is an interval. The horizontal half-width is \[ \sqrt{5^2-3^2}=\sqrt{25-9}=\sqrt{16}=4. \] Thus \[ B((2,3),5)\cap H_0=\{(x,0):-2<x<6\}. \]

Check: At either endpoint, the squared distance to \((2,3)\) is \(({-2}-2)^2+(0-3)^2=16+9=25\), and \(6\) gives \((6-2)^2+(0-3)^2=16+9=25\). Both endpoints are excluded because the disk inequality is strict. At the midpoint \(x=2\), the squared distance is \(0^2+(-3)^2=9<25\), so the interval is nonempty and its center lies in the disk.

Worked Example: A Horizontal Line and a Tangency

Find the intersections of \(B((1,5),5)\) with \(H_2\) and \(H_0\). For \(H_2\), the vertical offset is \(|5-2|=3\), so the half-width is \[ \sqrt{5^2-3^2}=\sqrt{25-9}=4. \] The center coordinate along the line is \(1\), hence \[ B((1,5),5)\cap H_2=\{(x,2):-3<x<5\}. \] For \(H_0\), the vertical offset is \(|5-0|=5\), equal to the radius. The theorem gives \[ B((1,5),5)\cap H_0=\varnothing. \]

Check: The endpoint candidates on \(H_2\) are \((-3,2)\) and \((5,2)\). Their squared distances to \((1,5)\) are \((-3-1)^2+(2-5)^2=16+9=25\) and \((5-1)^2+(2-5)^2=16+9=25\), so neither is in the open disk. The point \((1,2)\) has squared distance \(0^2+(-3)^2=9<25\). On \(H_0\), every point \((x,0)\) has squared distance \((x-1)^2+25\ge25\), confirming that there is no intersection.

Worked Example: A Disk Cutting a Vertical Line

Find \(B((2,-1),5)\cap V_{-1}\). The horizontal offset from the center to \(V_{-1}\) is \(|2-(-1)|=3\). Therefore the half-width in the vertical coordinate is \[ \sqrt{5^2-3^2}=\sqrt{25-9}=4. \] The interval is centered at the disk’s vertical coordinate \(-1\), so \[ B((2,-1),5)\cap V_{-1}=\{(-1,y):-5<y<3\}. \]

Check: The endpoint candidates are \((-1,-5)\) and \((-1,3)\). Their squared distances to \((2,-1)\) are \((-1-2)^2+(-5+1)^2=9+16=25\) and \((-1-2)^2+(3+1)^2=9+16=25\), so both are excluded. The midpoint \((-1,-1)\) has squared distance \((-3)^2+0^2=9<25\), as required.

Relative Neighborhoods Are Open Intervals

The formula gives the shape of a disk intersection, but a disk centered at a point of the line gives a particularly simple neighborhood. For \(p=(t,b)\in H_b\) and \(r>0\), the horizontal offset is zero, so \[ B((t,b),r)\cap H_b=\{(x,b):t-r<x<t+r\}. \] Likewise, for \(p=(a,t)\in V_a\), \[ B((a,t),r)\cap V_a=\{(a,y):t-r<y<t+r\}. \] These are open intervals along their respective lines, centered at the chosen point.

Proposition: Let \(L\) be a horizontal or vertical line with its subspace topology. A subset of \(L\) is open in \(L\) if and only if, around each of its points, it contains an open interval on \(L\) centered at that point.

Proof. First suppose \(A\) is open in \(L\), and take \(p\in A\). By the definition of the subspace topology, \(A=L\cap U\) for some open set \(U\subseteq\mathbb{R}^2\). Since \(p\in U\) and plane open disks form a basis, there is an \(r>0\) such that \(p\in B(p,r)\subseteq U\). Therefore \(L\cap B(p,r)\subseteq A\), and the centered-disk formulas above show that this is an open interval on \(L\) containing \(p\). Conversely, suppose every \(p\in A\) is contained in an open interval on \(L\) that is itself contained in \(A\). Each such interval is \(L\cap B(p,r)\) for an appropriate \(r>0\), so it is open in \(L\). Their union is \(A\); a union of open sets in a topology is open. If \(A\) is empty, it is open by the topology axioms and the pointwise condition is vacuous. This proves both directions. \(\square\)

There is also a direct coordinate description. On \(H_b\), the coordinate \(x\) identifies points \((x,b)\) with real numbers; on \(V_a\), the coordinate \(y\) identifies \((a,y)\) with real numbers. Under either identification, relative open intervals on the line become ordinary open intervals in \(\mathbb{R}\). The proposition shows that a subset of the line is relatively open precisely when its coordinate values form an open subset of \(\mathbb{R}\). This conclusion follows from the interval neighborhood test, not from treating the line as open in the plane: a line itself is not an open subset of \(\mathbb{R}^2\).

Common Pitfall: Keeping the Full Radius

A disk centered on the line cuts out an interval with half-width \(r\). But if the center is off the line, some of the radius is already used by the perpendicular distance from the center to the line. The remaining half-width is \(\sqrt{r^2-d^2}\), where \(d\) is that perpendicular distance, not \(r\).

For example, a tempting but incorrect calculation for \(B((0,3),5)\cap H_0\) is to write \(\{(x,0):-5<x<5\}\), using the full radius as the horizontal half-width. Substitution into the disk condition gives \(x^2+9<25\), or \(x^2<16\), which is equivalent to \(-4<x<4\). Thus the correct intersection is \(\{(x,0):-4<x<4\}\). The proposed endpoint \(x=5\) has squared distance \(5^2+3^2=34>25\), so it is not even on the disk boundary; this directly exposes the error.

When using the formula, first compare the perpendicular offset with the radius. Only if the offset is strictly smaller should you calculate a nonempty interval. Equality means an empty intersection for an open disk, not a singleton. Finally, use the coordinate of the disk center along the line as the interval’s center: \(u\) on a horizontal line and \(v\) on a vertical line.

Check Your Understanding

For each question, use the strict inequality defining an open disk and state whether endpoints belong to the intersection.

  1. Compute \(B((0,1),3)\cap H_0\), and check the squared distances of both endpoint candidates.
  2. Determine whether \(B((4,2),2)\cap V_2\) is empty, and explain the role of tangency.
  3. Find \(B((-2,1),5)\cap H_{-2}\), giving the interval in the \(x\)-coordinate.
  4. Explain why every relative open neighborhood of a point on the \(y\)-axis contains a centered open interval on that axis.
  5. State the error in assigning half-width \(r\) to the intersection of a radius-\(r\) disk whose center is not on the line.