Alphabeta Math
AlgorithmAlgorithm: AI-adaptedProof: Not applicablePipeline-generatedjudge pass (gpt-6-luna)
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.

Backward-Euler convex splitting for Allen–Cahn and Cahn–Hilliard

Definition

Let Xh be either finite-dimensional realization in No-flux finite-volume and conforming realizations for phase fields, with real inner product ⟨⋅,⋅⟩h, constant vector 1, self-adjoint nonnegative Ah with kernel span⁡{1}, and Ah† from Kernel, range, and mean-zero inverse for the no-flux Laplacian. Let Pc,h,Pe,h:Xh→R be the differentiable convex energy components specified there; ∇hP denotes the Riesz gradient relative to ⟨⋅,⋅⟩h. Put Eh(u)=κ2⟨Ahu,u⟩h+Pc,h(u)−Pe,h(u),μh(u,v)=κAhu+∇hPc,h(u)−∇hPe,h(v). Given un∈Xh, τ>0, and M>0, the backward-Euler convex-splitting step is:

  1. Allen–Cahn branch. Return the minimizer over v∈Xh of JAC(v)=12Mτ∥v−un∥h2+κ2⟨Ahv,v⟩h+Pc,h(v)−⟨∇hPe,h(un),v⟩h, and set μn+1=μh(un+1,un).

  2. Cahn–Hilliard branch. Restrict to the affine set ⟨v,1⟩h=⟨un,1⟩h and return the minimizer of JCH(v)=12Mτ⟨Ah†(v−un),v−un⟩h+κ2⟨Ahv,v⟩h+Pc,h(v)−⟨∇hPe,h(un),v⟩h, then set μn+1=μh(un+1,un).

For the finite-volume realization, Pc,h(u)=∑K∣K∣Fc(uK) and Pe,h(u)=∑K∣K∣Fe(uK). For the conforming interval realization, these are the exact integrals of Fc and Fe over the reconstructed piecewise-affine state. The recurrence, minimizer equivalence, uniqueness, conservation, and energy bounds are proved in Existence, uniqueness, mass conservation, and energy decay of a convex-splitting step ↗. This is the selected backward-Euler branch; it asserts no ARS(2,2,2), Lie, or Strang property.

Depends on

Used by

Dependency tree · two levels

11 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