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 two-cell hat and quadratic functions belong to H¹₀
Statement
Assume Countable Choice. Let and define Then , the closure of in (Zero-boundary Sobolev space as a norm closure).
Facts & Assumptions
Given: Countable Choice; , the piecewise linear hat function , and the quadratic displayed in Statement.
A function is an class with an weak derivative, defined by integration against compactly supported smooth tests (Integer-order Sobolev spaces and their norms).
is the closure of in the norm (Zero-boundary Sobolev space as a norm closure).
A smooth function and each of its classical derivatives are weak derivatives under Countable Choice (Classical derivatives agree with weak derivatives).
The smooth step is smooth, equals on and on , takes values in , and is given by (The standard smooth step function).
Products and compositions of differentiable functions obey the product and chain rules (Sums, scalar multiples, products and quotients: , , , and when , The chain rule, in one line from Carathéodory: if is differentiable at and is differentiable at , then is differentiable at with ).
A diffeomorphism satisfies the change-of-variables formula for nonnegative Lebesgue-measurable integrands when Countable Choice holds (A C^1 diffeomorphism satisfies the change-of-variables formula for nonnegative Lebesgue measurable functions).
The continuous derivative is bounded on (Extreme value theorem: a continuous real function on a nonempty compact subset of attains a greatest and a least value).
For complex functions, , so these products are integrable and the pairing is bounded (Complex Holder, Minkowski, and the quotient norm).
For an integrable real function , (Integrable real and complex functions, and their integrals).
The interval has measure one, the integral of its indicator is its measure, and the nonnegative integral is monotone (A box in with parameters is Lebesgue measurable of measure , whichever of its faces are included, The nonnegative Lebesgue integral, Monotonicity and nonnegative homogeneity of the nonnegative integral).
Countable Choice is assumed by the Sobolev, zero-boundary, classical weak derivative and integral-change suppliers used here (The Axiom of Countable Choice ()).
Proof
Put . Formula [F4] gives on , hence . Let on ; it is a diffeomorphism with . The continuous functions and satisfy , and [F10] gives , so both are integrable. Applying [F6] separately to these nonnegative functions gives , where the last equality uses antisymmetry. By [F9], . For , define and . By [F4]–[F5], is smooth, equals for and for . Applying [F6] separately to and under , and subtracting by [F9], gives the transition integral ; the two constant pieces cancel, so . For with , the difference quotient of is the average of between and ; its difference from is bounded by , which tends to zero by continuity. Thus and is smooth. It vanishes at both endpoints and agrees with outside . On that interval, almost everywhere, so . Also there and the difference vanishes outside, so .
By [F3], each has weak derivative . The convergence estimates in step 1.1 and [F8] allow passage to the limit in for every , giving , where on the left half and on the right half. Thus . The polynomial is smooth with and both , so [F1] and [F3] give .
Let by [F7], and define . By [F4]–[F5], this smooth cutoff vanishes for and , equals on , and . For the same , on and on . Thus , and on . The function error has squared norm at most . For the derivative difference , the first term has squared norm at most ; the second has modulus at most on a set of length , so its squared norm is at most . Therefore in . Together with step 1.1 this gives .
Using the cutoff from step 2.2, its product with lies in . Since and , . The derivative difference is ; the first term has squared norm at most , and the second is supported on two intervals of total length with modulus at most , so its squared norm is at most . Hence in .
Take the explicit sequence , which lies in and tends to zero. Steps 3.1 and 2.2 approximate and by members of along this sequence. By the closure definition [F2], both classes belong to , as claimed.
Depends on
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
- Integer-order Sobolev spaces and their norms
- The standard smooth step function
- Zero-boundary Sobolev space as a norm closure
- Classical derivatives agree with weak derivatives
- Sums, scalar multiples, products and quotients: $(f+g)'(c) = f'(c) + g'(c)$, $(\alpha f)'(c) = \alpha f'(c)$, $(fg)'(c) = f'(c)g(c) + f(c)g'(c)$, and $(f/g)'(c) = \bigl(f'(c)g(c) - f(c)g'(c)\bigr)/g(c)^{2}$ when $g(c) \ne 0$
- The chain rule, in one line from Carathéodory: if $g$ is differentiable at $c$ and $f$ is differentiable at $g(c)$, then $f \circ g$ is differentiable at $c$ with $(f \circ g)'(c) = f'(g(c))\,g'(c)$
- Extreme value theorem: a continuous real function on a nonempty compact subset of $\mathbb{R}$ attains a greatest and a least value
- Complex Holder, Minkowski, and the quotient norm
- Integrable real and complex functions, and their integrals
- The nonnegative Lebesgue integral
- Monotonicity and nonnegative homogeneity of the nonnegative integral
- A C^1 diffeomorphism satisfies the change-of-variables formula for nonnegative Lebesgue measurable functions
- A box in $\mathbb{R}^n$ with parameters $a_i\le b_i$ is Lebesgue measurable of measure $\prod_{i<n}(b_i-a_i)$, whichever of its faces are included
Used by
Dependency tree · two levels
89 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
- Thomas Richter, Die Finite Elemente Methode für partielle Differentialgleichungen (standard reference, not scraped)