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.
Nitsche methods for weak boundary enforcement — Examples
1 · Prerequisites
- Absolute and Conditional Convergence; Rearrangement; Products
- Areas of Elementary Plane Figures
- Bessel-Potential Completions and Real-Order Sobolev Spaces
- Binary Operations, Monoids, Groups and Subgroups
- Bounded Linear Operators and Quotient Spaces
- Céa and Aubin–Nitsche error estimates
- Compactness
- Compactness in Metric Spaces
- Completeness, Completion, and Uniform Continuity
- Complex Lp Spaces and Test-Function Conventions
- Complex Norms and Realification
- Complexification, Realification and Real Structures
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Continuity, IVT, EVT, and Uniform Continuity
- Convexity
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Countability Axioms and Cardinal Functions
- Darboux, L'Hôpital, and Taylor's Theorem
- Density Separability and Convolution in Lᵖ
- Determinants of Matrices over a Commutative Ring
- Distributions Test Functions and Differentiation
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Dual Spaces Adjoint Operators and Annihilators
- Dual Spaces, Bilinear and Quadratic Forms, and Sylvester's Law of Inertia
- Filters and Ultrafilters
- Finite Counting, Factorials and Binomial Coefficients
- Finite Dimensional Normed Spaces and Riesz Lemma
- Finite Probability and the Probabilistic Method
- Finite-element meshes and interpolation
- Foundations of the Real Numbers for Analysis
- Fourier Multipliers and Sobolev Characterisations
- Fourier Transform Convolution and Approximate Identities
- Fubini and Change of Variables
- Fundamental Trigonometric Identities
- Gaussian Elimination, Elementary Matrices and Reduced Row Echelon Form
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Hilbert Space Geometry and Riesz Representation
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Improper and Parameter-Dependent Multiple Integrals
- Improper Integrals
- Inner Product Spaces, Gram-Schmidt, Projections and Adjoints
- Lax--Milgram and Weak Elliptic Solutions
- Lebesgue Measure on Euclidean Space
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Matrices, the Matrix of a Linear Map, and Change of Basis
- Measurable Functions and Simple Approximation
- Measures and Their Basic Properties
- Metric Spaces
- Mixed Partials, Taylor Formulae, and Extrema
- Modes of Convergence Egorov and Lusin
- Monotone Functions, Discontinuities, and Continuity Sets
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Nitsche methods for weak boundary enforcement
- Normal Subgroups and Quotient Groups
- Normed and Banach Spaces
- Norming and Separation under Hahn–Banach
- Order, Zorn's Lemma, and the Axiom of Choice
- Orthonormal Bases, Parseval and Fourier Series
- Outer Measure and the Caratheodory Extension Theorem
- Pointwise Extended-Real Function Products
- Polynomial Rings, the Division Algorithm and Roots
- Power Series and Real-Analytic Functions
- Product Measures and the Fubini Tonelli Theorems
- Properties of the Integral and the Working FTC
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Rⁿ as a Normed Space; Vector-Valued Functions
- Roots, Rational Powers, and Classical Inequalities
- Schwartz Space and the Plancherel Theorem
- Separation Axioms: the Hierarchy
- Sequences and Limits
- Sequences and Series of Functions; Uniform Convergence
- Series: Convergence and the Nonnegative Tests
- Sigma Algebras and Borel Sets
- Simple Field Extensions and the Construction of the Complex Numbers
- Sine, Cosine, and the Definition of Pi
- Smooth Approximation and Sobolev Extension
- Smooth Manifolds and Smooth Maps
- Smooth Partitions of Unity and Exhaustions
- Sobolev Poincare and Morrey Inequalities
- Subspaces, Products, and Quotients
- Suprema and Infima
- Symmetric Groups, Cycle Decomposition and the Sign Homomorphism
- Tangent Cotangent and the Differential
- Tempered Distributions and the Fourier Transform
- The Analytic Hahn Banach Theorem
- The Cantor Set, Baire Category, and Measure Zero in ℝ
- The Complex Exponential and Euler's Formula
- The Derivative and the Mean Value Theorems
- The Exponential Function
- The Inverse and Implicit Function Theorems
- The Lebesgue and Riemann Integrals Compared
- The Lebesgue Integral and the Convergence Theorems
- The Logarithm and General Powers
- The Lᵖ Spaces Holder Minkowski and Riesz Fischer
- The Maximal Function and Lebesgue Differentiation
- The Riemann Integral in Rᵐ and Jordan Content
- The Riemann Integral: Definition and Integrability
- The Topology of Euclidean Space
- The Total Derivative in ℝᵐ → ℝⁿ
- The ZFC Axioms and the Basic Set Constructions
- Topological Spaces and Continuity
- Topology of ℝ
- Triangularisation, Generalised Eigenspaces and Jordan Canonical Form
- Vector Spaces, Linear Subspaces, Span and Direct Sums
- Weak Derivatives and Sobolev Spaces
2 · Summary
These examples check the sufficient penalty threshold against a penalty-free constant mode, show that affine boundary data can be recovered exactly by weak imposition, and use the proved fractional weak Green identity to isolate the boundary-flux term responsible for the symmetric/nonsymmetric difference in the duality argument.
3 · Logical flowchart
4 · Definitions, theorems and proofs
None yet.
5 · Examples, counterexamples and false statements
Exact affine data under weak imposition
Example
Assume Countable Choice. Let be the open reference triangle with its one-cell mesh, let , and take , , and . Then the weak Nitsche equations have whenever the penalty is above the corresponding coercivity threshold. The same is the exactly representable strongly imposed solution.
The faces are , , and . The arrows are their outward unit normals; the exact boundary fluxes are , , and , respectively.
Facts & Assumptions
Given: Countable Choice; the reference triangle, , , , and a degree- conforming polynomial space; the form definitions Symmetric and nonsymmetric Nitsche boundary forms; and the affine simplex Gauss–Green formula Gauss–Green formula on an affine simplex.
For , , , and the boundary normal derivative is on each straight facet.
If is a nondegenerate affine simplex and , then (Gauss–Green formula on an affine simplex).
Above the stated threshold, each form is coercive (Nitsche coercivity above the inverse-trace threshold).
A function that is polynomial on each cell and belongs to has zero classical boundary restriction on every boundary facet (Zero facet traces of functions in H1_0 on an affine mesh).
Verification
Given: The one-cell triangle and the data in [F1]–[F3].
The function is affine, hence belongs to for every , and it has the prescribed trace . Apply [F2] to : since , its divergence is , and its boundary flux is . Thus the volume term in cancels its first boundary-flux term. The remaining term is , exactly because .
For , the extra form term is , and the extra load term is ; these agree since . Thus satisfies both weak equations. Coercivity [F3] implies uniqueness: the difference of two solutions obeys for every , so testing gives and hence . Therefore . For strong imposition, has the required boundary trace and satisfies the Poisson weak equation on each test in : the simplex Green identity [F2] and the zero boundary restriction [F4] make its boundary flux term vanish. Thus it is the strong Galerkin solution as well.
Penalties below and above the Nitsche coercivity threshold
Example
Assume Countable Choice and take any nondegenerate bounded simplex with its one-cell matching mesh and degree- space, . For either Nitsche sign , the algebraic penalty-free boundary form, obtained by evaluating the displayed formula at zero penalty, is not coercive: the constant function has zero gradient and zero form value but positive boundary part in . In contrast, any satisfies the sufficient coercivity threshold of Nitsche coercivity above the inverse-trace threshold. The example shows failure at zero and success above the proved bound; it does not claim that every positive penalty below that sufficient bound fails on every mesh.
Facts & Assumptions
Given: Countable Choice; one bounded simplex with all facets boundary; ; a constant trial function; the form and energy seminorm of Symmetric and nonsymmetric Nitsche boundary forms; and the coercivity result Nitsche coercivity above the inverse-trace threshold.
At , because and ; the energy seminorm has (Symmetric and nonsymmetric Nitsche boundary forms).
If , then with (Nitsche coercivity above the inverse-trace threshold).
Verification
Given: The one-cell simplex setup and the data in [F1]–[F2].
For , each volume-gradient and normal-flux term in the definition vanishes. At the penalty term vanishes too, so . Since each facet has positive measure and , the finite sum is positive; hence no positive coercivity constant can bound this form below by .
For any strictly above the displayed threshold, [F2] gives the positive constant and proves coercivity on the entire finite-element space, including the constant function. This establishes the stated below/above comparison without making a necessity claim for intermediate positive penalties.
Symmetric cancellation and the nonsymmetric L2 boundary defect
Example
Assume Countable Choice. On the unit reference triangle, the affine function gives a finite witness that the symmetric form contains an extra adjoint-consistency term: . In the duality calculation for an error and a zero-trace adjoint solution , that same term cancels the boundary flux in the symmetric identity. It is absent from the nonsymmetric form, which leaves the separate pairing .
Facts & Assumptions
Given: Countable Choice; the unit triangle; ; the symmetric and nonsymmetric forms of Symmetric and nonsymmetric Nitsche boundary forms; and an error/adjoint pair in the hypotheses of both L2 theorems, including their stated regularity assumptions.
On the diagonal, by the two form definitions (Symmetric and nonsymmetric Nitsche boundary forms).
A function in has zero boundary-facet trace (Zero facet traces of functions in H1_0 on an affine mesh).
Under the exact and adjoint regularity/PDE hypotheses stated in the two L2 theorems, the fractional weak Green supplier proves their Green identities and interior flux cancellation (Fractional weak Green identity and interior flux cancellation).
Verification
Given: The finite triangle calculation and the duality setup in [F3].
The triangle has edges , , and . On the first edge ; on the second ; on the diagonal , , and the arclength parametrization has . Therefore . Substitution in [F1] gives the asserted finite difference .
For the adjoint Poisson equation, [F3] gives . The symmetric form contains the transposed term ; after subtracting the zero-trace discrete test, the remaining flux is paired with the adjoint interpolation error. The nonsymmetric form has no transposed consistency term; its zero-trace discrete tests satisfy , leaving the full pairing in the error identity. Thus the symmetric method reduces the adjoint boundary defect to an approximation residual, while the nonsymmetric method retains it. The zero boundary traces used here follow from [F2], and the two theorem items retain their distinct hypotheses and rates.