Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generated
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 U⊂Rd be a bounded Lipschitz domain, let Γ⊆∂U be closed, let L be a differential operator on U, and let B be a boundary operator on Γ. Let f:U→R and g:Γ→R be target data. For a trial function h, define its residuals by rh(x)=L[h](x)−f(x) and qh(x)=B[h](x)−g(x). For 0<α≤1 and a function v on a set E, define its Hölder seminorm by [v]α;E=sup⁡x≠y∈E∣v(x)−v(y)∣∣x−y∣α. Set [v]α;E=0 when E has fewer than two points. Only trial functions for which L[h] on U and B[h] on Γ are pointwise defined and finite are admitted. For the population loss, require f,rh to be measurable with respect to (U,μr) and g,qh to be measurable with respect to (Γ,μb). For positive fixed weights λr,λb and probability measures μr on U, μb on Γ, the population loss is Loss⁡PINN(h;λ)=λr∫U∣rh∣2 dμr+λb∫Γ∣qh∣2 dμb. These nonnegative population integrals take values in [0,+∞], so they may be infinite. The Hölder seminorms below may likewise be infinite.

For d≥2, given positive integer counts mr,mb, residual collocation points xr1,…,xrmr, and boundary collocation points xb1,…,xbmb, the empirical loss is Loss⁡mPINN(h;λ)=λrmr∑i=1mr∣rh(xri)∣2+λbmb∑j=1mb∣qh(xbj)∣2. For d=1, a bounded Lipschitz domain has finite boundary, so Γ is finite. In this branch require every singleton {y}⊆Γ to be μb-measurable. When every point of Γ is available deterministically, define its exact full-boundary contribution by Loss⁡PINN,b(h;λb)=λb∑y∈Γμb({y})∣qh(y)∣2=λb∫Γ∣qh∣2 dμb, and, for a positive integer count mr and residual collocation points xr1,…,xrmr, set Loss⁡mPINN(h;λ)=λrmr∑i=1mr∣rh(xri)∣2+Loss⁡PINN,b(h;λb). For d≥2, its Hölder-regularized version is Loss⁡m(h;λ,λmR)=Loss⁡mPINN(h;λ)+λr,mR[L[h]]α;U2+λb,mR[B[h]]α;Γ2. For d=1, the Hölder-regularized version is Loss⁡m(h;λ,λmR)=Loss⁡mPINN(h;λ)+λr,mR[L[h]]α;U2; 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

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.

Sources