Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck pass
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.

Newton sign iteration converges off the imaginary axis and is locally quadratic

Statement

Let A∈Cn×n, n≥1, have no eigenvalues on iR, let S=sign⁡(A), and define the exact Newton sequence X0=A,Xk+1=12(Xk+Xk−1). Then every iterate is defined, Xk→S, and for every submultiplicative matrix norm, ∥Xk+1−S∥≤12∥Xk−1∥ ∥Xk−S∥2. Thus the exact iteration is locally quadratically convergent. No error bound for rounded iterates of Finite-budget Newton iteration for the matrix sign is asserted.

Facts & Assumptions

Given: A finite complex matrix with spectrum disjoint from the imaginary axis and the exact Newton sequence.

[F1]

The scalar sign is 1 on the open right half-plane and −1 on the open left half-plane, and S is its analytic primary matrix function (Primary matrix sign for spectra off the imaginary axis).

[F2]

Analytic primary functions are given blockwise by their Taylor jets and respect similarity (Jordan, contour, similarity, and normal-functional-calculus formulas agree).

[F3]

The given exact sequence in the Statement is defined by Xk+1=(Xk+Xk−1)/2 whenever Xk is invertible. This is a defining recurrence, independent of the rounded algorithm.

[F4]

Every finite-dimensional complex normed space is complete (Every finite-dimensional normed space is Banach).

Proof

1.1F1F2F3algebra

In a Jordan representation of A, [F1]–[F2] give S=I on every right-half-plane block and S=−I on every left-half-plane block. Hence S2=I and AS=SA. Conjugate the exact iterates into this basis. Initially they are block diagonal with upper-triangular Jordan blocks. If Xk has this form, its inverse, when defined, has the same block structure and its diagonal entries are the reciprocals of those of Xk. Thus each diagonal entry follows the scalar update λk+1=(λk+λk−1)/2. Whenever Re⁡λk≠0, Re⁡λk+1=Re⁡λk2(1+∣λk∣−2), so its nonzero real-part sign is unchanged. By induction all diagonal entries remain nonzero and off iR, each Xk is invertible, and the next update is defined.

2.1F1F2F3step 1.1algebra

Since the Jordan-block diagonal values remain in the same half-planes, [F2] gives sign⁡(Xk)=S for every k. Also Xk commutes with S: this holds for X0=A, and if it holds for Xk, then its inverse also commutes with S, so the update [F3] preserves commutation. The eigenvalues of Xk+S are λk+s on the corresponding blocks, with Re⁡(λk+s)≠0 because Re⁡λk has sign s. Thus Xk+S is invertible. Define Gk=(Xk−S)(Xk+S)−1.

3.1step 1.1step 2.1algebra

Using S2=I and commutation with Xk, expansion gives Xk+1±S=12Xk−1(Xk±S)2,Gk+1=Gk2. Hence Gk=G02k. The eigenvalues of G0 are (λ−s)/(λ+s); their moduli are less than one because ∣λ+s∣2−∣λ−s∣2=4sRe⁡λ>0.

4.1F2step 3.1algebra

In a Jordan basis of A, G0=(A−S)(A+S)−1 is block upper triangular; on a block at λ its diagonal is μ=(λ−s)/(λ+s) and its strictly upper triangular part is nilpotent, say N0d=0. Its qth power is ∑j<d(qj)μq−jN0j. Each term tends to zero as q→∞ because ∣μ∣<1 and exponential decay dominates the polynomial factor (qj); if μ=0, the nilpotent block power is eventually zero. Thus G02k→0. The eigenvalues of Gk=G02k have modulus less than one, so I−Gk is invertible. Rearranging the definition of Gk gives Xk=(I−Gk)−1(I+Gk)S, so Xk→S.

5.1F1F4step 1.1step 4.1algebra∎

Direct expansion, using XkS=SXk and S2=I, gives Xk+1−S=12Xk−1(Xk−S)2. Taking any submultiplicative norm proves the stated quadratic inequality. To bound the inverse near the limit, write Xk=S(I+Yk) with Yk=S−1(Xk−S). Since Xk→S, eventually ∥Yk∥<1/2. The geometric series ∑j≥0(−Yk)j is Cauchy in the chosen norm because its tail is bounded by the scalar geometric tail; the matrix space is complete by [F4]. Multiplication of its partial sums by I+Yk shows its sum is (I+Yk)−1, whose norm is at most ∥I∥+∥Yk∥/(1−∥Yk∥)≤∥I∥+1. Thus ∥Xk−1∥≤(∥I∥+1)∥S−1∥ eventually, so the displayed inequality has a fixed quadratic constant near the limit.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

30 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