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.
One second-order flat reflection on L² and H²
Statement
Assume AC. Let be an integer and fix ; all function spaces below are over . Write with coordinates . When , is a single point and . Define one linear operator on by It restricts to on , is bounded and maps boundedly into . For , the same formula matches the value and first normal derivative at , in the weak trace sense used by the half-space extension theorem. For every , if almost everywhere on , then almost everywhere on . In particular these smaller bounds leave positive margins inside any larger doubled cylinder with and .
Facts & Assumptions
Given: The hypotheses and conventions of the Statement.
Assume the Axiom of Choice The Axiom of Choice; in particular its countable and dependent instances are available. Its use here is inherited through the weak trace and integration-by-parts interfaces of the half-space supplier in F3; the reflection coefficients are explicit.
Integer-order Sobolev spaces and their norms defines the weak-derivative space, its component-sum norm and almost-everywhere classes.
Integer-order Sobolev extension from a half-space gives the reflection over either scalar field with coefficients solving and . Its Facts F4–F5 and proof step 3.2 establish the required one-sided weak traces and cancellation of interface terms without assuming smooth-up-to-boundary density.
Proof
Goal: Establish every assertion of the Statement under the stated hypotheses.
Given: The hypotheses and data in the Statement.
The moment equations have the solution , so the formula is precisely the operator from the half-space theorem. It already defines a map on every class: the two reflected coordinate maps preserve null sets. Changing variable gives , so the triangle inequality bounds the negative part by . Adding the unchanged positive part gives a finite common bound. Linearity and the restriction identity follow from the formula.
For a multi-index with , the candidate negative-side derivative is . Its norm is at most by the same variable change. The positive-side derivative is . The one-sided traces of order zero and one exist in the half-space theorem’s section sense, and their reflection coefficients are respectively and . In the half-space integration-by-parts identity the potential surface terms for second derivatives are multiples of these two mismatches; both vanish. Tangential derivatives remain on the boundary test function as in that theorem, so no derivative of an unconstructed boundary trace is used. Thus the fields and their positive-side counterparts are the actual global weak derivatives. Summing their squared bounds proves the estimate for the very same map.
Let and suppose vanishes almost everywhere outside in . By the null-set preservation in step 1.1, both negative-side summands vanish almost everywhere whenever or : in the latter case for . The positive side is unchanged, and the hyperplane is a null set, so vanishes almost everywhere outside . If and , these bounds retain margins at the lateral edge when and at the top and bottom of the larger doubled cylinder. For there is no lateral edge. This proves the localization assertion and completes the endpoint construction without an unproved density passage.
Source notes
The matching is justified by the exact existing weak half-space theorem, not by treating even reflection as an H² extension. No external extension theorem or fresh source-reading claim is used.
Depends on
Dependency tree · 2 levels
Each result is drawn at its shortest distance from this item. Arrows run from prerequisites to the items that use them; this item has a heavier outline. External source nodes link directly to the cited text. The view shows up to two dependency steps; open a prerequisite to continue.