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.
Physics-informed residual loss and Hölder regularization
Definition
Let be a bounded Lipschitz domain, let be closed, let be a differential operator on , and let be a boundary operator on . Let and be target data. For a trial function , define its residuals by and . For and a function on a set , define its Hölder seminorm by Set when has fewer than two points. Only trial functions for which on and on are pointwise defined and finite are admitted. For the population loss, require to be measurable with respect to and to be measurable with respect to . For positive fixed weights and probability measures on , on , the population loss is These nonnegative population integrals take values in , so they may be infinite. The Hölder seminorms below may likewise be infinite.
For , given positive integer counts , residual collocation points , and boundary collocation points , the empirical loss is For , a bounded Lipschitz domain has finite boundary, so is finite. In this branch require every singleton to be -measurable. When every point of is available deterministically, define its exact full-boundary contribution by and, for a positive integer count and residual collocation points , set For , its Hölder-regularized version is For , the Hölder-regularized version is it uses the exact full-boundary contribution above, has no random boundary sample, and has no boundary seminorm penalty. Require the regularization coefficients appearing in either version to be nonnegative; a zero coefficient contributes zero even when its seminorm is infinite. For finite realized sample lists the empirical sums are finite; the regularized objective is allowed to take the value . These are population and empirical functionals; they do not specify an optimization algorithm or assert that training reaches a global minimizer.
Depends on
Used by
- Empirical Hölder-regularized PINN objective Algorithm
- A smooth residual can vanish at every collocation point and remain nonzero in population loss Example
- Gradient descent can stay at a non-global stationary point Example
- Fill-distance control of the population PINN loss Lemma
- Regularized PINN minimizers have vanishing residuals under sample refinement Theorem
Dependency tree · two levels
9 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.