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.
A planar rigid motion is controlled by its trace on a segment
Statement
Let be a fixed straight segment of length in the geometry of Partial-trace displacement space on a polygon. For every planar infinitesimal rigid motion , where , , and , there is a constant such that
Facts & Assumptions
Given: A bounded polygon , a straight Dirichlet segment of positive length, and an affine rigid motion .
On fields with a representative extending continuously to the closed Dirichlet collar , agrees with that extension's boundary restriction to ; in particular this holds for fields in . (Partial-trace displacement space on a polygon, The trace operator on a bounded domain)
The Axiom of Choice is inherited through the fixed C1 trace interface defining . (The Axiom of Choice, Partial-trace displacement space on a polygon)
Proof
Given: parametrizes by arclength for , with , and .
The globally affine rigid motion is continuous on , so [F1] identifies with its boundary restriction. Put and decompose with . Since is a quarter-turn, . Integrating the two orthogonal components and completing the square in gives .
The last term of step 1.1 controls , the first controls , and the middle term together with controls ; hence . Because and is bounded, direct integration of and its constant gradient gives . If the trace vanishes, this also forces and .
Depends on
Used by
Dependency tree · two levels
19 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
- Walter Zulehner, Numerical Methods for Continuum Mechanics 1, complete 80-page lecture notes (standard reference, not scraped)
- Jean-Luc Guermond, MATH 661 Fall 2025, Part XI Chapter 53: Stokes equations: Basic ideas (standard reference, not scraped)