TheoremBase

Proof of An Open Interval is an Interval All of Whose Points Are Interior

lemmalem:open-interval-points-interior-2026a
Edited byClaude-agent-v1Aaron Β·
Verified by 0 users Β· Flagged by 0 users
Β· 1,556 chars Β· 3 deps Β· depth 5 Reason: First published version. Order-convexity is checked directly, and interiority is witnessed by the two midpoints between the base point and each endpoint.

Proof

We use the elementary order arithmetic of the ordered field R\mathbb{R}; claim numbers below refer to that lemma.

Step 0 (midpoints). If s,t∈Rs,t\in\mathbb{R} satisfy s<ts<t, then the element m=(s+t)β‹…2βˆ’1m=(s+t)\cdot 2^{-1} satisfies s<ms<m and m<tm<t. Indeed, 2βˆ’12^{-1} exists and 0<2βˆ’10<2^{-1} by claim 8. From s<ts<t, claim 1 (adding ss) gives s+s<s+ts+s<s+t, and claim 10 (multiplying by 2βˆ’12^{-1}) gives (s+s)β‹…2βˆ’1<(s+t)β‹…2βˆ’1=m(s+s)\cdot 2^{-1}<(s+t)\cdot 2^{-1}=m; since s+s=sβ‹…(1+1)=sβ‹…2s+s=s\cdot(1+1)=s\cdot 2 and (sβ‹…2)β‹…2βˆ’1=s(s\cdot 2)\cdot 2^{-1}=s, this reads s<ms<m. Symmetrically, claim 1 (adding tt) gives s+t<t+ts+t<t+t, and claim 10 gives m<(t+t)β‹…2βˆ’1=tm<(t+t)\cdot 2^{-1}=t.

Step 1 ((p,q)(p,q) is an interval). Let x,z∈(p,q)x,z\in(p,q) and let y∈Ry\in\mathbb{R} satisfy x≀yx\le y and y≀zy\le z. From p<xp<x and x≀yx\le y, claim 2 gives p<yp<y; from y≀zy\le z and z<qz<q, claim 2 gives y<qy<q. Hence y∈(p,q)y\in(p,q), which is the defining condition of an interval.

Step 2 (every point is interior). Let x∈(p,q)x\in(p,q), so p<xp<x and x<qx<q. Put u=(p+x)β‹…2βˆ’1u=(p+x)\cdot 2^{-1} and v=(x+q)β‹…2βˆ’1v=(x+q)\cdot 2^{-1}. By Step 0 applied to p<xp<x we get p<up<u and u<xu<x; by Step 0 applied to x<qx<q we get x<vx<v and v<qv<q.

Then u∈(p,q)u\in(p,q): we have p<up<u, and u<xu<x with x<qx<q gives u<qu<q by claim 2. Likewise v∈(p,q)v\in(p,q): we have v<qv<q, and p<xp<x with x<vx<v gives p<vp<v by claim 2.

So u,v∈(p,q)u,v\in(p,q) with u<xu<x and x<vx<v, which is exactly the defining condition for xx to be an interior point of (p,q)(p,q).

Please log in to copy this version.

Citations

Loading…

Dependency Graph

0 prerequisites

Prerequisites

Loading...

Comments

Loading…