Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-6-luna)
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.

Positive diagonal maps preserve closed convex sets

Statement

Let d>=1, let C be a nonempty closed convex subset of R^d, and let D=diag(d_1,...,d_d) with every d_j>0. Then DC={Dx:x in C} is nonempty, closed, and convex.

Facts & Assumptions

Given: d>=1, C and D as in the Statement.

[F1]

A convex subset of Rm contains every line segment between two of its points: convexity means every segment between two points of C lies in C.

[F2]

The metric topology: a set is open when every one of its points has a ball around it inside the set; closed means open complement: C is closed exactly when its complement is open; an open set contains a positive-radius ball around each of its points.

[F5]

Finite sums and finite products, by recursion: finite sums are well-defined and obey their finite-sum algebra.

[F7]

Laws of finite sums and finite products: finite sums are additive, obey scaling and splitting, preserve nonnegativity, are monotone termwise, and each nonnegative term is at most the sum.

[F8]

Squares of nonzero elements are positive: a nonzero square is positive; a zero square is zero.

[F9]

Inverses of positives are positive, and reciprocation reverses order: the inverse of a positive real is positive; Integer powers am defines the negative powers used here.

[F10]

Squaring is monotone on the nonnegatives: if 0≤a,b, then a≤b exactly when a2≤b2.

[F11]

Ordered field: positive elements are closed under addition, so together with recursive Finite sums and finite products, by recursion every nonempty finite sum of positive terms is positive; Sign rules for products and monotonicity of multiplication says multiplication by a positive element preserves order.

Proof

Given: The objects in the Statement.

1.1F1givenchoosealgebra

Choose x_0 in C. Then Dx_0 in DC, so DC is nonempty. If x,y in C and t in [0,1], then by linearity D((1-t)x+ty)=(1-t)Dx+tDy; [F1] puts the left side in DC, so DC is convex.

1.2F2F3F4F5F6F7F8F9F10F11givenchoosealgebra

Fix z∉DC. Since each dj>0, the definition of negative integer powers gives dj−2=(dj2)−1. The square dj2 is positive by [F8], so dj−2>0 by [F9]. Thus ∑jdj−2>0 by [F11], and M=∑jdj−2 exists by [F6] and is positive. The inverse image x=D−1z is not in C. Since C is closed, [F2] supplies r>0 with B(x,r) disjoint from C. For every q∈Rd, ∥D−1q∥22=∑jdj−2qj2≤(∑jdj−2)(∑jqj2)=M2∥q∥22. Indeed each qj2 is nonnegative, is at most its finite sum by [F7], and multiplication by dj−2>0 preserves that inequality; summing uses [F7]. Both norms and M∥q∥2 are nonnegative, so [F10] yields ∥D−1q∥2≤M∥q∥2.

2.1F2F3step 1.1step 1.2algebra∎

If ||w-z||_2<r/M, then step 1.2 gives ||D^{-1}w-x||_2<r, hence D^{-1}w notin C and w notin DC. Therefore B(z,r/M) lies in the complement of DC. Every point outside DC has such a ball, so [F2] makes DC closed; step 1.1 already proved DC nonempty and convex.

Depends on

Used by

Dependency tree · two levels

50 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