Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-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.

Periodic finite orthogonal compact-filter wavelet transform

Definition

Let L≥1, let N be even with N≥2L, and let h=(h0,…,hL−1)∈RL. Set gj=(−1)jhL−1−j for 0≤j<L, and set hj=gj=0 for all other integers j. The pair (h,g) is an admissible orthogonal filter pair when ∑jhj=2,∑jgj=0,∑jhjhj−2r=δr0,∑jgjgj−2r=δr0,∑jhjgj−2r=0(r∈Z). Here δr0=1 for r=0 and 0 for r≠0. For x∈RN, define ak=∑j=0L−1hjx(2k+j) mod N,dk=∑j=0L−1gjx(2k+j) mod N(0≤k<N/2). This is the one-level periodic analysis map. It has no padding: the indices are reduced modulo N. Its matrix W has the N/2 rows for ak followed by the N/2 rows for dk. Synthesis is, by definition, multiplication by WT. A multilevel transform repeats this one-level rule on the approximation vector while its current length M is even and M≥2L, then stops; the boundary convention at every level is periodic modulo that level's current length.

Depends on

Used by

Dependency tree · two levels

14 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