Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicablePipeline-generatedjudge pass (gpt-6-sol)audited 2026-09-30
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.

Measurable Hilbert field from a countable fundamental family

Definition

Let (X,B,μ) be a standard-Borel space with a sigma-finite measure on its Borel sigma-algebra; the measure is not assumed complete. A measurable complex Hilbert field with countable fundamental family consists of a separable complex Hilbert space Hx for each x∈X and a sequence of vectors en(x)∈Hx (n∈N) such that x⟼⟨en(x),em(x)⟩Hx is Borel measurable for every n,m, and the complex-linear span of {en(x):n∈N} is dense in Hx for every x. The fibres may be zero-dimensional; no positive lower bound on their dimensions is imposed. The inner product is linear in its first variable, as in the library's complex inner-product convention.

A section is a choice of a vector ξ(x)∈Hx for each x. It is a measurable section when all its fundamental coefficients x⟼⟨ξ(x),en(x)⟩Hx,n∈N, are Borel measurable complex functions. Each en is itself measurable by the Gram-coefficient condition. Pointwise sums and multiplication by a measurable complex scalar function are taken in the corresponding fibres.

Two measurable sections are identified almost everywhere when there is a Borel null set N such that they agree at every x∉N. This formulation works on the given, possibly noncomplete, measure space and does not silently adjoin arbitrary subsets of null sets to B.

Depends on

Used by

Dependency tree · two levels

13 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