Alphabeta Math
False statementConstruction: AI-adaptedVerification: AI-generatedprecheck passjudge pass (z-ai/glm-5.2)audited 2026-07-27
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 image of a closed subset of R under a continuous real function is closed

Statement

False claim: if A⊆R, if f:A→R is continuous on A (Continuity of f:A→R at a point of A and on A: the ε-δ condition, its agreement with lim⁡x→cf(x)=f(c) at a limit point, and continuity at an isolated point) and if F⊆A is a closed subset of R (Open subset of R (every point has a neighbourhood inside it), closed subset (complement open), and clopen), then the image f[F]={ f(x):x∈F } is a closed subset of R.

Why it is tempting. Continuity is characterised by the behaviour of preimages: the preimage of every closed set is relatively closed (f:A→R is continuous on A if and only if the preimage of every open subset of R is the intersection with A of an open subset of R, and dually for closed sets). It is easy to transpose that to images, and images are exactly where the characterisation says nothing.

What is true. Compactness, not closedness, is preserved: the image of a compact set under a continuous function is compact (The image of a compact subset of R under a continuous real function is compact), hence closed and bounded (A subset of R is compact if and only if it is closed and bounded). Closedness by itself is preserved by neither images nor unions of infinitely many closed sets, and boundedness by itself is not preserved either, since x↦1/x carries the bounded set (0,1) onto the unbounded set (1,∞).

Facts & Assumptions

Given: The domain A:=R, the closed set F:=R, and the function f:R→R, f(x):=1/(1+x2) (Integer powers am).

[L1]
[L3]

Squares and order: x2≥0 for every real x, so 1+x2≥1>0; and 0<s≤t implies 0<1/t≤1/s (Monotonicity of x↦xn and of n↦an, Inverses of positives are positive, and reciprocation reverses order, Ordered field, Integer powers am).

[L4]

Square roots: every real t≥0 has a unique s≥0 with s2=t (Existence and uniqueness of n-th roots: a unique a1/n≥0 with (a1/n)n=a).

[L6]

Intervals and minima: (0,1]={ y:0<y≤1 } (Intervals of R: the nine order-convex forms, nondegeneracy, and length); the minimum of a two-element set of reals exists and is one of them (Every nonempty finite set of reals has a maximum and a minimum, Maximum and minimum of a set); and ∣u∣≥0 with ∣u∣=u for u≥0 (Basic properties of the absolute value).

Refutation

technique · direct
1.1

F=R is a closed subset of R and is contained in A=R.

L1
1.2

f is continuous on R: the denominator x↦1+x2 is a polynomial function, hence continuous by [L2], and it satisfies 1+x2≥1>0 by [L3], so it never vanishes and f=1/(1+x2) is continuous by [L2].

L2L3
1.3

(0,1]⊆f[R]. Let y satisfy 0<y≤1 and put t:=1/y−1. By [L3] we have 1/y≥1, so t≥0, and [L4] supplies a real s≥0 with s2=t. Then 1+s2=1/y and hence f(s)=1/(1+s2)=y.

L3L4L6
1.4

(0,1] is not closed. Let a real ε>0 be given and put y:=min⁡{ε/2, 1}, a real with 0<y≤1 by [L6], so y∈(0,1]; and ∣y−0∣=y≤ε/2<ε, so y∈Nε(0)∩(0,1]. Hence 0∈(0,1]‾ by [L5], while 0∉(0,1] because 0<0 is false. So (0,1]≠(0,1]‾ and (0,1] is not closed by [L5].

L5L6
2.1

f[R]⊆(0,1]. For every real x, [L3] gives 1+x2≥1>0 and hence 0<1/(1+x2)≤1, that is f(x)∈(0,1].

step 1.2L3L6
3.1

So f[F]=f[R]=(0,1].

step 2.1step 1.3
4.1

The set F=R is closed, f is continuous on R, and f[F]=(0,1] is not closed: the claim is false.

step 1.1step 1.2step 3.1step 1.4∎

Remarks

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

59 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