Alphabeta Math
CounterexampleConstruction: Literature-sourcedVerification: AI-adaptedPipeline-generatedprecheck passaudited 2026-09-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.

Naive inversion is not the L1 involution on a nonunimodular group

Statement refuted

Assume the Axiom of Choice (The Axiom of Choice).

Let G={(a,b):a>0, b∈R} be the affine group of The modular function of the affine group of the line, with the left Haar measure dμ=a−2 da db and modular function ΔG(a,b)=a−1. Then the naive inversion formula Jf(x):=f(x−1)‾, without the modular factor fails to give an isometry of L1(G), even on Cc(G); consequently it is not the involution f∗(x)=ΔG(x−1)f(x−1)‾ of Involution on L1 of a locally compact group, which is isometric (The L1 involution is isometric, involutive and reverses convolution).

Facts & Assumptions

Given: The affine group G with dμ=a−2 da db, ΔG(a,b)=a−1, and a nonnegative compactly supported cutoff supported in the region a>1.

[F1]

G is an LCH group with left Haar measure dμ=a−2da db and ΔG(a,b)=a−1; inverses are (a,b)−1=(a−1,−b/a) and ΔG≡1 fails, so G is nonunimodular (The modular function of the affine group of the line, Unimodular locally compact group).

[F2]

Haar change of variables under inversion: ∫GH(x−1) dμ(x)=∫GΔG(x−1)H(x) dμ(x) for nonnegative Borel H (with extended integrals), and for complex Borel H whenever ∫GΔG(x−1)∣H(x)∣ dμ(x)<∞ (Haar change of variables under inversion).

[F3]

The L1 involution is f∗(x)=ΔG(x−1)f(x−1)‾ and is isometric, ∥f∗∥1=∥f∥1, for every f∈L1(G) (Involution on L1 of a locally compact group, The L1 involution is isometric, involutive and reverses convolution).

[F4]

L1(G) consists of the a.e. classes of integrable complex functions with ∥f∥1=∫G∣f∣ dμ, and Cc(G) functions lie in L1(G) (Complex Haar L^p spaces and compactly supported functions, Left Haar integral and left Haar measure).

[F5]

Under Dependent Choice, for a compact K inside an open U there is f∈Cc(G) with 1K≤f≤1U and supp⁡f⊆U by the cited proof's construction; AC implies Dependent Choice (LCH Urysohn cutoff, The Axiom of Choice).

Counterexample

technique · direct
1.1

The modulus of Jf and the inversion formula. For a nonnegative f∈Cc(G), also Jf∈Cc(G) because inversion is a homeomorphism, and ∣Jf(x)∣=f(x−1). Thus [F2] gives ∥Jf∥1=∫Gf(x−1) dμ(x)=∫GΔG(x−1)f(x) dμ(x), while ∥f∥1=∫Gf(x) dμ(x); both integrals are finite by [F4].

F2F4
1.2

A witness in the region a>1. Take the open rectangle U:=(1,2)×(0,1) and a compact rectangle K:=[3/2,7/4]×[1/4,3/4]⊆U, and let f∈Cc(G) be given by [F5] under the Dependent Choice derived from the assumed AC, with 1K≤f≤1U. Then f≥0, f≢0, and on supp⁡f⊆U one has a>1, hence a−1>a−2 everywhere on (1,2).

F5
2.1

Comparison of norms. Since f≥0 and supp⁡f⊆{a>1}, step 1.1 gives ∥Jf∥1−∥f∥1=∫G(ΔG(x−1)−1)f(x) dμ(x)=∫G(a−1)f(a,b) a−2 da db, where a−1>0 on the support of f and f>0 on the nonempty open set where f≥1K=1, namely on the interior of K. The integrand is nonnegative continuous with a strictly positive value on an open subset of G, and a−2 da db gives positive measure to every nonempty open set, so ∥Jf∥1−∥f∥1>0: the norms differ.

F1F4step 1.1step 1.2
3.1

Since J changes the L1 norm of the nonzero compactly supported function f of step 1.2, it cannot define an isometry of L1(G); the modular involution [F3], by contrast, is isometric. The naive inversion f↦f(x−1)‾ is therefore not the L1 involution on this nonunimodular group. ∎

F3step 2.1

Counterexample notes

  • Where the failure comes from. The discrepancy is the factor ΔG(x−1)=a accumulated by the inversion substitution; on a unimodular group ΔG≡1 and the naive formula does define the involution.
  • Choice cost. The single cutoff function uses the Dependent Choice of [F5]; the comparison computation itself is choice-free.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

41 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