Alphabeta Math
AlgorithmAlgorithm: AI-adaptedProof: Not applicablePipeline-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-budget relaxed density-matrix mixing

Definition

Input: D0∈Dr from The fixed-particle admissible Hermitian density domain, a Hermitian response matrix map F:U→Hn whose domain contains every entered density iterate, and its occupied-projector map Φ, defined at the strict-gap points of U as in The occupied-projector response map on its strict-gap domain, a Hermitian eigensolver that for each F(Dk) returns a certified ordered spectrum and occupied projector when the gap is strict, a certified no-gap result, or a failure status, a fixed mixing parameter α∈[0,1], a fixed-point residual tolerance ε≥0, and a finite update budget N∈N0. For k=0,…,N, first call the eigensolver on F(Dk). If it fails, return (Dk,eigensolve-failure,∅,k); if the gap is absent, return (Dk,gap-loss,∅,k). Otherwise use the returned occupied projector as Φ(Dk) and compute rk=∥Dk−((1−α)Dk+αΦ(Dk))∥F. If rk≤ε, return (Dk,residual-tolerance-met,rk,k). If k=N, return (Dk,iteration-budget-exhausted,rk,k). Otherwise update Dk+1=(1−α)Dk+αΦ(Dk) and continue.

By Density mixing preserves admissibility but need not preserve idempotence, each successful update stays in Dr; it need not be idempotent. This algorithm uses the residual and finite-budget update pattern of Fixed-point iteration with a residual stop and finite budget for the relaxed map, with a gap check before each response evaluation. It makes no convergence claim unless the derivative-bound and invariance hypotheses in A uniform derivative bound certifies contraction of relaxed density mixing are verified. If α=0, then the relaxed residual is identically zero and the update does not move; that stop status alone says nothing about the unmixed response residual.

Depends on

Used by

Dependency tree · two levels

20 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