Alphabeta Math
CounterexampleConstruction: AI-adaptedVerification: AI-generatedprecheck passverified 2026-08-09 (gpt-5.6-terra-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.

With g≡0 and f equal to 0 off the origin and 1 at it, lim⁡g=0 and lim⁡y→0f=0 while f∘g≡1

Statement refuted

Refuted claim: if lim⁡x→cg(x)=L and lim⁡y→Lf(y)=M then the limit of f∘g at c exists and equals M — the false statement FALSE: lim⁡x→cf(g(x))=M whenever lim⁡x→cg=L and lim⁡y→Lf=M.

Take A=B=R, c=0, the constant function g≡0, and the function f of The function equal to 0 off the origin and to 1 at the origin has limit 0≠1 there, equal to 0 off the origin and to 1 at it. Then L=0, M=0, and f∘g is the constant function 1, so the limit of f∘g at 0 exists and equals 1≠0=M.

What this item adds to the false statement. It carries the comparison through: it identifies which of the two hypotheses of Composition of limits holds under either hypothesis: f is defined at L with value M, or g avoids L on a punctured neighbourhood of c fails here — both do — and it shows that replacing the inner function by the identity, which satisfies hypothesis (ii), restores the conclusion with the same outer function. So neither the outer function nor the composition operation is at fault; the failure is precisely that the inner function takes the critical value.

Facts & Assumptions

Given: The function f:R→R of The function equal to 0 off the origin and to 1 at the origin has limit 0≠1 there, with f(y)=0 for y≠0 and f(0)=1; the constant function g:R→R, g(x)=0; the identity function ι:R→R, ι(x)=x; and the point c:=0.

[L1]

The limit condition (The ε-δ limit lim⁡x→cf(x)=L of f:A→R at a limit point c of A): lim⁡x→ch(x)=P means that for every real ε>0 there is a real δ>0 such that every x in the domain with 0<∣x−c∣<δ satisfies ∣h(x)−P∣<ε.

[L3]

The witness function: f(0)=1 by its definition, and the limit of f at 0 exists and equals 0, as verified in The function equal to 0 off the origin and to 1 at the origin has limit 0≠1 there.

[L4]

Absolute value: ∣0∣=0; ∣u∣=0 exactly when u=0 (Basic properties of the absolute value).

[L5]

Order in R: trichotomy, and 0<1, so 1≠0 (The multiplicative identity is positive, Ordered field).

[L6]

Composition of limits, and its two extra hypotheses: (i) L∈B and f(L)=M; (ii) some real η>0 has g(x)≠L for every x∈A with 0<∣x−c∣<η (Composition of limits holds under either hypothesis: f is defined at L with value M, or g avoids L on a punctured neighbourhood of c).

Counterexample

technique · direct
1.1

By [L3] the limit of f at 0 exists and equals 0, and f(0)=1; so the outer hypothesis of the refuted claim holds with L=0 and M=0.

L3
1.2

0 is a limit point of R, and g(R)={0}⊆R and ι(R)=R, so both f∘g and f∘ι are functions on R.

L2
1.3

The reals 0 and 1 are distinct.

L5
2.1

The inner hypothesis holds for g with L=0: for every real ε>0 every δ>0 serves, since ∣g(x)−0∣=∣0∣=0<ε for every x. So the limit of g at 0 exists and equals 0.

step 1.2L1L4
2.2

It holds for ι as well: given a real ε>0 take δ:=ε; then 0<∣x−0∣<δ gives ∣ι(x)−0∣=∣x∣<ε. So the limit of ι at 0 exists and equals 0.

step 1.2L1
3.1

f∘g is the constant function 1: for every x∈R, g(x)=0 and hence f(g(x))=f(0)=1. By the computation of step 2.1, applied to the constant 1 in place of the constant 0, the limit of f∘g at 0 exists and equals 1.

step 1.1step 2.1L1L4
3.2

f∘ι=f, since f(ι(x))=f(x) for every x; so by [L3] the limit of f∘ι at 0 exists and equals 0=M.

step 1.1step 2.2L3
4.1

Hence lim⁡x→0g(x)=0=L and lim⁡y→0f(y)=0=M, while lim⁡x→0f(g(x))=1≠0=M: the refuted claim is false.

step 1.3step 3.1L5
4.2

Both extra hypotheses of Composition of limits holds under either hypothesis: f is defined at L with value M, or g avoids L on a punctured neighbourhood of c fail for the pair (f,g): hypothesis (i) fails because L=0 lies in B=R while f(L)=f(0)=1≠0=M, and hypothesis (ii) fails because g(x)=0=L for every x, so no punctured neighbourhood of 0 avoids the value L. For the pair (f,ι), hypothesis (ii) does hold with η:=1, since ι(x)=x≠0 whenever 0<∣x−0∣<1; and step 3.2 confirms the conclusion of the theorem there.

step 1.1step 3.1step 3.2L6
5.1

So the two safeguards in the true theorem cannot both be omitted, and the obstruction is located exactly at the values of the inner function that equal L.

step 4.1step 4.2∎

Remarks

  • The same outer function serves both roles. With g the composition fails, with ι it succeeds, and f is unchanged. So the failure cannot be attributed to any pathology of f beyond the one recorded in The function equal to 0 off the origin and to 1 at the origin has limit 0≠1 there: that its value at 0 differs from its limit at 0.

  • Constancy of g is not the issue either. What matters is that g takes the value L on every punctured neighbourhood of c. Any inner function doing that, constant or not, produces the same failure by the same argument, since the outer estimate is unavailable at those arguments.

  • The practical rule. When substituting y=g(x) inside a limit, check one of the two hypotheses of Composition of limits holds under either hypothesis: f is defined at L with value M, or g avoids L on a punctured neighbourhood of c: either the outer function is defined at L with the right value there, or the inner function avoids L near c. Substitutions such as y=1/x satisfy the second for structural reasons; substitutions into a function known only through its limit satisfy neither in general.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

24 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