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.
Sobolev threshold for Lagrange point evaluations on a reference simplex
Statement
Assume the Axiom of Choice. Let , let , choose , and let be an integer. If and , then each point evaluation has a unique continuous-representative value and If , the same conclusion holds for every . Consequently any finite set of Lagrange nodal evaluations is bounded on the stated Sobolev space and defines a well-defined degree-of-freedom functional there. No boundedness at is asserted.
Facts & Assumptions
Given: The Axiom of Choice, , integer , the reference simplex, and the exponent in the appropriate branch.
The Axiom of Choice states that every family of nonempty sets has a choice function. (The Axiom of Choice)
The reference simplex is a bounded extension domain for every integer Sobolev order and exponent. (A reference simplex is an integer-order Sobolev extension domain)
On a bounded extension domain, if , higher-order Sobolev embedding gives a continuous representative and a norm bound; its proof assumes the Axiom of Choice. (Higher-order Sobolev embedding)
For finite , the Sobolev norm is the norm of the finite vector of derivative norms; for it is their maximum. (Integer-order Sobolev spaces and their norms)
Holder's inequality on the finite-measure simplex sends each bounded derivative into every finite space with the expected measure factor. (Holder's inequality for integrals, including the endpoint cases)
The reference finite-element convention requires a unisolvent list of linear functionals on its finite-dimensional space and chosen bounded extensions to the interpolation domain. Thus, for nodal degrees of freedom of such an element, the Sobolev evaluation maps must extend the polynomial evaluations; unisolvence is a separate hypothesis. (Reference finite elements and unisolvent degrees of freedom)
Proof
Suppose and . Then , so apply [F2] with , , and extension domain [F1]. It gives a continuous representative on the closed simplex and a bound for its supremum by . Two continuous representatives of the same almost-everywhere class agree everywhere: if their difference were nonzero at a point of the closed simplex, continuity on the closure and the fact that the simplex is the closure of its interior would give a nonempty interior ball on which the difference stays nonzero, contradicting almost-everywhere equality. Thus every is uniquely defined and obeys the displayed bound.
If , choose any finite . Since the simplex has finite volume, [F4] gives for , so continuously. The same simplex extension result [F1] and embedding [F2], now with and , give a unique continuous representative and the required bound by . In either branch, evaluation is linear because a linear combination of continuous representatives is the unique continuous representative of the corresponding Sobolev class. On a polynomial it is the ordinary nodal value, so these bounded maps extend any prescribed nodal degrees of freedom as required by [F5], without asserting unisolvence of an arbitrary node list; for , the nodes have a common bound by taking the maximum of their constants, while for the assertion is vacuous and any finite constant, such as , suffices.
Depends on
Used by
Dependency tree · two levels
46 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
- Jean-Luc Guermond, MATH 661 Fall 2025, Chapter 11 (standard reference, not scraped)
- Juha Kinnunen, Sobolev Spaces (Aalto University, 2026) (standard reference, not scraped)