Alphabeta Math
False statementConstruction: AI-adaptedVerification: AI-generatedprecheck 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.

FALSE: the intersection of two connected subspaces is connected

Statement

False claim: if A and B are connected subsets of a topological space X (Separation of a topological space, connected and disconnected spaces, clopen sets, and connected subsets, Subspace topology: the traces of the open sets, its closed sets and its bases, the continuity of the inclusion, and the characteristic property of a map into a subspace) then A∩B is connected.

The corresponding statement for unions is true under a meeting hypothesis (A union of connected subspaces with a point in common is connected, and so is a union of a family in which every member meets a fixed connected member); there is no such repair for intersections, and the witness below has A∩B≠∅, so nonemptiness is not what is missing.

Witness. In X=R2 with the product topology (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, The product set ∏i∈IXi of functions choosing a point in each factor, the projections, the box topology, and the product topology as the initial topology of the projections; the empty product is a one-point space) put

S0:={0}×[0,1],S1:={1}×[0,1],T0:=[0,1]×{0},T1:=[0,1]×{1},

and let A:=T0∪S0∪S1 and B:=T1∪S0∪S1: the three sides of the unit square other than the top, and the three other than the bottom. Both are connected, and A∩B=S0∪S1 is disconnected, being two disjoint closed segments.

Facts & Assumptions

Given: R2 with the product topology and the sets S0,S1,T0,T1,A,B above; subsets carry the subspace topology.

[A3]

A union of connected subsets each meeting a fixed connected subset, together with that subset, is connected (A union of connected subspaces with a point in common is connected, and so is a union of a family in which every member meets a fixed connected member, claim 2).

Refutation

technique · contradiction
1.1

Suppose, for contradiction, that the claim holds: the intersection of two connected subsets is connected.

assume-contra
1.2

Each of S0,S1,T0,T1 is a connected subset of R2: for instance S0 is the image of [0,1] under t↦(0,t), whose components are a constant map and the identity, hence continuous by [A2], and [0,1] is connected by [A1]; the other three are the images of t↦(1,t), t↦(t,0) and t↦(t,1).

A1A2
1.3

Each of S0,S1,T0,T1 is closed in R2 by [A5], being a product of two closed subsets of R, so each equals its own closure.

A5
1.4

A∩B=S0∪S1: each of S0,S1 lies in both A and B; and a point of T0 not in S0∪S1 has second coordinate 0 and first coordinate strictly between 0 and 1, so it lies in neither T1 nor S0 nor S1, hence not in B; symmetrically for T1.

given
2.1

A=T0∪S0∪S1 is connected: T0 is connected by step 1.2, and S0 and S1 are connected and meet T0, in (0,0) and (1,0) respectively; so [A3] applies with T0 as the fixed connected set. Symmetrically B=T1∪S0∪S1 is connected, S0 and S1 meeting T1 in (0,1) and (1,1).

step 1.2A3
2.2

S0 and S1 are nonempty, disjoint, and separated in R2: by step 1.3 each is its own closure, and S0∩S1=∅ because a common point would have first coordinate both 0 and 1. So A∩B is disconnected by [A4] and step 1.4.

step 1.3step 1.4A4
3.1

By step 2.1 both A and B are connected, so the supposed claim of step 1.1 makes A∩B connected, contradicting step 2.2. The claim is therefore false.

step 1.1step 2.1step 2.2discharge-contradiction∎

Remarks

  • Nonemptiness is not the missing hypothesis. In the witness A∩B=S0∪S1 is nonempty, and it is even a union of two connected sets — they simply do not meet. Nor does convexity of the pieces help: each of A and B is a union of three straight segments.

  • Why unions behave and intersections do not. [A3] works because a point common to two connected sets welds them: a continuous two-valued function must agree on both. An intersection has no such welding point available, and indeed the intersection of two connected sets can be split as badly as one likes; taking longer chains of segments makes A∩B a union of any number of disjoint segments while keeping A and B connected.

  • Both witnesses are as simple as the plane allows. A and B are the boundary of the unit square with one side removed, in the two ways of doing so that leave the two vertical sides. Each is path-connected, hence connected by Every path-connected space is connected, and every path component lies inside a component and Paths, path-connected spaces and path components, so the failure has nothing to do with the pathologies of the zigzag curve elsewhere on this page.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

78 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