Alphabeta Math
AlgorithmAlgorithm: 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.

Empirical Hölder-regularized PINN objective

Definition

Inputs are a dimension d≥1, the data and operators specified in the physics-informed residual loss definition, 0<α≤1, positive weights λr,λb, and an admissible trial function h. The procedure returns the scalar empirical objective value Jm(h). It uses the realized sample points and target values as inputs; it does not generate random samples.

For d≥2, also supply positive integer counts mr,mb, residual samples xr1,…,xrmr∈U with their observed values f(xri), boundary samples xb1,…,xbmb∈Γ with their observed values g(xbj), constants cr,cb,Cr,Cb>0, and small-scale cutoffs ℓ0,i,ρ0,i>0. At the selected partition scales 0<ℓi≤ℓ0,i, require cells Ujℓr and Γjℓb with masses at least crℓrd and cbℓbd−1, each contained in a cube of side ℓi. Require upper ball-mass bounds μr(B‾ρ(x)∩U)≤Crρd and μb(B‾ρ(y)∩Γ)≤Cbρd−1 for every center and for all 0<ρ≤ρ0,i. The admissible counts satisfy, for i∈{r,b}, mi≥max⁡{1,ci−2ℓ0,i−2si,ci−2dsiρ0,i−2si}, so the computed partition scales and fill radii lie in the specified ranges.

For d=1, supply a positive integer mr, residual samples xr1,…,xrmr∈U with observed values f(xri), constants cr,Cr>0, and cutoffs ℓ0,r,ρ0,r>0. At the residual scale ℓr below, require a finite measurable partition with each cell contained in an interval of length ℓr and mass at least crℓr, and require upper ball-mass bounds μr(B‾ρ(x)∩U)≤Crρ for every center x∈U and all 0<ρ≤ρ0,r. The admissible count satisfies mr≥max⁡{1,cr−2ℓ0,r−2,cr−2ρ0,r−2}, so ℓr=δr is in the specified ranges. Supply the observed boundary values at every point of the finite set Γ with their masses μb({y}). No random boundary sample or boundary sample count is used.

For d≥2, set sr=d, sb=d−1, and, for i∈{r,b}, compute ℓi=(cimi)−1/si,δi=d ℓi,κi=Ci/ci, Cm=3max⁡i∈{r,b}{κidsi/2mi1/2},λ^i,mR=3λiδi2αCm. For d=1, compute ℓr=δr=(crmr)−1,κr=Cr/cr,Cm=3κrmr1/2, λ^r,mR=3λrδr2αCm=λrcr−2ακrmr−α−1/2,λ^b,mR=0. For d≥2, use supplied regularization weights λi,mR satisfying λi,mR≥λ^i,mR componentwise; for a sequence of sample counts also require ∥λmR∥∞=O(∥λ^mR∥∞). For d=1, set λb,mR=0 and choose λr,mR≥λ^r,mR, 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 Jm(h)=Loss⁡m(h;λ,λmR) using the realized residual values, the realized boundary values when d≥2, the exact weighted full-boundary contribution when d=1, and the residual seminorm penalty when d=1 or both seminorm penalties when d≥2. The regularization thresholds are the source's exact thresholds and cannot be replaced by a generic positive penalty.

Remark

For d≥2, the exact residual and boundary threshold coordinates are λ^r,mR=3λr(d)2αcr−2α/dmr−α/dCm,λ^b,mR=3λb(d)2αcb−2α/(d−1)mb−α/(d−1)Cm, where Cm=3max⁡{(Cr/cr)(d)dmr1/2,(Cb/cb)(d)d−1mb1/2}. For d=1, the residual threshold is λ^r,mR=(λrcr−2α/κr)mr−α−1/2, with κr=Cr/cr, 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-ε>0 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

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.

Sources