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

Complex Lp duality from real Lp duality

Statement

Assume the Axiom of Countable Choice ACω. Let (X,A,μ) be any measure space, let 1<p<∞, and let q be conjugate to p. Every bounded complex-linear functional Λ:Lp(μ;C)→C has a unique h∈Lq(μ;C) such that

Λ([f])=∫Xfh dμ([f]∈Lp(μ;C)),

where the pairing is bilinear, with no conjugation. Moreover ∥Λ∥=∥h∥q.

Facts & Assumptions

Given: ACω, an arbitrary measure space, conjugate exponents 1<p,q<∞, and a bounded complex-linear Λ:Lp(μ;C)→C.

[F1]

Under Countable Choice, every bounded real-linear functional on real Lp over an arbitrary measure space is uniquely integration against a real Lq density, with equality of norms (For 1<p<∞, the same representation theorem holds on arbitrary measure spaces).

[F2]

Complex Lp is the a.e. quotient of measurable finite-valued complex functions with finite p-norm; real and imaginary parts, conjugation, products, and positive powers have the stated measurability conventions, and bilinear tests use ∫fs without conjugation (Complex Lp classes and Euclidean test-function conventions).

[F3]

Complex Hölder makes the bilinear pairing bounded, and complex Lp has the quotient norm with ∥f‾∥p=∥f∥p (Complex Holder, Minkowski, and the quotient norm).

[F4]

Countable Choice selects from every countable family of nonempty sets (The Axiom of Countable Choice (ACω)).

Proof

technique · represent the real and imaginary parts on the real-valued subspace, then use a normalized phase test for the norm and uniqueness
1.1F1F2F3given

Regard real Lp(μ) as the real-valued subspace of complex Lp(μ;C). The maps A(u)=Re⁡Λ(u) and B(u)=Im⁡Λ(u) are bounded real-linear functionals there, with ∣A(u)∣,∣B(u)∣≤∥Λ∥∥u∥p. Applying [F1] twice gives real a,b∈Lq(μ) such that A(u)=∫ua and B(u)=∫ub for every real u∈Lp. Put h=a+ib∈Lq(μ;C); component inequalities in [F3] make its q-norm finite.

2.1F2F3step 1.1algebra

For real-valued u, componentwise complex integration gives Λ(u)=A(u)+iB(u)=∫u(a+ib)=∫uh. If f=u+iv is an arbitrary complex Lp class, [F3] puts its real and imaginary parts in real Lp, and complex linearity gives Λ(f)=Λ(u)+iΛ(v)=∫uh+i∫vh=∫fh. All identities depend only on a.e. classes by the quotient and integration conventions in [F2]–[F3].

3.1F2F3step 2.1algebra

Hölder [F3] gives ∣∫fh∣≤∥f∥p∥h∥q, hence ∥Λ∥≤∥h∥q. If h=0 a.e., step 2.1 gives Λ=0 and equality follows. Otherwise define v=0 on {h=0} and v=∣h∣q−2h‾ where h≠0. Then ∣v∣=∣h∣q−1 and vh=∣h∣q pointwise. Since (q−1)p=q, [F2]–[F3] give v∈Lp, ∥v∥p=∥h∥qq−1, and Λ(v)=∫∣h∣q=∥h∥qq. Testing on v/∥v∥p proves ∥Λ∥≥∥h∥q, including the closed unit-norm endpoint.

4.1F2F3step 3.1discharge-contradiction

If k∈Lq(μ;C) gives the same pairing functional, put d=h−k. Then ∫fd=0 for every f∈Lp. If d were nonzero, the phase test of step 3.1 with d in place of h would produce v∈Lp with ∫vd=∥d∥qq>0, a contradiction. Thus d=0 in Lq, so the density is unique.

5.1F1F4step 1.1step 2.1step 3.1step 4.1∎

Steps 2.1–4.1 prove existence, equality of norms, and uniqueness. Countable Choice is used only inside the real arbitrary-measure representation [F1], whose construction makes countably many local choices; applying that theorem to A and B requires only two instances and no stronger choice principle. The empty and zero-measure spaces have only zero Lp classes and are covered by the h=0 branch of step 3.1; the forbidden endpoints p=1,∞ never enter because 1<p,q<∞.

Remarks

The absence of a conjugate in the displayed pairing is deliberate. It is why the phase test contains h‾: multiplication then gives the nonnegative real function ∣h∣q.

Depends on

Dependency tree · 2 levels

Sources