Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: 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.

Locally integrable functions as regular distributions

Definition

Assume Countable Choice for the published injection theorem. Let Ω⊆Rn be open, with n≥1. For u∈Lloc1(Ω), its regular distribution is Tu(φ):=∫Ωu(x)φ(x) dx,φ∈Cc∞(Ω). The integral is finite because φ is bounded and has compact support. The pairing is complex bilinear: there is no conjugation. It depends only on the almost-everywhere class of u, and the induced map Lloc1(Ω)/ ⁣∼a.e.⟶D′(Ω),[u]⟼Tu is complex-linear and injective. The pairing is the regular functional of Regular distribution from a locally integrable function, and the injection is Locally integrable functions embed in distributions under The Axiom of Countable Choice (ACω). Countable Choice is used only for that published injectivity theorem; defining the pairing and its linearity require no choice. If Ω=∅, both spaces contain only zero and the map is the unique injection.

Well-definedness. If u=u~ almost everywhere, then for each test function the integrands agree almost everywhere, so their integrals agree. The published continuity estimate makes every such regular functional a distribution; the published embedding theorem supplies the converse implication Tu=Tu~⇒u=u~ almost everywhere under Countable Choice.

Depends on

Used by

Dependency tree · two levels

17 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