Alphabeta Math
False statementConstruction: Literature-sourcedVerification: AI-generatedprecheck passaudited 2026-09-12
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 context-free pumping lemma characterizes the context-free languages

Statement

False claim: a language is context-free exactly when it satisfies the ordinary Bar-Hillel pumping condition.

Facts & Assumptions

Given: Put K:={anbncn:n0}, let s be a new symbol, and set L:=sK{srq:r1, q{a,b,c}}.

[A1]

The statement refuted is: a language is context-free exactly when it satisfies the ordinary Bar-Hillel pumping condition.

[L2]

The proof of Context-free languages are not closed under intersection establishes that K={anbncn:n0} is not context free.

[L3]

PDA's recognize exactly the context-free languages (PDAs recognize exactly the context-free languages), and context-free languages are closed under homomorphic image (Context-free languages are closed under union, concatenation, Kleene star, and homomorphism).

Refutation

technique · direct
1.1

We verify the ordinary pumping condition with pumping length p:=3. Let z=srqL have length at least 3, with q{a,b,c}. If r=0, pump the first letter of q. If r=1, then qK, and pump the unique initial s. If r2 and q is nonempty, pump its first letter. In all three cases take the pumped letter as v and take w=x=ε; pumping preserves membership because it either keeps r1 or changes the single initial s to si, which belongs to the second part of L for every i1.

givencases
1.2

Suppose for contradiction that L were context free. Let R:={saibjck:i,j,k0}, which is regular. Choose a PDA for L using [L3] and a DFA for R. The product control consisting of the PDA state and DFA state, with the same stack operation as the PDA and with epsilon moves leaving the DFA state fixed, is a PDA for LR. Hence LR is context free.

L3assume-contraconstruct
2.1

It remains to treat z=sr with r3. For r=3, take v=s3; for r4, take v=s2. Put u=w=x=ε and let y be the remaining suffix. Pumping produces respectively s3i or sr+2(i1), whose exponent is never 1. Thus vx1, vwx3, and every pumped word lies in L.

step 1.1cases
2.2

By definition, LR=sK. Apply the homomorphism that deletes the initial symbol s and fixes a,b,c. Closure under homomorphism from [L3] would make K context free, contradicting [L2]. Therefore L is not context free.

L2L3step 1.2discharge-contradiction
3.1

Steps 1.1 and 2.1 show that L satisfies the ordinary pumping condition, while step 2.2 shows that it is not context free. Thus [A1] is false.

A1step 1.1step 2.1step 2.2

Depends on

Used by

Dependency tree · two levels

8 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