Alphabeta Math
Pipeline-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.

Finite-element eigenvalue approximation — Examples

1 · Prerequisites

2 · Summary

The examples compute the conditioning of a nearly dependent basis and verify exact generalized-pencil whitening; exhibit a broken piecewise-constant Dirichlet trial function with zero broken energy; calculate the first Ritz quotient on a conforming square P1 fan mesh; and show that a repeated eigenspace can remain exact while a chosen eigenvector oscillates. The nonconforming example does not satisfy the conforming upper-bound hypotheses, and the square calculation does not assert that its coarse-space gap is small enough for the quadratic error estimate.

3 · Logical flowchart

4 · Definitions, theorems and proofs

None yet.

5 · Examples, counterexamples and false statements

ExampleConstruction: Literature-sourcedVerification: AI-adaptedjudge pass (gpt-6-luna)Open item page →

A nearly dependent finite basis has an ill-conditioned overlap matrix

Example

For 0<ε<1, take the two unit vectors v1=(1,0),v2=(1−ε,2ε−ε2) in R2. Their overlap (Gram) matrix is Sε=(11−ε1−ε1). With the stiffness matrix H=I, the generalized Ritz eigenvalues are 1/(2−ε) and 1/ε. The basis vectors approach one another as ε↓0, while the overlap condition number is (2−ε)/ε. Cholesky whitening changes coordinates but preserves those generalized eigenvalues exactly.

Facts & Assumptions

Given: 0<ε<1, the vectors v1,v2, the Gram matrix Sε, and H=I.

[F1]

Matrix products, conjugate transpose, identity matrices and the overlap matrix convention are as in Rectangular matrix multiplication and the identity matrix In, including zero-sized shapes.

[F3]

Cholesky whitening preserves the eigenvalues and Rayleigh quotients of the generalized Hermitian pencil (Positive-definite overlap whitening preserves a generalized Ritz pencil).

Proof

technique · direct

Given: The two basis vectors and matrices in the example.

1.1F1givenalgebra

Both vectors have norm one and v1Tv2=1−ε, so their Gram matrix is the displayed Sε. Its eigenvectors (1,1) and (1,−1) have eigenvalues 2−ε and ε, both positive. Thus Sε is positive definite and its spectral condition number is (2−ε)/ε. Also ∥v1−v2∥2=2ε, which tends to zero.

2.1F2F3step 1.1givenalgebra∎

For H=I, diagonalizing Sε in the same two eigenvectors shows that Hc=λSεc has eigenvalues λ=(2−ε)−1 and λ=ε−1. The Cholesky factor is L=(101−ε2ε−ε2), so Sε=LL∗ and its positive diagonal makes it the factor in [F2]. By [F3], the whitened Hermitian problem has the same two eigenvalues. For example, at ε=1/N with integer N≥2, the condition number is 2N−1, which grows without bound although whitening is an exact change of coordinates.

Remarks

This calculation concerns exact arithmetic. Whitening removes the overlap matrix from the generalized pencil; it does not make the original basis well-conditioned or provide a finite-precision stability bound.

ExampleConstruction: Literature-sourcedVerification: AI-adaptedjudge pass (gpt-6-luna)Open item page →

A broken piecewise-constant trial space can give an eigenvalue below the Dirichlet ground state

Example

Let Ω=(0,1)2 and divide it into two closed triangles by the diagonal from (0,0) to (1,1). Let w equal 1 on one triangle and 0 on the other. Take degree k=0 and scalar values q=1, so w is a nonzero member of the broken piecewise-constant space. For the broken stiffness form abr(u,v):=∑K∈T∫K∇u⋅∇v‾ dx and mass form b(u,v):=∫Ωuv‾ dx, w is a Ritz eigenvector with eigenvalue 0. The continuous Dirichlet ground-state value λ1 is positive, so this nonconforming value lies strictly below it.

Facts & Assumptions

Given: Countable Choice and the Axiom of Choice; the square Ω; its two-triangle matching mesh; the scalar, degree-zero broken space; and w as defined above.

[F1]

The broken polynomial space consists of cellwise polynomials with no continuity constraint across interior facets; for degree zero it includes the cellwise constants (Matching affine simplicial meshes and shape regularity, Broken and conforming polynomial spaces on a matching mesh).

[F2]

The Dirichlet Laplacian on a nonempty bounded open set has a first eigenvalue λ1>0 under the Axiom of Choice and Countable Choice (The Poincare constant is the reciprocal square root of the first Dirichlet eigenvalue).

Proof

technique · direct

Given: The two cells K1,K2, the broken function w, and the forms abr and b.

1.1F1givenalgebra

Each triangle has area 1/2, so b(w,w)=∫K11 dx=1/2>0. The cellwise gradient of each constant restriction is zero. Hence abr(w,v)=0 for every broken piecewise-constant v, and in particular abr(w,v)=0 b(w,v) for all such v. This is the generalized Ritz equation with eigenvalue zero.

2.1F1F2given∎

The square is nonempty, open and bounded, so [F2] gives λ1>0. Therefore the broken Ritz eigenvalue 0 is strictly less than λ1. The usual conforming min–max conclusion does not apply to this trial space: the two traces of w across the diagonal differ, so w is outside the conforming subspace in [F1]. Moreover, the broken stiffness form is only a seminorm on this piecewise-constant space.

Remarks

The example identifies why conformity and coercivity are hypotheses of the upper-bound theorem. It does not say that every nonconforming discretization underestimates the ground state.

ExampleConstruction: Literature-sourcedVerification: AI-adaptedjudge pass (gpt-6-luna)Open item page →

A conforming P1 Dirichlet discretization gives a first Ritz upper bound

Example

Let Ω=(0,1)2 and put z0=(0,0), z1=(1/2,0), z2=(1,0), z3=(1,1/2), z4=(1,1), z5=(1/2,1), z6=(0,1), z7=(0,1/2) in counterclockwise order; these divide each side into two boundary edges. Let c=(1/2,1/2). The eight triangles Kj=conv⁡{c,zj,zj+1}, with indices modulo 8, form a matching affine triangulation. Let ϕ be the continuous piecewise-linear hat with value 1 at c and value 0 at each zj. Its trace vanishes on the boundary. The one-dimensional conforming Ritz space Vh=span⁡{ϕ} has first Ritz value 24; hence the exact Dirichlet ground-state eigenvalue satisfies λ1≤24.

Facts & Assumptions

Given: Countable Choice and the Axiom of Choice; the square, the eight triangles, the hat function ϕ, and the Dirichlet Laplacian forms a(u,v)=∫Ω∇u⋅∇v‾ and b(u,v)=∫Ωuv‾.

[F2]

The exact symmetric Dirichlet spectrum has a nondecreasing eigenvalue list, and its first eigenvalue is the attained minimum of the Rayleigh quotient (the Courant–Fischer theorem assumes both Choice and Countable Choice) (Discrete spectrum of a symmetric elliptic Dirichlet operator, The Courant-Fischer min-max principle for elliptic eigenvalues).

Proof

technique · direct

Given: The conforming mesh, nodal hat ϕ, and the continuous and discrete Dirichlet Rayleigh quotients.

1.1F1givenalgebra

Adjacent triangles share the same endpoint values of ϕ, so their linear traces agree on each interior edge. The boundary edges have zero values at both endpoints, so their linear traces vanish identically. Thus [F1] places ϕ in H01(Ω). It is nonzero because ϕ(c)=1. Each triangle has base length 1/2, height 1/2 and area 1/8; the hat changes from 1 at c to 0 across height 1/2, so ∣∇ϕ∣=2 on each cell. Therefore a(ϕ,ϕ)=8⋅18⋅22=4.

1.2givenalgebra

On a triangle, ϕ is the barycentric coordinate of c. On the reference triangle {(x,y):x>0,y>0,x+y<1}, direct integration gives ∫01∫01−xx2 dy dx=112=16(12). An affine change of variables preserves the ratio of this integral to the triangle area, so ∫Kjϕ2=∣Kj∣/6=1/48. Summing the eight cells gives b(ϕ,ϕ)=1/6.

2.1F1F2step 1.1step 1.2algebra∎

Because Vh is one-dimensional, its sole Ritz value is its Rayleigh quotient, λh,1=a(ϕ,ϕ)/b(ϕ,ϕ)=4/(1/6)=24. By [F2], the continuous first eigenvalue minimizes the same quotient over all nonzero H01 functions. Since ϕ is an admissible nonzero function by step 1.1, λ1≤a(ϕ,ϕ)/b(ϕ,ϕ)=24=λh,1.

Remarks

This exact calculation verifies the fixed-index conforming upper bound for one mesh. It does not check the small best-approximation-gap premise needed for the quadratic error estimate on this particular coarse space.

ExampleConstruction: Literature-sourcedVerification: AI-adaptedOpen item page →

A repeated eigenspace can be stable while chosen eigenvectors oscillate

Example

Let I:={1,2,…}, H=ℓ2(I,R), and define λ1=λ2=1 and λj=j for j≥3. Give V={u=(uj)j∈I:∑j≥1λj∣uj∣2<∞},∥u∥V2:=∑j≥1λj∣uj∣2,a(u,v):=∑j≥1λjujvj. Let J:V↪H be inclusion. It is a compact injective map with dense range; the first eigenvalue 1 has eigenspace E=span⁡{e1,e2} and is separated from λ3=3. Use the constant conforming trial spaces Vn=E for every positive integer n. Then each repeated Ritz eigenspace En equals E, so the subspace gap is zero, while a valid choice of unit Ritz eigenvector may alternate between e1 and e2 and therefore fail to converge.

Facts & Assumptions

Given: Countable Choice; the index set I, real Hilbert space H, weighted space V, form a, inclusion J, and weights λj defined above; E=span⁡{e1,e2}; and Vn=E for every n≥1.

[F1]

The space ℓ2(I,R) is defined by finite square sums, with its standard inner product and finite-tail property (Square-summable families on an arbitrary index set and the space ℓ2(I)).

[F2]

Every Cauchy sequence of real numbers converges (The reals are complete).

[F3]

A bounded Hermitian coercive form on a Hilbert space induces the energy inner product; a compact injective dense inclusion gives the compact coercive-form spectrum (Bounded, coercive and symmetric sesquilinear forms, Hilbert space, Compact linear operator, Discrete spectrum and min–max principle for a compact coercive form).

[F4]

The directed energy best-approximation gap is the supremum of normalized distances to the trial space (Best-approximation gap of a finite-dimensional eigenspace).

[F5]

For an isolated repeated cluster, the conforming Galerkin theorem compares the invariant eigenspaces and does not select individual eigenvectors (Conforming Galerkin invariant subspaces converge across an isolated cluster).

[F6]

Under Countable Choice, a complete totally bounded metric space is compact; the compact-operator definition reduces compactness to compactness of the closure of a unit-ball image (Finite ε-net and totally bounded metric space, A complete, totally bounded metric space is compact, proved from countable choice used exactly once, Compact linear operator, The Axiom of Countable Choice (ACω)).

[F8]

The natural numbers are unbounded in R (Every complete ordered field is Archimedean).

[A1]

Countable Choice is assumed by the compact-form theorem and the cluster theorem (The Axiom of Countable Choice (ACω)).

Proof

technique · direct

Given: The weighted sequence space, inclusion J, form a, eigenspace E, and trial spaces Vn=E for n≥1.

1.1F1F2givenalgebra

Let (x(n)) be Cauchy in H. For each j∈I, xj(n) is Cauchy in R because ∣xj(n)−xj(m)∣≤∥x(n)−x(m)∥H; let xj be its limit by [F2]. The norms ∥x(n)∥H are bounded: after some index every term is within 1 of one fixed term, and the finitely many earlier norms have a maximum. Thus they are bounded by some C. For every finite F⊆I, passage to coordinate limits gives ∑j∈F∣xj∣2≤C2, so x=(xj)∈H by [F1]. Given ε>0, choose N so ∥x(n)−x(m)∥H<ε/2 for n,m≥N. For fixed n≥N and finite F, let m→∞ in ∑j∈F∣xj(n)−xj(m)∣2<ε2/4; taking the supremum over finite F gives ∥x(n)−x∥H≤ε/2<ε. Thus H is complete.

2.1F1F9step 1.1givenalgebra

Define U:V→H by (Uu)j=λjuj. The estimate ∑jλj∣αuj+βvj∣2≤2∣α∣2∥u∥V2+2∣β∣2∥v∥V2 shows V is a vector space, and the coordinate formula makes U linear. It is onto, since y∈H has preimage uj=yj/λj∈V, and it is an isometry from ∥⋅∥V to ∥⋅∥H. Moreover a(u,v)=(Uu,Uv)H, so the series defining a is well-defined and a is the inner product inducing ∥⋅∥V. Step 1.1 and this isometry make V a Hilbert space. Since λj≥1, a(u,u)≥∥Ju∥H2; [F9] gives ∣a(u,v)∣≤∥u∥V∥v∥V, so a is bounded and coercive. Finite truncations are dense in H by the tail property in [F1], so J is injective with dense range.

3.1F1F6F7F8A1step 2.1givenalgebra

Let BV:={u∈V:∥u∥V≤1}. For any ε>0, choose N≥2 with 1/(N+1)<ε2/4 by [F8]. If x=Ju with u∈BV, then ∑j>N∣xj∣2=∑j>N∣uj∣2≤(N+1)−1∑j>Nλj∣uj∣2≤1/(N+1). The ellipsoid CN:={(z1,…,zN)∈RN:∑j≤Nλj∣zj∣2≤1} is closed and bounded, hence compact by [F7]. Its open balls of radius ε/2 centered at its points cover it, so compactness gives a finite ε/2-net with centers in CN. Each center z lifts by zero padding to z~=(z1,…,zN,0,…)∈J(BV). For x=Ju∈J(BV), its prefix lies in CN and the tail norm is less than ε/2, so some lift satisfies ∥x−z~∥H<ε. Thus J(BV) is totally bounded. Its closure C:=J(BV)‾ is totally bounded as well: a finite ε/2-net for J(BV) is an ε-net for C by the triangle inequality and the definition of closure. The set C is complete because it is closed in the complete space H. By [F6], C is compact; the unit-ball criterion in Compact linear operator now shows that J is compact.

3.2F3A1step 2.1givenalgebra

For every coordinate vector ej, a(ej,v)=λj(Jej,Jv)H. For nonzero u∈V, a(u,u)∥Ju∥H2=∑jλj∣uj∣2∑j∣uj∣2≥1, with equality exactly when uj=0 for every j≥3. Conversely, testing any weak eigenpair equation at v=ej gives (λj−λ)uj=0 for each j, so every eigenvalue is one of the λj and its eigenspace is the span of the corresponding coordinate vectors. Hence the first eigenvalue is 1 with eigenspace E, and the next is λ3=3.

4.1F4F5A1step 3.2given

The restriction of the continuous form to each Vn=E is the identity form, so its two Ritz values are 1 and the full cluster eigenspace En=E. For every u∈E, u∈Vn, so [F4] gives δa(E,Vn)=0; likewise the gap from E to En is zero. The cluster theorem [F5] applies with r=1,s=2 and its gap conclusion is attained exactly.

5.1step 4.1givenalgebra∎

For every positive integer n, set un=e1 when n is even and un=e2 when n is odd. Both are unit Ritz eigenvectors for the same repeated eigenvalue 1. Their successive energy distances are ∥e1−e2∥a=2, so (un) is not Cauchy and cannot converge. This does not contradict step 4.1: the invariant subspace remains exactly E, while the repeated eigenspace supplies no preferred basis vector.

Remarks

The trial spaces in this abstract illustration are constant and are not a mesh-refinement family. It isolates the multiplicity issue: a subspace gap can be zero even when an arbitrary sequence of eigenvector choices has no limit.

Sources