Alphabeta Math
False statementConstruction: AI-adaptedVerification: AI-adaptedprecheck passaudited 2026-08-27
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.

FALSE: an arbitrary pointwise supremum of subharmonic functions is subharmonic

Statement refuted

The pointwise supremum of an arbitrary family of subharmonic functions is always subharmonic.

Facts & Assumptions

Given: For each n≥1, the function un(z)=max⁡{nRe⁡z,−1} on the unit disc.

[L1]

Finite maxima of subharmonic functions are subharmonic; in particular, the maximum of a harmonic function and a constant is subharmonic (Positive linear combinations and finite maxima preserve subharmonicity).

[L2]

The upper-envelope theorem requires a locally bounded-above family before taking a supremum and then regularizing it (The upper-semicontinuous regularization of a locally bounded-above subharmonic supremum is subharmonic).

Refutation

technique · direct
1.1L1givenalgebra

The function Re⁡z is harmonic on the unit disc, so nRe⁡z is harmonic for each n. By [L1], each [L1, given, algebra] un(z)=max⁡{nRe⁡z,−1} is subharmonic.

2.1step 1.1algebra

Their pointwise supremum is [step 1.1, algebra] u(z)=sup⁡nun(z)={Re⁡z,Re⁡z<0,0,Re⁡z=0,+∞,Re⁡z>0. This function is not even finite-valued on the right half-disc, so it cannot be subharmonic in the page's convention.

3.1L2step 2.1∎

Therefore the arbitrary-supremum claim is false. Step 2.1 is also exactly why [L2] insists on local boundedness above and upper-semicontinuous regularization.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

6 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