Alphabeta Math
ExampleConstruction: AI-adaptedVerification: AI-adaptedprecheck passverified 2026-08-04 (gpt-5.6-sol-codex-subscription)
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

Every convex subset of Rn, in particular every ball and Rn itself, is path-connected and hence connected

Example

Let n∈N with n≥1 and give Rn the product topology, which is the metric topology of d∞ (For n≥1 the product topology on n copies of the usual topology of R is the metric topology of d∞ on Rn, and hence also of d1 and d2, so Rn as a product and Rn as a metric space are one space, Rn as the set of functions n→R, and d1, d2, d∞ are metrics on it, The metric topology: a set is open when every one of its points has a ball around it inside the set; closed means open complement). Recall that Rn is a real vector space under coordinatewise operations (Vector space over a field, A norm on a real vector space, the induced metric, and the dictionary with the metric axioms).

A subset C⊆Rn is convex when

x,y∈C  and  t∈[0,1]⟹(1−t)x+ty∈C

(Intervals of R: the nine order-convex forms, nondegeneracy, and length). Then:

  1. Every convex C⊆Rn is path-connected (Paths, path-connected spaces and path components), hence connected (Separation of a topological space, connected and disconnected spaces, clopen sets, and connected subsets, Every path-connected space is connected, and every path component lies inside a component).
  2. Every ball is convex, in each of the norms ∥⋅∥1, ∥⋅∥2, ∥⋅∥∞ (The p-norms ∥x∥p for rational p≥1, and ∥x∥∞, Open ball, closed ball and sphere in a metric space); so every ball of Rn is path-connected and connected.
  3. Rn itself is convex, hence path-connected and connected, and so is every half-space { x:xk≤c }, and every box ∏k<nJk with each Jk an order-convex subset of R.

Facts & Assumptions

Given: Rn with n≥1, its product topology, and a convex subset C⊆Rn.

[A3]

A path in a subset A from x to y is a continuous γ:[0,1]→A with γ(0)=x, γ(1)=y; A is path-connected when every pair of its points is joined by one (Paths, path-connected spaces and path components, Intervals of R: the nine order-convex forms, nondegeneracy, and length).

[A6]

Rn is a real vector space, so it is closed under the scalar multiples and sums forming (1−t)x+ty (Vector space over a field); and an order-convex J⊆R contains every real lying between two of its elements (Intervals of R: the nine order-convex forms, nondegeneracy, and length).

Verification

technique · direct
1.1

Let x,y∈C and define γ:[0,1]→Rn by γ(t):=(1−t)x+ty, so that the k-th component is t↦xk+t(yk−xk), an affine map of R into R.

A2
1.2

Every ball is convex: for x,y∈B(c,r) and t∈[0,1], ∥(1−t)x+ty−c∥=∥(1−t)(x−c)+t(y−c)∥≤(1−t)∥x−c∥+t∥y−c∥<(1−t)r+tr=r, using [A5] and 1−t≥0, t≥0.

A5
1.3

Rn is convex, since (1−t)x+ty is an element of Rn for all x,y and t; a box ∏k<nJk with each Jk order-convex is convex, since (1−t)xk+tyk lies between xk and yk and hence in Jk; and a half-space {x:xk≤c} is convex for the same reason.

A6
2.1

γ is continuous into Rn by [A1] and step 1.1, each component being continuous by [A2]; and γ takes values in C by convexity, so it is continuous into the subspace C by [A1].

step 1.1A1A2
3.1

γ(0)=x and γ(1)=y, so γ is a path in C from x to y by [A3]. As x,y∈C were arbitrary, C is path-connected; and it is connected by [A4]. This is claim 1.

step 1.1step 2.1A3A4
4.1

Claims 2 and 3 follow from claim 1 together with steps 1.2 and 1.3, each of the sets listed there being convex.

step 1.2step 1.3step 3.1∎

Remarks

  • The path is the straight segment and nothing more is needed. Convexity is exactly the hypothesis that the segment between two points of the set stays in the set, so the definition of the path writes itself; the only work is that the segment is a continuous map, which is [A1] plus the continuity of an affine map of one real variable.

  • Convexity is far from necessary. A circle is path-connected and not convex, and so is any set obtained from a convex one by bending it. Nothing above asserts a converse.

  • The hypothesis n≥1 comes from d∞. ∥⋅∥∞ is a maximum over n terms and is undefined at n=0 (The p-norms ∥x∥p for rational p≥1, and ∥x∥∞, Rn as the set of functions n→R, and d1, d2, d∞ are metrics on it). At n=0 the product is a one-point space, which is path-connected outright.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

99 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources