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

Projected contact dynamics and explicit projection Euler step

Definition

Let d≥1, let C⊆Rd be nonempty, closed, and convex, and let PC(y) be the unique nearest point in C to y, whose existence and uniqueness are Every point has a unique nearest point in a nonempty closed Euclidean convex set. For x∈C, set NC(x)={n∈Rd:⟨n,z−x⟩≤0 for every z∈C}; for x∉C, set NC(x)=∅. On C this is the outward normal cone of Scaled KKT residual and convex normal cone. The projection variational inequality of Metric projection onto a closed convex set satisfies the variational inequality says PC(y)=p exactly when p∈C and y−p∈NC(p).

For T>0, a solution of the projected contact dynamics with forcing f:[0,T]×C→Rd and initial state x0∈C is an absolutely continuous map x:[0,T]→C satisfying f(t,x(t))−x˙(t)∈NC(x(t))for almost every t∈[0,T]. Equivalently, x˙(t)+NC(x(t))∋f(t,x(t)). For an integer N≥1, put h=T/N, tk=kh, and define the exact explicit projection Euler nodes by xk+1=PC(xk+hf(tk,xk)),k=0,…,N−1, starting from x0. Its affine interpolant joins consecutive nodes linearly on each interval [tk,tk+1].

For a map x:[0,T]→Rd, absolutely continuous means that each coordinate is absolutely continuous in the scalar sense of Absolute continuity on a compact interval, and x˙(t) is the vector of coordinate derivatives, from The derivative f′(c)=lim⁡x→cf(x)−f(c)x−c of f:A→R at a point c∈A that is a limit point of A, and differentiability on a set, wherever they all exist. The solution condition requires a Lebesgue-null set N⊆[0,T] such that for every t∉N all coordinate derivatives exist and the displayed inclusion holds. Here almost every t is relative to Lebesgue measure λ from Lebesgue measurable sets, the family L(Rn), and the restricted set function λn, with the convention of Measure-null sets and almost-everywhere statements relative to a measure.

Depends on

Used by

Dependency tree · two levels

39 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