Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-6-luna)
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.

Poincare–Wirtinger inequality on a reference simplex

Statement

Assume Countable Choice. For every 1≤p<∞ there is Cd,p<∞ such that for all u∈W1,p(S^d;R), ∥u−uS^d∥Lp(S^d)≤Cd,p∣u∣W1,p(S^d),uS^d:=∣S^d∣−1∫S^du dx.

Facts & Assumptions

Given: Countable Choice, the bounded convex reference simplex and 1≤p<∞.

[F1]

Smooth functions on a neighbourhood of the closed simplex are dense in W1,p(S^d). (Smooth functions are dense in finite-order Sobolev spaces on a reference simplex)

[F2]

Along a segment, the fundamental theorem gives the integral of the directional derivative, bounded by segment length times the integral of ∣∇u∣. (If f:[a,b]→Rm is differentiable with integrable f′ then ∫abf′=f(b)−f(a); and a bounded derivative makes f Lipschitz)

[F3]

Jensen bounds the pth power of an average by the average of the pth powers; Tonelli/Fubini permits the pair and parameter integrals; Holder controls integrals on the finite-measure simplex; affine change of variables has its determinant factor. (Jensen's integral inequality for a probability measure, Tonelli and Fubini for the completed product, with only almost-everywhere section measurability, Holder's inequality for integrals, including the endpoint cases, A C^1 diffeomorphism satisfies the change-of-variables formula for nonnegative Lebesgue measurable functions)

[F4]

The smooth-density supplier [F1] assumes Countable Choice. (The Axiom of Countable Choice (ACω))

Proof

1.1F2F3given

First take u smooth. For x,y∈S^d, convexity keeps zt=tx+(1−t)y in the simplex. The segment identity and ∣x−y∣≤h:=diam⁡(S^d) give ∣u(x)−u(y)∣p≤hp∫01∣∇u(tx+(1−t)y)∣p dt, by [F2] and Jensen on the unit interval. Jensen again gives ∣u(x)−uS^d∣p≤∣S^d∣−1∫S^d∣u(x)−u(y)∣p dy.

2.1F3step 1.1algebra

Integrate the last bound over x. For t≥1/2, fix y and use x↦tx+(1−t)y; its Jacobian is td, and its image is contained in the simplex, so its integral is at most 2d∫S^d∣∇u∣p. For t≤1/2, fix x and use y↦tx+(1−t)y, whose inverse Jacobian is at most 2d, giving the same bound. Tonelli [F3] therefore yields ∥u−uS^d∥pp≤2dhp∥∇u∥pp. Taking pth roots proves the estimate for smooth u.

3.1F1F4step 2.1algebra∎

For arbitrary u∈W1,p choose smooth uj→u in W1,p by [F1]. Holder on the finite-measure simplex gives ∫uj→∫u, so (uj)S^d→uS^d; also ∥uj−u∥p→0 and ∥∇uj∥p→∥∇u∥p. Passing to the limit in the smooth inequality of step 2.1 proves the statement.

Depends on

Used by

Dependency tree · two levels

76 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