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.
Empirical Hölder-regularized PINN objective
Definition
Inputs are a dimension , the data and operators specified in the physics-informed residual loss definition, , positive weights , and an admissible trial function . The procedure returns the scalar empirical objective value . It uses the realized sample points and target values as inputs; it does not generate random samples.
For , also supply positive integer counts , residual samples with their observed values , boundary samples with their observed values , constants , and small-scale cutoffs . At the selected partition scales , require cells and with masses at least and , each contained in a cube of side . Require upper ball-mass bounds and for every center and for all . The admissible counts satisfy, for , so the computed partition scales and fill radii lie in the specified ranges.
For , supply a positive integer , residual samples with observed values , constants , and cutoffs . At the residual scale below, require a finite measurable partition with each cell contained in an interval of length and mass at least , and require upper ball-mass bounds for every center and all . The admissible count satisfies so is in the specified ranges. Supply the observed boundary values at every point of the finite set with their masses . No random boundary sample or boundary sample count is used.
For , set , , and, for , compute For , compute For , use supplied regularization weights satisfying componentwise; for a sequence of sample counts also require . For , set and choose , with the corresponding one-coordinate max-norm order condition across a sequence of counts. If no residual weights are supplied, set them equal to their thresholds.
Finally evaluate and return using the realized residual values, the realized boundary values when , the exact weighted full-boundary contribution when , and the residual seminorm penalty when or both seminorm penalties when . The regularization thresholds are the source's exact thresholds and cannot be replaced by a generic positive penalty.
Definition references
Remark
For , the exact residual and boundary threshold coordinates are where . For , the residual threshold is , with , and the boundary threshold is zero. The weight vector must satisfy the componentwise lower bound and max-norm order condition in the Algorithm.
The original all- sampling quantifier has no probability-measure instances; it is preserved and refuted in the all-scale inconsistency lemma. The small-scale range above is the corrected active sampling convention. No lower-mass constant normalization is implicit in this algorithm.
Depends on
Used by
- The PINN regularization thresholds need not be comparable under the stated count condition Counterexample
- 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
4 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.