Alphabeta Math
RemarkRemark: 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.

Dualizing real vector-space sequences and the choice boundary

Statement

Write V=HomR(V,R) for the algebraic real dual. Two separate axiom branches clarify the exactness issue.

  • Under AC, every short exact sequence of real vector spaces 0AiBqD0 dualizes to the short exact sequence 0DqBiA0. * Under ZF + DC and the additional hypothesis that every subset of P=RN has the Baire property in its product topology, let E=R(N)P be the finitely supported sequences. The functional :ER given by (x)=nxn does not extend linearly to P. Consequently 0EPP/E0 does not remain exact at E after real dualization.

These are conditional assertions, not a consistency or nonprovability theorem for ZF. AC is not assumed in the second branch. The canonical extension of values on a supplied simplex basis is a different, choice-free construction.

Facts & Assumptions

Given: The objects and separate axiom branches of the statement.

[F4]

DC supplies a sequence starting at a specified element of a nonempty set whenever the successor relation is entire (The axiom of dependent choice: a relation in which every element is related to something admits an N-indexed chain).

[F3]

Extending a cochain by its prescribed values on the subspace-simplex basis and by zero on the remaining supplied simplices requires no choice (Canonical extension by zero of a singular cochain on a simplex basis).

Here a set is nowhere dense if its closure has empty interior, meager if it is contained in a countable union of nowhere dense sets, and has the Baire property if its symmetric difference with some open set is meager. The additional Baire-property hypothesis concerns P itself; no theorem transferring such a hypothesis from another space is used.

Proof

1.1

Assume AC. For a subspace AB, apply [F1] to the empty independent set in A to obtain a basis S, and then to SB to obtain a basis T of B containing S. If aA, assign value a(s) at sS and value zero at tTS. A vector of B has a unique finite expression in T, so the corresponding finite sum defines a real-linear functional b on B. For a vector in A, its expression in S is also its expression in T, and hence bA=a. These two basis constructions are the exact AC use. If A=0, take the zero extension directly; if A=B, take b=a.

F1
2.1

For an arbitrary short exact sequence as stated, transport a functional on A to the subspace i(A) using the inverse of the injective map i, and apply step 1.1. Thus i is surjective. Since q is surjective, fq=0 implies f=0, so q is injective. The composite iq is zero since qi=0. Conversely, if bi=0, define bˉ(d)=b(x) for any x with q(x)=d. Such an x exists; two choices differ by an element of kerq=i(A) on which b vanishes. This uniquely specifies bˉ without selecting lifts. It is linear by applying b to sums and scalar multiples of any lifts, and qbˉ=b. Hence keri=imq. Only the surjectivity argument used AC. This also covers B=0 and the endpoint cases A=0 or D=0.

step 1.1
3.1

In contrast to the AC conclusion of step 2.1, for the second branch assume only ZF + DC and the stated Baire-property hypothesis. On P use the metric d(x,y)=n02n1min(1,xnyn). The triangle inequality follows termwise from that of min(1,st); positivity and symmetry are immediate. This metric induces the product topology. Indeed a sufficiently small metric ball forces any prescribed finite set of coordinate inequalities, by the individual positive weights. Conversely a small restriction on finitely many initial coordinates makes the corresponding partial sum small, while the geometric tail is arbitrarily small. A metric Cauchy sequence is Cauchy in each real coordinate, so let xn be its unique coordinate limit. These unique limits define xP. For any ϵ>0, bound the geometric tail by ϵ/2 and use convergence in the finitely many initial coordinates for the remaining ϵ/2. This proves convergence to x in d, so P is complete. It is nonempty, containing the zero sequence. By [F2], no nonempty open subset of P is meager: replace the nowhere dense sets by their closed closures and intersect their open dense complements with that open subset.

F2step 2.1
4.1

We will use the fact that a countable union of meager sets is meager under DC, and spell out its selection cost. If Mj is meager, let Wj be the nonempty set of sequences of nowhere dense subsets covering Mj. The set of finite tuples (w0,,wk1) with wjWj contains the empty tuple, and extension by one more coordinate is an entire relation: for that one index a witness exists. DC starting at the empty tuple produces a chain of such extensions. Its union gives one wj for every j. A fixed enumeration of N×N now gives a single sequence of nowhere dense sets covering jMj. This is the only countable family of meagerness witnesses selected below.

F4step 3.1
5.1

Let L:PR be any algebraic linear functional. The sets Am={x:L(x)m} for integers m1 cover P. By steps 3.1 and 4.1, some Am is nonmeager. By the Baire-property hypothesis there are an open set O and a meager set N with AmON. The set O is nonempty, since otherwise Am is meager. Take aO and a symmetric open neighborhood V of zero with a+V+VO; such a V is obtained by shrinking the finitely many coordinate intervals of a basic neighborhood at a. For tV, the nonempty open set a+V lies in both O and Ot. Translations preserve nowhere density and meagerness since they are homeomorphisms. Hence N(Nt) is meager and cannot cover a+V. There is therefore b(a+V)(N(Nt)). Then b,b+tAm, giving L(t)=L(b+t)L(b)2m. This proves that L is bounded on V. For each ϵ>0, choose an integer k>2m/ϵ; on the open neighborhood k1V its absolute value is less than ϵ. Thus L is continuous. No b is chosen simultaneously for all t; the argument proves the bound separately for each t.

step 3.1step 4.1
6.1

Continuity supplies a basic product neighborhood W of zero on which L<1. Let FN be the finite set of coordinates restricted by W. If y vanishes on F, then ryW for every real r, so rL(y)<1 for every r, which forces L(y)=0. In particular, if en is the sequence with its only nonzero coordinate equal to one at n, then L(en)=0 for all nF. But the well-defined finite-sum functional :ER satisfies (en)=1 for every n. The least integer outside F supplies a contradiction to LE=. Thus restriction PE is not surjective. The inclusion and quotient give an exact sequence 0EPP/E0 in ZF, so this is the claimed failure of exactness after dualization.

step 5.1
7.1

In this witness E is nonzero because e0E is nonzero, and P/E is nonzero because the constant-one sequence has infinite support. No quotient representatives are chosen to define the sequence. The zero functional always extends, but the explicitly given does not in this branch. The functional is well-defined on vectors with any finite support, including empty support, and no sign or order of summation is ambiguous because each sum is finite. The supplied-simplex construction in [F3] instead already has a containing basis, so its zero extension does not call on step 1.1 or on either additional axiom of this second branch.

F3step 1.1step 6.1

Depends on

Used by

Dependency tree · two levels

26 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