Alphabeta Math
ExampleConstruction: AI-generatedVerification: AI-generatedPipeline-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.

A convex density mixture can be admissible without being a projector

Example

In dimension 2 with particle number r=1, let F(X)=diag⁡(0,1) on U=H2 and start from P0=diag⁡(0,1). Its response projector is P1=diag⁡(1,0), and mix with α=1/2.

Facts & Assumptions

Given: The constant Hermitian response F(X)=diag⁡(0,1), P0=diag⁡(0,1), and α=1/2.

[F1]

Every rank-r orthogonal projector is an admissible density (Every rank-r orthogonal projector is an admissible density).

[F3]

Mixing an admissible density with the defined rank-r response projector remains in Dr (Density mixing preserves admissibility but need not preserve idempotence).

Verification

1.1givenF1F2algebra

The matrix P0 is a Hermitian idempotent of trace 1, so P0∈P1 and P0∈D1 by [F1]. The constant response matrix has eigenvalues 0<1, so [F2] gives Φ(P0)=P1=diag⁡(1,0).

2.1step 1.1givenF3algebra

Direct calculation gives D=(1−α)P0+αΦ(P0)=12I2. By [F3], D∈D1; explicitly it is Hermitian, satisfies 0⪯D⪯I2, and has trace 1.

3.1step 2.1algebra∎

But D2=14I2≠D, so D is not idempotent and hence D∉P1. This verifies that relaxed density iterates must not be silently identified with projectors.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

11 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