Alphabeta Math
RemarkRemark: Literature-sourcedProof: Not applicablePipeline-generated
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 p=n endpoint: no L∞ or Holder embedding

Remark

Let n≥2. On nonempty bounded C1 domains in Rn (or domains satisfying the all-exponents extension hypothesis of the critical embedding theorem), W1,n embeds into Lq for every finite q but not into L∞, and some W1,n classes have no representative in C0,α(Ω‾) for any α>0. The exponential improvement of Trudinger-Moser and the BMO/John-Nirenberg route to the same integrability are outside this pair's scope and are recorded in the planning scope-denial ledger; the companion page carries the witnesses.

The dimension restriction is essential: on a bounded interval I, every W1,1(I) class has an absolutely continuous representative and satisfies ∥u∥L∞(I)≤∣I∣−1∥u∥L1(I)+∥u′∥L1(I).

Source notes

The endpoint limitation is Kinnunen's Remark 3.16 and the surrounding discussion of the critical exponent, with Hunter's Example 3.30 as the explicit logarithmic witness with Laugesen's Theorem 3.23 supplying the supercritical comparison. This remark records the limitation only: the positive embedding W1,n↪Lq for finite q and the failure of the L∞ and Holder bounds are proved elsewhere on this page and on its companion, and the Trudinger-Moser and BMO routes are deliberately not built in this pair.

Used by

Nothing in the library uses this result yet.

Dependency tree · 0 levels

Nothing. This result depends on no other item in the library.

Sources