Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)
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.

The continuous dual separates points in a Hausdorff locally convex space

Statement

Assume HB. In a Hausdorff locally convex real or complex TVS, for every xy there is fX with Ref(x)Ref(y). Equivalently, fXkerf={0},kerf={v:f(v)=0}.

Facts & Assumptions

Given: HB and a Hausdorff locally convex TVS X.

[F1]

The continuous dual is a vector space of continuous scalar-linear functionals (Local convexity, convex and balanced sets, and the continuous dual).

[F2]

Every zero-neighborhood contains an open convex zero-neighborhood (Open and closed balanced convex zero-neighborhood refinements).

[F3]

Under HB, a nonempty open convex set and a disjoint nonempty convex set have a continuous separator strict on the open side (Continuous separation when one convex set is open).

[F4]

HB is the additional real dominated-extension principle (The real dominated-extension principle as an additional hypothesis over ZF).

Proof

1.1

Fix xy and put v=xy0. Hausdorffness gives an open neighborhood U of zero not containing v, by taking disjoint open neighborhoods of zero and v. Refine U to an open convex zero-neighborhood VU. The singleton {v} is convex and nonempty, and misses V.

F2F5
2.1

Apply open separation to V and {v}. There are fX and αR with 0=Ref(0)<αRef(v). Consequently Ref(x)Ref(y)=Ref(v)>0. The only non-ZF input is the HB application inside that separation theorem.

F1F3F4step 1.1
3.1

Every linear functional vanishes at zero, so zero belongs to the intersection of the kernels. For nonzero v, step 2.1 applied to x=v,y=0 gives a functional with nonzero real part at v, hence v does not belong to that intersection. This proves the kernel identity from point separation.

F1step 2.1
4.1

Conversely, assume the kernel identity and fix xy, with v=xy. Some fX has z=f(v)0. Over R this already separates real parts. Over C, if Rez0 again use f; otherwise Imz0, and g=ifX has Reg(v)=Imz0. Thus the kernel identity implies the stated real-part separation. For X={0} there are no distinct points, and the kernel identity still holds. The proof selects a functional only for one fixed pair, never a simultaneous family.

F1step 3.1

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

22 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