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.

Conforming nodal P1 Signorini contact discretization

Definition

Let (Th) be a family of matching, boundary-conforming, shape-regular affine triangular meshes of the polygon from Partial-trace displacement space on a polygon, with h:=max⁡K∈Thdiam⁡(K). Assume both ΓD and ΓC are unions of boundary edges of each mesh, and let NhC be the vertices on ΓC. The conforming continuous P1 displacement space is Vh:={vh∈V∩C(Ω‾;R2):vh∣K∈P1(K;R2) for every K∈Th}. For continuous ψ on ΓC, let Ihψ be its continuous piecewise-affine nodal interpolant on the contact edges. Under the additional obstacle hypotheses ψ≤0 and convexity of ψ in arclength on ΓC, define Kh:={vh∈Vh:vh(a)⋅n≥Ihψ(a) for every a∈NhC}. The nodal inequalities are exactly the plan's vertex constraints. The well-definedness and conformity claims are proved in The convex-obstacle nodal set is conforming ↗.

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