Alphabeta Math
CounterexampleConstruction: AI-adaptedVerification: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-13
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.

Weak closure can exceed sequential weak closure

Statement refuted

Weak closure always consists of limits of sequences from the set. Assume HB (The real dominated-extension principle as an additional hypothesis over ZF) and Countable Choice (The Axiom of Countable Choice (ACω)). In real 2 the set A={nen:n1} is sequentially weakly closed, but 0AwA.

Facts & Assumptions

[F1]

The 2 norm is the square-sum norm (p is the Lp space of counting measure); the pair (2,2) is conjugate (Conjugate exponents, including the endpoint conventions) and finite Hölder gives Cauchy–Schwarz (Holder's inequality for finite sums and conjugate real exponents).

[F2]

Finite functional disks form weak neighborhoods (Basic weak neighborhoods).

[F3]

Under HB and Countable Choice weakly convergent sequences are norm bounded (Weakly convergent sequences are norm bounded); under HB the weak topology is Hausdorff (Weak topology is hausdorff).

Counterexample

Given: the set A above, with strictly positive indices.

1.1

For a bounded real functional F, put bn=F(en). Test F on vN=n=1Nbnen. Then BN=n=1Nbn2=F(vN)FBN, so BNF2, including BN=0. Thus (bn) is square summable. Finite Hölder and passage to increasing finite sums show nxnbnx2b2, consistent with these tests.

givenF1
2.1

Fix a basic weak neighborhood of zero given by F1,,Fm and ε>0. If it missed A, then for each n1 some j would have nFj(en)ε. Therefore jFj(en)2ε2/n. Summing over n contradicts the finite sum of square-summability bounds from step 1.1: the harmonic partial sums are unbounded since each block 2rn<2r+1 contributes at least 1/2. For m=0 the neighborhood is the whole space and already meets A. Thus every weak zero-neighborhood meets A, so 0Aw, while every member of A has norm n>0.

step 1.1F2algebra
3.1

If a sequence in A converges weakly, F3 bounds its norms by some finite C. Its indices therefore satisfy nC2, so its range lies in a finite subset of A. A finite set is closed in a Hausdorff space: each singleton is closed because every other point has a disjoint neighborhood, and finite unions are closed. The weak limit lies in this finite set, hence in A. Thus A is sequentially weakly closed but not weakly closed.

step 2.1F3

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

34 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