Alphabeta Math
CounterexampleConstruction: Literature-sourcedVerification: AI-adaptedprecheck passaudited 2026-08-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.

In infinite dimension, distinct subspaces of V∗ can have the same preannihilator

Statement refuted

Refuted claim: Distinct subspaces of an algebraic dual always have distinct preannihilators.

Facts & Assumptions

Given: The axiom of choice, an infinite-dimensional vector space V, an infinite Hamel basis B, and Φ=span⁡{b∗:b∈B}≤V∗.

[L1]

The preannihilator ∘S consists of vectors killed by every functional in S (The annihilator U∘≤V∗ of U≤V and the preannihilator ∘S≤V of S≤V∗).

[L2]

For an infinite Hamel basis, the span Φ of its coordinate functionals is a proper subspace of V∗ (For an infinite Hamel basis, its dual family is linearly independent but does not span the algebraic dual).

[L3]

Assuming choice, every nonzero vector is detected by some linear functional (Assuming choice, if v∉U≤V, some f∈V∗ vanishes on U and satisfies f(v)=1, with the zero subspace).

Counterexample

technique · explicit subspaces
1.1

If v≠0, some coordinate of its finite basis expansion is nonzero, so the corresponding b∗∈Φ does not kill v. Hence [L1] gives ∘Φ={0}.

L1givenalgebra
1.2

By [L3], every nonzero v is detected by some member of V∗, so ∘(V∗)={0}.

L1L3
2.1

Yet [L2] gives Φ≠V∗, while steps 1.1 and 1.2 give equal preannihilators. These are the required distinct subspaces.

step 1.1step 1.2L2∎

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

9 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