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.
Nested-basis H² multiplication is exact for its represented matrix
Statement
For every nested-basis H² representation and every vector , Nested-basis H² matrix-vector multiplication returns exactly.
Facts & Assumptions
Given: The H² bases and transfer matrices, the represented matrix , its block-cluster partition, and .
Nested H² cluster bases and interaction lists: on each child of a parent , ; column bases satisfy the analogous identity with .
Nested H² cluster bases and interaction lists: each admissible block is represented by , and each near block is stored densely.
Block-cluster leaves partition the index-pair set: terminal rectangles are disjoint and cover .
Nested-basis H² matrix-vector multiplication: the procedure computes column coefficients upward, accumulates coupling products, propagates row coefficients downward, and multiplies dense near blocks directly.
Proof
At a column leaf , the algorithm sets . Suppose this identity holds for both children of an internal cluster . By the nestedness in [F1] and the disjoint union of child indices, , exactly the upward update in [F4]. Induction gives for every column cluster.
Fix a far block . Its coupling contributes to . Each downward transfer from a parent to a child applies the corresponding ; repeated nestedness [F1] therefore turns into exactly its restriction on every descendant row leaf. Summing the finite far-block contributions gives their full matrix action.
By [F2] and [F4], every near block contributes its exact dense product . The far and near block leaves partition by [F3], so adding their actions gives every entry of exactly once in the matrix sum. Thus the returned vector is .
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
5 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
- Steffen Börm, Lars Grasedyck, and Wolfgang Hackbusch, Hierarchical Matrices, MiS Lecture Note 21 (2003; revised June 2006), Chapter 9, §§9.1–9.2 (standard reference, not scraped)
- Ralf Hiptmair, AdvNumCSE Lecture Document, Chapter 2, “Local Low-Rank Compression of Non-Local Operators” (ETH Zürich, AT’23), §2.4.6 (standard reference, not scraped)