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.
is closed, has an isolated point, and is not perfect
Statement refuted
Refuted claim: every closed subset of is perfect (Perfect subset of : closed with no isolated points).
The witness is . It is closed, being a union of two closed sets (Arbitrary unions and finite intersections of open subsets of are open, and dually for closed sets), and is an isolated point of it (Limit point, isolated point, adherent point, derived set, and dense subset of ), so the second clause of the definition of a perfect set fails while the first holds.
Facts & Assumptions
Given: The set , where and are closed bounded intervals (Intervals of : the nine order-convex forms, nondegeneracy, and length).
The refuted claim: every closed subset of is perfect.
A set is perfect when it is closed and no point of it is isolated in it; is isolated in when some satisfies (Perfect subset of : closed with no isolated points, Limit point, isolated point, adherent point, derived set, and dense subset of ).
Each interval of the form is a closed set, and a union of finitely many closed sets is closed (Open subset of (every point has a neighbourhood inside it), closed subset (complement open), and clopen, Intervals of : the nine order-convex forms, nondegeneracy, and length, Arbitrary unions and finite intersections of open subsets of are open, and dually for closed sets).
, so and ; the order is total and transitive (The multiplicative identity is positive, Order is preserved by adding a constant and by adding inequalities, Sign rules for products and monotonicity of multiplication, Ordered field, Complete ordered field (least-upper-bound property)). These order-arithmetic facts are stated by their sources for the strict order only; the nonstrict forms used below follow by adjoining the equality case, in which the two sides coincide.
Counterexample
is closed: and are closed sets by [L2], and their union is closed by [L2]. So is a legitimate instance of the claim [A1].
is an isolated point of : certainly ; put , which is positive and by [L4]. An element of is or lies in , and in the second case by [L3] and [L4], so . Hence .
By step 1.2 the closed set of step 1.1 has an isolated point, so it is not perfect by [L1], and the claim [A1] is refuted.
Remarks
-
Only the second clause fails, and by one point. Every point of is a limit point of , by the computation in Every nondegenerate closed interval is perfect, giving a second proof that it is uncountable; the single point is what stops from being perfect. Deleting it leaves , which is perfect.
-
Countability is the visible consequence. A nonempty perfect set is uncountable (Every nonempty perfect subset of is uncountable). is uncountable too, since it contains , so this example does not separate the two notions by size; what it shows is that closedness alone does not give perfectness. A countable closed set with isolated points is ( is compact while is not closed), and it is likewise not perfect.
-
The empty set is the degenerate case on the other side. It is closed and has no isolated points, hence is perfect, and it is countable; that is why Every nonempty perfect subset of is uncountable assumes its perfect set is nonempty.
Depends on
- Perfect subset of $\mathbb{R}$: closed with no isolated points
- Limit point, isolated point, adherent point, derived set, and dense subset of $\mathbb{R}$
- Open subset of $\mathbb{R}$ (every point has a neighbourhood inside it), closed subset (complement open), and clopen
- Intervals of $\mathbb{R}$: the nine order-convex forms, nondegeneracy, and length
- The $\varepsilon$-neighbourhood and the punctured $\varepsilon$-neighbourhood of a point of $\mathbb{R}$
- Arbitrary unions and finite intersections of open subsets of $\mathbb{R}$ are open, and dually for closed sets
- Basic properties of the absolute value
- Ordered field
- Complete ordered field (least-upper-bound property)
- The multiplicative identity is positive
- Order is preserved by adding a constant and by adding inequalities
- Sign rules for products and monotonicity of multiplication
Used by
Nothing in the library uses this result yet.
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 28 results over 13 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.
Sources
- Perfect set (Wikipedia) (standard reference, not scraped)
- Isolated point (Wikipedia) (standard reference, not scraped)
- W. Rudin, Principles of Mathematical Analysis, 3rd ed., Ch. 2 (standard reference, not scraped)