Alphabeta Math
LemmaStatement: AI-generatedProof: AI-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.

Coefficient variation controls a weighted-shift operator

Statement

On finite orthonormal bases let T=∑xax∣p(x)⟩⟨x∣, where p is injective on the source labels with nonzero coefficients. Let Ts=∑xax(1+ex)∣p(x)⟩⟨x∣, with ∣ex∣≤ϵ. If the source basis is nonempty, then ∥T∥=max⁡x∣ax∣; if it is empty, then ∥T∥=0. In either case ∥Ts−T∥≤ϵ∥T∥ in operator norm. This applies to a fixed spherical channel (J,m)↦(J−1,m+δ) across finitely many source blocks, since the destinations are distinct. A zero T stays zero under this multiplicative coefficient change.

Facts & Assumptions

[F1]

Matrix units and adjoints use the specified finite orthonormal-basis convention. Finite operator and ket conventions

[F2]

For a linear map between finite-dimensional real or complex inner-product spaces, the operator norm is zero if the domain is zero; for nonzero domain it is ∥A∥=max⁡∥v∥=1∥Av∥. The operator norm is zero on the zero domain and otherwise is max_‖ v‖=1‖ Tv‖

Proof

Given: The finite injective shift and coefficient bounds. Goal: Establish the operator norm inequalities.

1.1givenF1F2

If the source basis is empty, both shifts are the zero map on the zero domain, so both norms are zero by [F2] and the claimed bound holds. Otherwise the source basis is nonempty. Put S={x:ax≠0}. All terms outside S vanish, and injectivity on S makes the destination vectors indexed by S pairwise orthogonal. Thus ∥Tv∥2=∑x∈S∣ax∣2∣vx∣2=∑x∣ax∣2∣vx∣2 for every vector in the source span, including when S is empty. This is bounded by (max⁡x∣ax∣)2∥v∥2, and equality is attained on a source basis vector with maximal coefficient, giving ∥T∥=max⁡x∣ax∣ by the operator-norm definition. The coefficients axex of Ts−T have support contained in S, so their nonzero destinations are also distinct; the same argument gives ∥Ts−T∥=max⁡x∣axex∣.

2.1givenstep 1.1∎

For a nonempty source basis, this maximum is at most ϵmax⁡x∣ax∣. For a fixed δ, equality of two destinations (J−1,m+δ) forces both J and m equal, so the claimed angular-momentum application is injective. If all ax vanish, both shifts vanish.

Depends on

Used by · 1

Dependency tree · 2 levels

Each result is drawn at its shortest distance from this item. Arrows run from prerequisites to the items that use them; this item has a heavier outline. External source nodes link directly to the cited text. The view shows up to two dependency steps; open a prerequisite to continue.