Alphabeta Math
ExampleConstruction: AI-adaptedVerification: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6-sol)audited 2026-09-30
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.

Fredholm determinant of a finite-rank operator

Example

Assume AC. Let H be any complex Hilbert space, using the library convention that the inner product is linear in its first argument (The Axiom of Choice, Hilbert space, Real and complex inner-product spaces and their induced length). For every bounded finite-rank linear operator F:H→H (A bounded linear operator between normed spaces) and every finite-dimensional invariant subspace E⊇ran⁡F, the arbitrary-Hilbert local determinant satisfies DH(I+zF)=det⁡E(IE+z(F∣E))(z∈C). In particular, for u,v∈H and the rank-at-most-one operator F(x)=⟨x,v⟩u, DH(I+zF)=1+z⟨u,v⟩.

Facts & Assumptions

Given: AC; a complex Hilbert space H; a bounded finite-rank linear operator F; and, for the rank-one calculation, vectors u,v∈H with the library's linear-first inner-product convention.

[A1]

AC implies DC and Countable Choice; these are the exact choice strengths used by the trace-class and arbitrary-Hilbert determinant suppliers (The Axiom of Choice, AC implies DC implies countable choice).

[A2]

A complex Hilbert space is a complex inner-product space whose pairing is linear in its first argument, conjugate-symmetric, and positive definite (Hilbert space, Real and complex inner-product spaces and their induced length).

[A3]

The given F is a bounded linear operator; every finite-rank operator is compact and therefore trace class (A bounded linear operator between normed spaces, Trace class operator).

[A4]

Cauchy–Schwarz gives ∣⟨x,v⟩∣≤∥x∥ ∥v∥, and ∥λu∥=∣λ∣ ∥u∥ (Cauchy–Schwarz: ∣⟨x,y⟩∣≤∥x∥ ∥y∥, with equality exactly for dependent pairs, The induced length is a norm).

[A5]

For a trace-class operator on any complex Hilbert space, AC supplies a support-independent determinant DH. If F has finite rank, then for every finite-dimensional E⊆H containing ran⁡F, DH(I+zF)=det⁡E(IE+z(F∣E)), and the determinant on the zero space is 1 (Arbitrary-Hilbert Fredholm determinant from a separable reducing support).

[A7]

In an ordered basis, the matrix of a linear map has as its columns the coordinate columns of the images of the basis vectors (Coordinate columns [v]B and matrices [T]BC of linear maps relative to ordered bases).

[A8]

The determinant of a square matrix is given by the Leibniz formula, so for a one-by-one matrix [c] its determinant is c (For n≥1, the determinant over a commutative ring by the Leibniz formula, and ∣det⁡A∣ for a real matrix).

[A9]

The ordinary determinant of a finite-dimensional operator is its matrix determinant in an ordered basis, equals 1 on the zero space, and is basis-independent (The determinant of an endomorphism of a finite-dimensional vector space: its matrix determinant in an ordered basis in positive dimension, and 1 on the zero space, The determinant of a linear operator is independent of the chosen ordered basis).

Proof

technique · direct
1.1A1A3A5

By [A1], AC supplies the Countable Choice hypothesis needed in [A3] and [A5]. The finite-rank F in the statement is therefore trace class, so the arbitrary-Hilbert determinant theorem applies.

1.2A2A4algebra

Fix u,v∈H, put α:=⟨u,v⟩, and define F(x):=⟨x,v⟩u. By [A2], F is linear; [A4] gives ∥F(x)∥=∣⟨x,v⟩∣∥u∥≤∥v∥∥u∥∥x∥, so it is bounded. Its range lies in span⁡{u}, hence it has rank at most one. Also F(u)=αu.

2.1A5A8A9step 1.1

Let E be any finite-dimensional subspace containing ran⁡F. For every x∈E, F(x)∈ran⁡F⊆E, so E is F-invariant. By [A5], DH(I+zF)=det⁡E(IE+z(F∣E)) for every z∈C. If F=0, this says both sides are 1 because IE has determinant 1; this includes E={0}, where the convention is also explicitly in [A5].

3.1A5A6step 2.1step 1.2

If u=0, then F=0, α=0, and E={0} is finite-dimensional and contains the range. Step 2.1 gives DH(I+zF)=1=1+zα for all z; this also covers H={0}.

3.2A2A6A7A8A9step 2.1step 1.2

Suppose u≠0 and set E=span⁡{u}. By [A6], E is the set of scalar multiples of u. The one-element list (u) is independent: its only coefficient relation is λu=0, which forces λ=0. More generally, an injective finite list into {u} has at most one entry, since any two entries would both equal u; the empty list is independent, so {u} is independent under [A6]. It spans E, hence it is a basis and (u) is an ordered basis; thus E has dimension one. The range of F is contained in E, and E is invariant because F(u)=αu. Relative to (u), [A7] gives the matrix [α] for F∣E and [1+zα] for IE+z(F∣E). By [A8]–[A9], its ordinary determinant is 1+zα; step 2.1 therefore yields DH(I+zF)=1+z⟨u,v⟩. If v=0 then this is the zero operator and the value is 1; if v≠0 but α=0, then F(v)=⟨v,v⟩u≠0 and, for every x, F2(x)=⟨F(x),v⟩u=⟨x,v⟩⟨u,v⟩u=0. Thus the nonzero rank-one operator is nilpotent and its one-dimensional restriction is zero, so the determinant is again 1.

4.1

At z=0 both sides of the finite-rank identity and rank-one formula equal 1. The zero-rank case, the zero vector and zero Hilbert space, and the nilpotent rank-one case are covered in steps 2.1, 3.1, and 3.2; nonzero α gives the scalar factor 1+zα in step 3.2. There is no interval endpoint parameter. The only assumption is AC [A1]; no choices are made in the finite-dimensional rank-one calculation, and both conclusions are equalities rather than iff claims. [A1, A5, A6, A8, A9, step 2.1, step 3.1, step 3.2] \qed

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

90 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